More generalized Mersenne numbers (extended abstract)

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

Volumn 3006, Issue , 2004, Pages 335-347

  Chung, Jaewook ^a   Hasan, Anwar ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

EXTENDED ABSTRACTS; GENERALIZED MERSENNE NUMBERS; MODULAR ARITHMETIC; MODULAR MULTIPLICATION TECHNIQUES; MODULAR REDUCTION; POLYNOMIAL FORM; KARATSUBA-OFMAN; MONTGOMERY;

ARTIFICIAL INTELLIGENCE; CRYPTOGRAPHY;

EID: 34547722936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24654-1_24     Document Type: Article

References (8)

1. Daniel V. Bailey and Christof Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, 14(3):153-176, 2001.
2. Richard B. Crandall. Method and apparatus for public key exchange in a cryptographic system (oct. 27, 1992). U.S. Paent # 5,159,632.
3. Donald E. Knuth. Seminumerical Algorithms. Addison-Wesley, 1981.
4. Arjen K. Lenstra and Eric R. Verheul. The XTR public key system. In Advances in Cryptology - CRYPTO 2000, LNCS 1880, pages 1-19. Springer-Verlag, 2000.
5. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
6. National Institute of Standards and Technology. Digital signature standard (DSS). FIPS Publication 186-2, February, 2000.
7. National Institute of Standards and Technology. Recommended elliptic curves for federal government use, July, 1999.
8. Jerome A. Solinas. Generalized Mersenne numbers. Technical Report CORR 99-39, Centre for Applied Cryptographic Research, University of Waterloo, 1999. http://cacr.uwaterloo.ca/techreports/1999/corr99-39.ps.