The XTR public key system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1880, Issue , 2000, Pages 1-19

  Lenstra, Arjen K ^a   Verheul, Eric R ^b  

^a Emerging Technology   (United States)

^b Mergers and Acquisitions Group   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPUTATIONAL OVERHEADS; CRYPTOGRAPHIC PROTOCOLS; FINITE FIELDS; MULTIPLICATIVE GROUPS; XTR PUBLIC KEY SYSTEM;

CRYPTOGRAPHY;

EID: 84974628135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_1     Document Type: Conference Paper

References (24)

1. L.M. Adleman, J. DeMarrais, A subexponential algorithm for discrete logarithms over all finite fields, Proceedings Crypto’93, LNCS 773, Springer-Verlag 1994, 147-158.
2. D.V. Bailey, C. Paar, Optimal extension fields for fast arithmetic in public-key algorithms, Proceedings Crypto’98, LNCS 1462, Springer-Verlag 1998, 472-485.
3. A.E. Brouwer, R. Pellikaan, E.R. Verheul, Doing more with fewer bits, Proceedings Asiacrypt99, LNCS 1716, Springer-Verlag 1999, 321-332.
4. H. Cohen, A. Miyaji, T. Ono, Efficient elliptic curve exponentiation using mixed coordinates, Proceedings Asiacrypt’98, LNCS 1514, Springer-Verlag 1998, 51-65.
5. D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory 30 (1984), 587-594.
6. D. Coppersmith, personal communication, March 2000.
7. T. ElGamal, A Public Key Cryptosystem and a Signature scheme Based on Discrete Logarithms, IEEE Transactions on Information Theory 31(4), 1985, 469-472.
8. P. Gaudry, F. Hess, N.P. Smart, Constructive and destructive facets of Weil descent on elliptic curves, manuscript, January, 2000, submitted to Journal of Cryptology.
9. D. Gordon, Discrete logarithms in GF(p) using the number field sieve, SIAM J. Discrete Math. 6 (1993), 312-323.
10. D.E. Knuth, The art of computer programming, Volume 2, Seminumerical Algorithms, second edition, Addison-Wesley, 1981.
11. A.K. Lenstra, Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields, Proceedings ACISP97, LNCS 1270, Springer-Verlag 1997, 127-138.
12. A.K. Lenstra, Generating RSA moduli with a predetermined portion, Proceedings Asiacrypt ’98, LNCS 1514, Springer-Verlag 1998, 1-10.
13. A.K. Lenstra, E.R. Verheul, Key improvements to XTR, in preparation.
14. A.J. Menezes, Comparing the security of ECC and RSA, manuscript, January, 2000, available as www.cacr.math.uwaterloo.ca/ajmeneze/misc/cryptogramarticle.html.
15. A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Handbook of applied cryptography, CRC Press, 1997.
16. A.M. Odlyzko, Discrete Logarithms: The past and the future, Designs, Codes and Cryptography, 19 (2000), 129-145.
17. S.C. Pohlig, M.E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. on IT, 24 (1978), 106-110.
18. J.M. Pollard, Monte Carlo methods for index computation (mod p), Math. Comp., 32 (1978), 918-924.
19. O. Schirokauer, Discrete logarithms and local units, Phil. Trans. R. Soc. Lond. A 345, 1993, 409-423.
20. O. Schirokauer, personal communication, March 2000.
21. O. Schirokauer, D. Weber, Th.F. Denny, Discrete logarithms: the effectiveness of the index calculus method, Proceedings ANTS II, LNCS 1122 Springer-Verlag 1996.
22. C.P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, 4 (1991), 161-174.
23. S.A. Vanstone, R.J. Zuccherato, Short RSA keys and their generation, Journal of Cryptology, 8 (1995), 101-114.
24. E. Verheul, Certificates of recoverability with scalable recovery agent security, Proceedings of PKC 2000, LNCS 1751, Springer-Verlag 2000, 258-275.