A scalable architecture for montgomery multiplication

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

Volumn 1717, Issue , 1999, Pages 94-108

  Tenca, Alexandre F ^a   Koç, Çetin K ^a  

^a Oregon State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

DESIGN TRADEOFF; HARDWARE CONFIGURATIONS; MONTGOMERY MULTIPLICATION; PARALLEL COMPUTATION; SCALABLE ARCHITECTURES;

EMBEDDED SYSTEMS;

EID: 77956052389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48059-5_10     Document Type: Conference Paper

References (15)

1. A. Bernal and A. Guyot. Design of a modular multiplier based on Montgomery's algorithm. In 13th Conference on Design of Circuits and Integrated Systems, pages 680-685, Madrid, Spain, November 17-20 1998.
2. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, November 1976.
3. S. E. Eldridge and C. D. Walter. Hardware implementation of Montgomery's modular multiplication algorithm. IEEE Transactions on Computers, 42(6):693-699, June 1993.
4. T. Hamano, N. Takagi, S. Yajima, and F. P Preparata. 0(n)-Depth circuit algo rithm for modular exponentiation. In S. Knowles and W. H. McAllister, editors, Proceedings, 12th Symposium on Computer Arithmetic, pages 188-192, Bath, Eng land, July 19-21 1995. Los Alamitos, CA: IEEE Computer Society Press.
5. k). In T. Lang, J.-M. Muller, and N. Takagi, editors, Proceedings, 13th Symposium on Computer Arithmetic, pages 225-231, Asilomar, California, July 6-9, 1997. Los Alamitos, CA: IEEE Computer Society Press.
6. k). Designs, Codes and Cryptography, 14(1):57-69, April 1998.
7. C. K. Koc, T. Acar, and B. S. Kaliski Jr. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3):26-33, June 1996.
8. P. Kornerup. High-radix modular multiplication for cryptosystems. In E. Swartz-lander, Jr., M. J. Irwin, and G. Jullien, editors, Proceedings, 11th Symposium on Computer Arithmetic, pages 277-283, Windsor, Ontario, June 29 - July 2 1993. Los Alamitos, CA: IEEE Computer Society Press.
9. A. J. Menezes. Elliptic Curve Public Key Cryptosystems. Boston, MA: Kluwer Academic Publishers, 1993.
10. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, April 1985.
11. H. Orup. Simplifying quotient determination in high-radix modular multiplica tion. In S. Knowles and W. H. McAllister, editors, Proceedings, 12th Symposium on Computer Arithmetic, pages 193-199, Bath, England, July 19-21 1995. Los Alamitos, CA: IEEE Computer Society Press.
12. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signa tures and public-key cryptosystems. Communications ofthe ACM, 21(2):120-126, February 1978.
13. A. Royo, J. Moran, and J. C. Lopez. Design and implementation of a coprocessor for cryptography applications. In European Design and Test Conference, pages 213-217, Paris, France, March 17-20 1997.
14. A. F. Tenca. Variable Long-Precision Arithmetic (VLPA) for Reconfigurable Co processor Architectures. PhD thesis, Department of Computer Science, University of California at Los Angeles, March 1998.
15. C. D. Walter. Space/Time trade-offs for higher radix modular multiplication using repeated addition. IEEE Transactions on Computers, 46(2):139-141, February 1997.