A New Model of Binary Elliptic Curves

In this paper, we present a new model of elliptic curves over finite fields of characteristic 2. We first describe the group law on this new binary curve. Furthermore, this paper presents the unified addition formulas for new binary elliptic curves, that is the point addition formulas which can be used for almost all doubling and addition. Finally, this paper presents explicit addition formulas for differential addition.

[1]  Aggelos Kiayias,et al.  BiTR: Built-in Tamper Resilience , 2011, IACR Cryptol. ePrint Arch..

[2]  Martijn Stam,et al.  On Montgomery-Like Representationsfor Elliptic Curves over GF(2k) , 2003, Public Key Cryptography.

[3]  Aggelos Kiayias,et al.  Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, San Francisco, CA, USA, February 14-18, 2011. Proceedings , 2011, CT-RSA.

[4]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[5]  Tibor Juhas.  The use of elliptic curves in cryptography , 2007 .

[6]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[7]  Yvo Desmedt.  Public Key Cryptography — PKC 2003 , 2002, Lecture Notes in Computer Science.

[8]  Alfred Menezes,et al.  Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.

[9]  Arto Salomaa,et al.  Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.

[10]  Marc Joye,et al.  Weierstraß Elliptic Curves and Side-Channel Attacks , 2002, Public Key Cryptography.

[11]  Aggelos Kiayias,et al.  Multi-query Computationally-Private Information Retrieval with Constant Communication Rate , 2010, Public Key Cryptography.

[12]  Tanja Lange,et al.  Binary Edwards Curves , 2008, CHES.

[13]  Kwang Ho Kim,et al.  A New Method for Speeding Up Arithmetic on Elliptic Curves over Binary Fields , 2007, IACR Cryptol. ePrint Arch..

[14]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[15]  P. L. Montgomery.  Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[16]  Elisabeth Oswald,et al.  Cryptographic Hardware and Embedded Systems - CHES 2008, 10th International Workshop, Washington, D.C., USA, August 10-13, 2008. Proceedings , 2008, CHES.

[17]  Marc Joye,et al.  Binary Huff Curves , 2011, CT-RSA.

[18]  Pierrick Gaudry,et al.  The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines , 2009, Finite Fields Their Appl..

[19]  Marc Joye,et al.  Efficient Arithmetic on Hessian Curves , 2010, Public Key Cryptography.

[20]  Kimmo Järvinen,et al.  Fast point multiplication on Koblitz curves: Parallelization method and implementations , 2009, Microprocess. Microsystems.

[21]  Joseph H. Silverman,et al.  The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.