• Publication
  • 1992
  • Issue No. 7 - July
  • Abstract - Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem
July 1992 (vol. 41 no. 7)
pp. 887-891

Radix-2 and radix-4 modular multiplication hardware algorithms are proposed. Numbers are represented in a redundant representation and modular additions are performed without carry propagation. Serial-parallel modular multipliers based on them have a regular cellular array structure with a bit slice feature suitable for VLSI implementation. They are efficient especially in applications, such as an RSA cryptosystem, where modular multiplications are performed iteratively.

[1] R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,"Comm. ACM, Vol. 21, No. 2, Feb. 1978, pp. 120-126.
[2] E. F. Brickell, "A survey of hardware implementations of RSA," inLecture Notes in Computer Science, vol. 435, G. Brassard Ed.,Advances in Cryptology--CRYPTO' 89 Proc.Berlin, Germany: Springer-Verlag, 1990, pp. 368-370.
[3] E. F. Brickell, "A fast modular multiplication algorithm with application to two key cryptography," inAdvances in Cryptology, Proc. CRYPTO 82, D. Chaumet al., Eds. New York: Plenum, 1983, pp. 51-60.
[4] H. Morita, "A fast modular-multiplication algorithm based on a higher radix," inLecture Notes in Computer Science, vol. 435, G. Brassard Ed.,Advances in Cryptology--CRYPTO'89 Proc.Berlin, Germany: Springer-Verlag, 1990, pp. 387-399.
[5] N. Takagi, Y. Okabe, H. Yasuura, and S. Yajima, "Modulo m addition using redundant representation and its application to residue-number/binary conversion," Rep. Tech. Group on Computation, IECEJ, COMP86-14, June 1986 (in Japanese).
[6] N. Takagi, "Studies on hardware algorithms for arithmetic operations with a redundant binary representation," Doctoral dissertation, Dep. Inform. Sci., Kyoto Univ., Aug. 1987.
[7] A. Avizienis, "Signed-digit number representations for fast parallel arithmetic,"IRE Trans. Electron. Comput., vol. EC-10, no. 3, pp. 389-400, Sept. 1961.
[8] N. Takagi, H. Yasuura, and S. Yajima, "High-speed VLSI multiplication algorithm with a redundant binary addition tree,"IEEE Trans. Comput., vol. C-34, no. 9, pp. 789-796, Sept. 1985.
[9] H. Yasuura, N. Takagi, and S. Yajima, "Redundant coding for local computability," Perspectives in computing, vol. 15, D. S. Johnsonet al., Eds.,Discrete algorithms and complexity: Proceedings of Japan-US Joint Seminar 1986. New York: Academic, 1987, pp. 145-159.

Index Terms:
modular multiplication hardware algorithms; redundant representation; RSA cryptosystem; multipliers; cellular array structure; bit slice feature; VLSI implementation; cryptography; digital arithmetic; VLSI.
Citation:
N. Takagi, S. Yajima, "Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem," IEEE Transactions on Computers, vol. 41, no. 7, pp. 887-891, July 1992, doi:10.1109/12.256444
Usage of this product signifies your acceptance of the Terms of Use.