An alternative normal form for elliptic curve cryptography: Edwards curves

Download

index.pdf

Date

2009

Author

Muş, Köksal

Metadata

Show full item record

Item Usage Stats

142
views

38
downloads

A new normal form x2 + y2 = c2(1 + x2y2) of elliptic curves was introduced by M. Harold Edwards in 2007 over the field k having characteristic different than 2. This new form has very special and important properties such that addition operation is strongly unified and complete for properly chosen parameter c . In other words, doubling can be done by using the addition formula and any two points on the curve can be added by the addition formula without exception. D. Bernstein and T. Lange added one more parameter d to the normal form to cover a large class of elliptic curves, x2 + y2 = c2(1 + dx2y2) over the same field. In this thesis, an expository overview of the literature on Edwards curves is given. First, the types of Edwards curves over the nonbinary field k are introduced, addition and doubling over the curves are derived and efficient algorithms for addition and doubling are stated with their costs. Finally, known elliptic curves and Edwards curves are compared according to their cryptographic applications. The way to choose the Edwards curve which is most appropriate for cryptographic applications is also explained.

Subject Keywords

Cryptography

URI

http://etd.lib.metu.edu.tr/upload/12611065/index.pdf
https://hdl.handle.net/11511/18845

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

Basic cryptanalysis methods on block ciphers Çelik, Dilek; Doğanaksoy, Ali; Department of Cryptography (2010) Differential cryptanalysis and linear cryptanalysis are the first significant methods used to attack on block ciphers. These concepts compose the keystones for most of the attacks in recent years. Also, while designing a cipher, these attacks should be taken into consideration and the cipher should be created as secure against them. Although di fferential cryptanalysis and linear cryptanalysis are still important, they started to be ine cient due to the improvements in the technology. So, these attacks are ...
A concatenated construction of linear complementary pair of codes GÜNERİ, CEM; Özbudak, Ferruh; Sacikara, Elif (Springer Science and Business Media LLC, 2019-09-01) A concatenated construction for linear complementary dual codes was given by Carlet et al. using the so-called isometry inner codes. Here, we obtain a concatenated construction to the more general family, linear complementary pair of codes. Moreover, we extend the dual code description of Chen et al. for concatenated codes to duals of generalized concatenated codes. This allows us to use generalized concatenated codes for the construction of linear complementary pair of codes.
Results on lcz sequences and quadratic forms Saygı, Elif; Özbudak, Ferruh; Department of Cryptography (2009) In this thesis we study low correlation zone (LCZ) sequence sets and a class of quadratic forms. In the first part we obtain two new classes of optimal LCZ sequence sets. In our first construction using a suitable orthogonal transformation we extend some results of [21]. We give new classes of LCZ sequence sets defined over Z4 in our second construction. We show that our LCZ sequence sets are optimal with respect to the Tang, Fan and Matsufiji bound [37]. In the second part we consider some special lineariz...
On the Representation of Finite Fields Akleylek, Sedat; Özbudak, Ferhun; Department of Cryptography (2010) The representation of field elements has a great impact on the performance of the finite field arithmetic. In this thesis, we give modified version of redundant representation which works for any finite fields of arbitrary characteristics to design arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values. We then propose new representations as an alternative way to represent finite fields of characteristic two by using Charlier and Herm...
On statistical analysis of synchronous stream ciphers Sönmez Turan, Meltem; Doğanaksoy, Ali; Department of Cryptography (2008) Synchronous stream ciphers constitute an important class of symmetric ciphers. After the call of the eSTREAM project in 2004, 34 stream ciphers with different design approaches were proposed. In this thesis, we aim to provide a general framework to analyze stream ciphers statistically. Firstly, we consider stream ciphers as pseudo random number generators and study the quality of their output. We propose three randomness tests based on one dimensional random walks. Moreover, we theoretically and experimenta...

Citation Formats

K. Muş, “An alternative normal form for elliptic curve cryptography: Edwards curves,” M.S. - Master of Science, Middle East Technical University, 2009.