Key improvements to XTR

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

Volumn 1976, Issue , 2000, Pages 220-233

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

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b Beijing PricewaterhouseCoopers Management Consulting   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

HIGH PROBABILITY; NON-TRIVIAL; ONE-TIME; PARAMETER SET; PROBABILISTIC APPROACHES; PUBLIC KEYS;

COMPUTATION THEORY;

EID: 84937417792     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_17     Document Type: Conference Paper

References (6)

1. A.E. Brouwer, R. Pellikaan, E.R. Verheul, Doing more with fewer bits, Proceedings Asiacrypt99, LNCS 1716, Springer-Verlag 1999, 321-332.
2. H. Cohen, A. Miyaji, T. Ono, Efficient elliptic curve exponentiation using mixed coordinates, Proceedings Asiacrypt’98, LNCS 1514, Springer-Verlag 1998, 51-65.
3. A.K. Lenstra, Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields, Proceedings ACISP97, LNCS 1270, Springer-Verlag 1997, 127-138.
4. A.K. Lenstra, E.R. Verheul, The XTR public key system, Proceedings Crypto 2000, LNCS 1880, Springer-Verlag 2000, 1-19; available from www.ecstr.com.
5. A.K. Lenstra, E.R. Verheul, Fast irreducibility testing for XTR, in preparation.
6. W.K. Nicholson, Introduction to abstract algebra, PWS-Kent Publishing Company, Boston, 1993.