Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Theoretical Computer Science - Special issue: cryptography
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
More Flexible Exponentiation with Precomputation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Generating RSA Moduli with a Predetermined Portion
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Journal of Symbolic Computation
An algorithm for solving the discrete log problem on hyperelliptic curves
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Speeding up bipartite modular multiplication
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Journal of Cryptology
Faster explicit formulas for computing pairings over ordinary curves
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
System integration of Elliptic Curve Cryptography on an OMAP platform
SASP '11 Proceedings of the 2011 IEEE 9th Symposium on Application Specific Processors
Curve25519: new diffie-hellman speed records
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
New directions in cryptography
IEEE Transactions on Information Theory
Fast elliptic curve cryptography in OpenSSL
FC'11 Proceedings of the 2011 international conference on Financial Cryptography and Data Security
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Four-Dimensional gallant-lambert-vanstone scalar multiplication
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
This paper explores the potential for using genus 2 curves over quadratic extension fields in cryptography, motivated by the fact that they allow for an 8-dimensional scalar decomposition when using a combination of the GLV/GLS algorithms. Besides lowering the number of doublings required in a scalar multiplication, this approach has the advantage of performing arithmetic operations in a 64-bit ground field, making it an attractive candidate for embedded devices. We found cryptographically secure genus 2 curves which, although susceptible to index calculus attacks, aim for the standardized 112-bit security level. Our implementation results on both high-end architectures (Ivy Bridge) and low-end ARM platforms (Cortex-A8) highlight the practical benefits of this approach.