National Repository of Grey Literature 2 records found  Search took 0.02 seconds. 
Smart's algorithm
Sladovník, Tomáš ; Příhoda, Pavel (advisor) ; Šťovíček, Jan (referee)
The discrete logarithm problem is one of the most common trap- door functions in asymmetric cryptography and the use of elliptic curves over a finite field with prime characteristics seems to be a very efficient platform. This paper addresses the solution of a special type of elliptic curves where the number of points is equal to the characteristic of a field. Our goal is to construct a linear algorithm in goup operations and prove correctness. In order to create the algorithm, we will implement p-adic numbers, introduce the theory of formal groups and the formal logarithm and subgroups of an elliptic curve over the field of p-adic numbers. We will show that this type of curves is absolutely useless for cryptography because these curves are not safe. 1
Smart's algorithm
Sladovník, Tomáš ; Příhoda, Pavel (advisor) ; Šťovíček, Jan (referee)
The discrete logarithm problem is one of the most common trap- door functions in asymmetric cryptography and the use of elliptic curves over a finite field with prime characteristics seems to be a very efficient platform. This paper addresses the solution of a special type of elliptic curves where the number of points is equal to the characteristic of a field. Our goal is to construct a linear algorithm in goup operations and prove correctness. In order to create the algorithm, we will implement p-adic numbers, introduce the theory of formal groups and the formal logarithm and subgroups of an elliptic curve over the field of p-adic numbers. We will show that this type of curves is absolutely useless for cryptography because these curves are not safe. 1

Interested in being notified about new results for this query?
Subscribe to the RSS feed.