Architectures for Montgomery's multiplication

IEE Proceedings: Computers and Digital Techniques

Volumn 150, Issue 6, 2003, Pages 361-368

  Nibouche, O ^a   Bouridane, A ^b   Nibouche, M ^c  

^a UNIVERSITY OF ULSTER   (United Kingdom)

^b QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

^c UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; PARALLEL PROCESSING SYSTEMS; PIPELINE PROCESSING SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

LEAST SIGNIFICANT BITS ALGORITHM; MODULAR MULTIPLICATION; MONTOGOMERYS MULTIPLICATION; MOST SIGNIFICANT BIT FIRST ALGORITHM;

DIGITAL ARITHMETIC;

EID: 0346149866     PISSN: 13502387     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-cdt:20030567     Document Type: Article

References (15)

1. Shnad, M., and Vuillemin, J.: 'Fast implementation of RSA cryptography'. Proc. 11th IEEE Symp. on Computer arithmetic, Windsor, ONT, July 1993, pp. 252-259
2. Kornerup, P.: 'A systolic, linear-array multiplier for a class of right-shift algorithms', IEEE Trans. Comput., 1994, 43, (8), pp. 892-898
3. Guo, J., and Wang, C.: 'A novel digit-serial systolic array for modular multiplication'. Proc. Int. Symp. on Circuits and systems (ISCAS), Monterey, CA, 31 May-3 June 1998, pp. 177-180
4. Walter, C.D.: 'Systolic Modular Multiplication', IEEE Trans. Comput., 1993, 42, (3), pp. 376-378
5. Tsai, W.T., Shung, C.B., and Wang, S.: 'Two Systolic Architectures for Modular Multiplication', IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2000, 8, (1), pp. 103-107
6. Tenca, A.F., and Koc, C.K.: 'A scalable architecture for Montgomery multiplication. Cryptographic Hardware and Embedded Systems', Lect. Notes Comput. Sci. No. 1717, 1999, pp. 94-108
7. Freking, W.L., and Parhi, K.K.: 'Performance-scalable array architectures for modular multiplication'. Proc. IEEE Int. Conf. on Application-specific systems, architectures, and processors (ASAP), Boston, MA, 10-12 July 2000, pp. 149-162
8. Freking, W.L., and Parhi, K.K.: 'Ring-Planarized Cylindrical Arrays with Application to Modular Multiplication'. IEEE Workshop on Signal processing systems design & implementation (SIPS), Lafayette, LA, USA, 11-13 October 2000, pp. 497-506
9. Nibouche, O., Bouridane, A., and Nibouche, M.: 'New Iterative Algorithms and Architectures of Modular Multiplication for Cryptography'. Proc. 8th Int. IEEE Conf. on Electronics, circuits, and systems, (ICECS), Malta, 2-5 September 2001.
10. Montgomery, P.L.: 'Modular multiplication without trial division', Math. Comput., 1985, 44, pp. 519-521
11. Nibouche, O., Bouridane, A., Nibouche, M., and Crookes, D.: 'A New Pipelined Digit Serial-Parallel Multiplier'. Proc. IEEE Int. Symp. on Circuits and systems (ISCAS), Geneva, 28-31 May 2000, pp. 12-15
12. Nibouche, O.: 'High Performance Computer Arithmetic Architectures for Image and Signal Processing Applications'. PhD Thesis, School of Computer Science, Queen's University Belfast
13. Rivest, R.L., Shamir, A., and Adelman, L.: 'A method of obtaining digital signatures and public-key cryptosystems', Commun. ACM, 1978, 21, pp. 120-126
14. Chiou, C.D., and Yang, T.C.: 'Iterative modular multiplication algorithm without magnitude comparison', Electron. Lett., 1994, 30, (30), pp. 2017-2018
15. Nibouche, O., and Nibouche, M.: 'On Designing Digit Multipliers'. Proc. 9th Int. IEEE Conf. on Electronics, circuits, and systems (ICECS), Dubrovnik, 15-18 September 2002, pp. 951-954