A carry-free architecture for Montgomery inversion

IEEE Transactions on Computers

Volumn 54, Issue 12, 2005, Pages 1508-1519

  Savaş, Erkay ^a  

^a SABANCI UNIVERSITY   (Turkey)

Author keywords

Elliptic curve cryptography; Montgomery inversion; Redundant signed representation

Indexed keywords

ADDERS; ALGORITHMS; COMPUTER ARCHITECTURE; CRYPTOGRAPHY; SHIFT REGISTERS;

CARRY PROPAGATION; ELLIPTIC CURVE CRYPTOGRAPHY; HARDWARE IMPLEMENTATION; INVERSION ALGORITHM; MONTGOMERY INVERSION; MULTIPLICATIVE INVERSION; REDUNDANT SIGNED REPRESENTATION;

COMPUTER CIRCUITS;

EID: 30444435813     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2005.188     Document Type: Article

References (18)

1. N. Koblitz, "Elliptic Curve Cryptosystems," Math. Computation, vol. 48, no. 177, pp. 203-209, Jan. 1987.
2. A.J. Menezes, Elliptic Curve Public Key Cryptosystems. Boston: Kluwer Academic, 1993.
3. B.S. Kaliski Jr., "The Montgomery Inverse and Its Applications," IEEE Trans. Computers, vol. 44, no. 8, pp. 1064-1065, Aug. 1995.
4. T. Kobayashi and H. Morita, "Fast Modular Inversion Algorithm to Match Any Operand Unit," IEICE Trans. Fundamentals, vol. E82-A(5), pp. 733-740, May 1999.
5. E. Savaş and Ç.K. Koç, "The Montgomery Modular Inverse - Revisited," IEEE Trans. Computers, vol. 49, no. 7, pp. 763-766, July 2000.
6. R. Lórencz, "New Algorithm for Classical Modular Inverse," Cryptographic Hardware and Embedded Systems, B.S. Kaliski Jr., Ç.K. Koç, and C. Paar, eds., pp. 57-70, Berlin: Springer-Verlag, 2002.
7. n)," Cryptographic Hardware and Embedded Systems, B.S. Kaliski Jr., Ç.K. Koç, and C. Paar, eds., pp. 57-70, Berlin: Springer-Verlag, 2002.
8. M.A. Hasan, "Efficient Computation of Multiplicative Inverses for Cryptographic Applications," Proc. 15th IEEE Symp. Computer Arithmetic, 2001.
9. J. Lutz, "High Performance Elliptic Curve Cryptographic Co-Processor," master's thesis, Univ. of Waterloo, 2003.
10. D.E. Knuth, The Art of Computer Programming, vol. 2, second ed. Reading, Mass.: Addison-Wesley, 1981.
11. B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs. Oxford Univ. Press, 2000.
12. N. Takagi, "A Modular Inversion Hardware Algorithm with a Redundant Binary Representation," IEICE Trans. Information and Systems, vol. E76-D(8), pp. 863-869, Aug. 1993.
13. E. Savaş, "A Carry-Free Montgomery Inversion Algorithm," Embedded Cryptographic Hardware: Methodologies and Architectures, N. Nedjah and L. de M. Mourelle, eds., Nova Science Publishers, 2004.
14. IEEE, "P1363: Standard Specifications for Public-Key Cryptography," 2000.
15. A. Avizienis, "Signed-Digit Number Representation for Fast Parallel Arithmetic," IRE Trans. Electronic Computers, vol. 10, pp. 389-400, Sept. 1961.
16. A. Vandemeulebroecke, E. Vanzieleghem, T. Denayer, and P.G.A. Jespers, "A New Carry-Free Division Algorithm and its Application to a Single-Chip 1024-b RSA Processor," IEEE J. Solid-State Circuits, vol. 25, no. 3, pp. 748-755, June 1990.
17. Austrian Mikro Systeme 0.35μm CMOS process family, http://www. austriamicrosystems.com/05foundry/cmos.htm, 2004.
18. R.P. Brent and H.T. Kung, "A Regular Layout for Parallel Adders," IEEE Trans. Computers, vol. 31, pp. 260-264, 1982.