Evidence that XTR is more secure than supersingular elliptic curve cryptosystems

Journal of Cryptology

Volumn 17, Issue 4, 2004, Pages 277-296

  Verheul, Eric R ^a  

^a Mergers and Acquisitions Group   (Netherlands)

Author keywords

Decision Diffie Hellman problem; Escrow; Inverting MOV embedding; Supersingular elliptic curves; Tripartite Diffie Hellman key exchange; XTR

Indexed keywords

ALGORITHMS; CURVE FITTING; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

DECISION DIFFIE-HELLMAN PROBLEM; ESCROW; INVERTING MOV EMBEDDING; SUPERSINGULAR ELLIPTIC CURVE; TRIPARTITE DIFFIE-HELLMAN KEY EXCHANGE; XTR;

CRYPTOGRAPHY;

EID: 23044474013     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-004-0313-x     Document Type: Article

References (21)

1. D. Boneh, M. Franklin, Identity-based encryption from the Weil pairing, Proceedings of Crypto 2001, LNCS 2139, Springer-Verlag, Berlin, 2001, pp. 213-229.
2. R. Cramer, R. Gennaro, B. Schoenmakers, A secure and optimally efficient multi-authority election scheme, Advances in Cryptology - EUROCRYPT '97 Proceedings, Springer-Verlag, Berlin, 1997, pp. 103-118.
3. R. Cramer, V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, Proceedings of Crypto 1998, LNCS 1462, Springer-Verlag, Berlin, 1998, pp. 13-25.
4. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory 31(4) (1985), 469-472.
5. G. Gong, L. Harn, Public key cryptosystems based on cubic finite field extensions, IEEE Trans. Inform. Theory, (II) 1999.
6. A. Joux, A one round protocol for tripartite Diffie-Hellman, 4th International Symposium, Proceedings of ANTS, LNCS 1838, Springer-Verlag, Berlin, 2000, pp. 385-394.
7. A. Joux, The Weil and Tate pairings as building blocks for public key cryptography, 5th International Symposium, Proceedings of ANTS, LNCS 2369, Springer-Verlag, Berlin, 2002, pp. 20-32.
8. A. Joux, K. Nguyen, Seperating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups, in preparation. Available from eprint.iacr.org.
9. N. Koblitz, An elliptic curve implementation of the finite field digital signature algorithm, Proceedings of Crypto '98, LNCS 1462, Springer-Verlag, Berlin, 1998, pp. 327-337.
10. N. Koblitz, The 4th Workshop on Elliptic Curve Cryptography (ECC 2000), Essen, October 4-6, 2000.
11. A.K. Lenstra, E.R. Verheul, The XTR public key system, Proceedings of Crypto 2000, LNCS 1880, Springer-Verlag, Berlin, 2000, pp. 1-19; available from www.ecstr.com.
12. A.K. Lenstra, E.R. Verheul, Key improvements to XTR, Proceedings of Asiacrypt 2000, LNCS 1976, Springer-Verlag, Berlin, 2000, pp. 220-223; available from www.ecstr.com.
13. A.K. Lenstra, E.R. Verheul, Fast irreducibility and subgroup membership testing in XTR, Proceedings of the 2001 Public Key Ctyptogmphy Conference, LNCS 1992, Springer-Verlag, Berlin, 2001, pp. 73-86; available from www.ecstr.com.
14. R. Lidl, W.B. Müller, Permutation polynomials in RSA-cryptosystems, Crypto '83 Proceedings, Plemium Press, 1984, pp. 293-301.
15. A. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer, Boston, MA, 1993.
16. A. Menezes, T. Okamoto, S.A. Vanstone, Reducing elliptic curve logarithms to a finite field, IEEE Trans. Inform. Theory, 39 (1993), 1639-1646.
17. A. Menezes, S.A. Vanstone, ECSTR (XTR): Elliptic Curve Singular Trace Representation, Rump Session of Crypto 2000.
18. S.C. Pohlig, M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Inform. Theory, 24 (1978), 106-110.
19. J. Silverman, The Arithmetic on Elliptic Curves, Springer-Verlag, New York, 1986.
20. P. Smith, C. Skinner, A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discrete logarithms, Asiacrypt '94 Proceedings, Springer-Verlag, Berlin, 1995, pp. 357-364.
21. E. Verheul, Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, Proceedings of Eumcrypt 2001, LNCS 2045, Springer-Verlag, Berlin, 2001, pp. 195-210.