XTR implementation on reconfigurable hardware

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

Volumn 3156, Issue , 2004, Pages 386-399

  Peeters, Eric ^a   Neve, Michael ^b   Ciet, Mathieu ^b  

^a B 1348   (Belgium)

^b INNOVA CARD   (France)

Author keywords

Efficient implementation; Public key cryptosystem; Reconfigurable hardware; XTR

Indexed keywords

COMPUTER HARDWARE; CRYPTOGRAPHY; EMBEDDED SYSTEMS; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); HARDWARE; PUBLIC KEY CRYPTOGRAPHY; TRACE ELEMENTS;

EFFICIENT IMPLEMENTATION; EXPONENTIATIONS; HARDWARE IMPLEMENTATIONS; INTRINSIC PARALLELISMS; MODULAR MULTIPLICATION; PUBLIC KEY CRYPTOSYSTEMS; SMALL AREA;

RECONFIGURABLE HARDWARE;

EID: 33750611182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28632-5_28     Document Type: Article

References (28)

1. IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society, August 29, 2000.
2. Paul Barrett. Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In A.M. Odlyzko, Ed., Advances in Cryptology, Proc. Crypto'86, pages 311-323, vol. 263 of Lecture Notes in Computer Science, Springer-Verlag, 1987.
3. Richard P. Brent and H.T. Kung. The Area-Time Complexity of Binary Multiplication. In J.ACM, vol. 28, 1981, pages 521-534, July 1981.
4. Ernest F. Brickell. A fast modular multiplication algorithm with application to two key cryptography. In D. Chaum, R.L. Rivest, and A.T. Sherman, Ed., Advances in cryptology Proc. of CRYPTO '82, pages 51-60. Plenum Press, 1983.
5. Thomas Blum and Christof Paar. High-Radix montgomery modular exponentiation on reconfigurable hardware. IEEE Trans, on Computers, 50(7), pages 759-764, 2001.
6. Guang Gong and Lein Harn. Public key cryptosystems based on cubic finite field extensions. In IEEE Trans, on Inf. Theory, Nov. 1999.
7. Robert Granger, Dan Page and Martijn Stam. A Comparison of CEILIDH and XTR. In D.A. Buell Ed. Algorithmic Number Theory, 6th International Symposium - ANTS-VI, pages 235-249, vol. 3076 of Lecture Notes in Computer Science. Springer-Verlag, 2004.
8. Marc Joye and Sung-Ming Yen. The Montgomery powering ladder. In B.S. Kaliski Jr. and Ç. K. Koç, Ed., Cryptographic Hardware and Embedded Systems (CHES 2002), pages 291-302, vol. 2523 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
9. Çetin Kaya Koç and Ching Yu Hung. A Fast Algorithm for Modular Reduction. In IEE Proceedings - Computers and Digital Techniques, 145(4), pages 265-271, July 1998.
10. 6m). In S. Vaudenay and A.M. Youssef, Ed., Selected Areas in Cryptography - SAC 2001, vol 2259 of Lecture Notes in Computer Science, pages 301-312. Springer-Verlag, 2001.
11. Arjen K. Lenstra. Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields In V. Varadharajan, J. Pieprzyk, Y. Mu, Eds. Information Security and Privacy, Second Australasian Conference - ACISP'97, vol. 1270 of Lecture Notes in Computer Science, pages 127-138. Springer-Verlag, 1997.
12. Arjen K. Lenstra and Eric R. Verheul. The XTR public key system. In M. Bellare, Ed., Advances in Cryptology - CRYPTO 2000, vol. 1880 of Lecture Notes in Computer Science, pages 1-19. Springer-Verlag, 2000.
13. Arjen K. Lenstra and Eric R. Verheul. An overview of the XTR public key system. Public Key Cryptography and Computational Number Theory Conference, 2000.
14. Arjen K. Lenstra and Eric R. Verheul. Key improvements to XTR. In T. Okamoto, Ed., Advances in Cryptology - ASIA CRYPT 2000, vol. 1976 of Lecture Notes in Computer Science, pages 220-233. Springer-Verlag, 2000.
15. Arjen K. Lenstra and Eric R. Verheul. Fast irreductibility and subgroup membership testing in XTR. In K. Kim, Ed., Public Key Cryptography - PKC 2001, vol. 1992 of Lecture Notes in Computer Science, pages 73-86. Springer-Verlag, 2001.
16. Ciaran McIvor, Máire McLoone, John McCanny, Alan Daly and William Marnane. Fast Montgomery Modular Multiplication and RSA Cryptographic Processor Architectures. 37th Asilomar Conference on Signals, Systems, and Computers, Nov. 2003.
17. Peter L. Montgomery. Modular multiplication without trial division. Math. Comp. 44(170), pages 519-521, April 1985.
18. Gerardo Orlando and Christof Paar. A High Performance Reconfigurable Elliptic Curve Processor for GF(2m). In Ç.K. Koç, C. Paar, Ed., Cryptographic Hardware and Embedded Systems (CHES 2000), vol. 1965 of Lecture Notes in Computer Science, pages 41-56, Springer-Verlag, 2001.
19. Gerardo Orlando and Christof Paar. A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware. In Ç.K. Koç, D. Naccache, C. Paar, Ed., Cryptographic Hardware and Embedded Systems (CHES 2001), vol. 2162 of Lecture Notes in Computer Science, pages 348-363, Springer-Verlag, 2001.
20. Behrooz Parhami. RNS representation with redundant residues. In Proc. of the 35th Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, pages 1651-1655, November 4-7, 2001.
21. Jean-Jacques Quisquater. Fast modular exponentiation without division. At Rump session of EUROCRYPT '90, May 1990.
22. Karl Rubin and Alice Silverberg. Torus-based cryptography. In D. Boneh, Ed., Advances in Cryptology - CRYPTO 2003, vol. 2729 of Lecture Notes in Computer, pages 349-365. Springer, 2003.
23. Holger Sedlak. The RSA cryptography processor. In D. Chaum and W.L. Price, Ed., Advances in Cryptology - EUROCRYPT '87, Amsterdam, The Netherlands, vol. 304 of Lecture Notes in Computer Science, pages 95-105. Springer-Verlag, 1988.
24. Peter Smith and Christopher Skinner. A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discret logarithms. In J. Pieprzyck and R. Safavi-Naini, Ed., Advances in Cryptology - ASIACRYPT'94, vol. 917 of Lecture Notes in Computer Science, pages 357-364. Springer-Verlag, 1995.
25. François-Xavier Standaert, Gael Rouvroy, Jean-Jacques Quisquater, Jean-Didier Legat. Efficient Implementation of Rijndael Encryption in Reconfigurable Hardware: Improvements and Design Tradeoffs. In C. Walter, Ed., Cryptographic Hardware and Embedded Systems (CHES 2003), Volume 2779 of Lecture Notes in Computer Science. Springer-Verlag, September 2003.
26. Martijn Stam and Arjen K. Lenstra. Speeding up XTR. In C. Boyd, Ed., Advances in Cryptology - ASIACRYPT 2001, vol. 2248 of Lecture Notes in Computer Science, pages 125-143. Springer-Verlag, 2001.
27. Eric R. Verheul. Evidence that XTR Is More Secure then Supersingular Elliptic Curve Cryptosystems. In B. Pfitzmann, Ed., Advances in Cryptology - EUROCRYPT 2003, vol. 2045 of Lecture Notes in Computer Science, pages 195-210. Springer-Verlag, 2001.
28. m). In B.S. Kaliski Jr., Ç.K. Koç, C. Paar, Ed., Cryptographic Hardware and Embedded Systems - CHES 2002, vol. 2523 of Lecture Notes in Computer Science, pages 500-514. Springer-Verlag, 2002.