Montgomery in Practice: How to Do It More Efficiently in Hardware-Reference-Cited by-同舟云学术

Montgomery in Practice: How to Do It More Efficiently in Hardware

Published:2002 Issue: Volume: Page:40-52
ISSN:0302-9743
Container-title:Topics in Cryptology — CT-RSA 2002
language:
Short-container-title:

Author:

Batina Lejla,Muurling Geeke

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45760-7_4

Reference24 articles.

1. Lect Notes Comput Sci;A.F. Tenca,1999

2. T. Blum. Modular exponentiation on reconfigurable hardware. Master’s thesis, Worcester Polytechnic Institute, April 1999.

3. S.E. Eldridge and C.D. Walter. Hardware implementation of Montgomery’s modular multiplication algorithm. IEEE Transactions on Computers, (42):693–9, 1993.

4. Lect Notes Comput Sci;E. Savaç,2000

5. G. Hachez, F. Koeune, and J.-J. Quisquater. Timing attack: what can be achieved by a powerful adversary? Proceedings of the 20th symposium on Information Theory in the Benelux, pages 63–70, May 1999.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Novel Newton–Raphson Modulo Generator and Its VLSI Architecture for Pseudorandom Bit Generation;SN Computer Science;2024-01-12

2. Computing Mod with a Variable Lookup Table;Communications in Computer and Information Science;2016

3. Reconfigurable Modular Arithmetic Logic Unit for High-Performance Public-Key Cryptosystems;Reconfigurable Computing: Architectures and Applications;2006

4. Flexible Hardware Design for RSA and Elliptic Curve Cryptosystems;Topics in Cryptology – CT-RSA 2004;2004

5. Another Way of Doing RSA Cryptography in Hardware;Cryptography and Coding;2001