论文信息 - The mpFq library and implementing curve-based key exchanges

The mpFq library and implementing curve-based key exchanges

We present a library for finite field arithmetic. The originality of this library lies in the fact that specialized code is automatically produced for the selected finite fields. The opportunity of compile-time optimizations yields substantial performance improvements compared to libraries which initialize the finite field at runtime. This library is used to present benchmarks on some curve-based public key cryptosystems.

Pierrick Gaudry | Emmanuel Thom

[1] Aggelos Kiayias,et al. Public Key Cryptography - PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. ... (Lecture Notes in Computer Science) , 2006 .

[2] Daniel J. Bernstein,et al. Curve25519: New Diffie-Hellman Speed Records , 2006, Public Key Cryptography.

[3] Roberto Maria Avanzi,et al. Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations , 2004, CHES.

[4] Zheng Wang,et al. Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ , 2008, J. Math. Cryptol..

[5] Tanja Lange,et al. Handbook of Elliptic and Hyperelliptic Curve Cryptography , 2005 .

[6] Pierrick Gaudry. Fast genus 2 arithmetic based on Theta functions , 2007, J. Math. Cryptol..

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

[8] Robert Harley,et al. Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy , 2001, EUROCRYPT.

[9] P. L. Montgomery. Modular multiplication without trial division , 1985 .

[10] Christof Paar,et al. Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems , 2005, IEEE Transactions on Computers.