Fast montgomery modular multiplication and RSA cryptographic processor architectures

Conference Record of the Asilomar Conference on Signals, Systems and Computers

Volumn 1, Issue , 2003, Pages 379-384

  McIvor, Ciaran ^a   McLoone, Máire ^a   McCanny, John V ^a   Daly, Alan ^b   Marnane, William ^b  

^a QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CARRY SAVE ADDERS (CSA); DECRYPTION; MONTGOMERY MODULAR MULTIPLICATION; SECURITY PROCESSORS;

ADDERS; ALGORITHMS; COMPUTER ARCHITECTURE; ITERATIVE METHODS; PROGRAM PROCESSORS; SMART CARDS; THEOREM PROVING; THROUGHPUT; VECTORS;

CRYPTOGRAPHY;

EID: 4143149431     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Stallings, W.: "Network and Internetwork Security Principles and Practice". Prentice Hall International, 1995.
2. Menezes, A., Oorschot, P., Vanstone, S.: "Handbook of Applied Cryptography". CRC Press, 1997.
3. Rivest, R.L., Shamir, A., Adleman, L.: "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems". Communications of the ACM, 21(2): 120-126, February 1978.
4. Montgomery, P.L.: "Modular Multiplication without Trial Division". Math. Computation, Vol. 44, pp. 519-521, 1985.
5. Koc, C.K., Acar, T., Burton S. Kaliski Jr.: "Analyzing and Comparing Montgomery Multiplication Algorithms". IEEE Micro, 16(3): 26-33, June 1996.
6. Eldridge, S.E., Walter, C.D.: "Hardware Implementation of Montgomery's Modular Multiplication Algorithm". IEEE Transactions on Computers, Vol. 42, pp. 693-699, July 1993.
7. Elbirt, A.J., Paar, C.: "Towards an FPGA Architecture Optimized for Public-Key Algorithms". SPIE Symposium on Voice, Video and Communications, Sept 1999.
8. th Symposium on Computer Arithmetic, pp. 70-77, 1999.
9. Quisquater, J-J., Couvreur, C.: "Fast Decipherment Algorithm for RSA Public-Key Cryptosystem". Electronics Letters, Vol. 18, pp. 905-907, October 1982.
10. Walter, C.D.: "Montgomery Exponentiation Needs No Final Subtractions". Electronics Letters, 35(21): 1831-1832, October 1999.
11. Blum, T., Paar, C.: "High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware". IEEE Transactions on Computers, Vol. 50, pp. 759-764, July 2001.
12. Wu, C-H., Hong, J-H., Wu, C-W.: "VLSI Design of RSA Cryptosystem Based on the Chinese Remainder Theorem". Journal of Information Science and Engineering 17, 967-980, 2001.
13. Amphion Semiconductor Ltd.: "Data Security Data Sheets", http://www.amphion.com