Home > Search Results: Štěpánek, Vilém
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Complexity of some factoring algorithms
 Štěpánek, Vilém ; Příhoda, Pavel (advisor) ; Jedlička, Přemysl (referee)
Thesis is devoted to estimate complexity of algorithms running time for factorization of integer using ECM. Firstly, basic characteristic of elliptic curves over finite fields are sketched and presented two theorems on which this problematic is based. Consequently, there are given necessary estimates by some constants and ECM algorithms behavior is sketched. After that there is shown estimated complexity of algorithm ECM and finally there is specified implementation of factoring algorithm ECM.
Detailed record
Complexity of some factoring algorithms
 Štěpánek, Vilém ; Příhoda, Pavel (advisor) ; Jedlička, Přemysl (referee)
Thesis is devoted to estimate complexity of algorithms running time for factorization of integer using ECM. Firstly, basic characteristic of elliptic curves over finite fields are sketched and presented two theorems on which this problematic is based. Consequently, there are given necessary estimates by some constants and ECM algorithms behavior is sketched. After that there is shown estimated complexity of algorithm ECM and finally there is specified implementation of factoring algorithm ECM.
Detailed record

See also: similar author names
6 Štěpánek, Vojtěch
4 Štěpánek, Václav
1 Štěpánek, Vít
Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English