Bipartite modular multiplication

Lecture Notes in Computer Science

Volumn 3659, Issue , 2005, Pages 201-210

  Kaihara, Marcelo E ^a   Takagi, Naofumi ^a  

^a NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTER SOFTWARE; INTEGER PROGRAMMING; MATHEMATICAL TECHNIQUES; MULTIPROCESSING SYSTEMS;

BIPARTITE MODULAR MULTIPLICATION; HARDWARE IMPLEMENTATION; MONTGOMERY ALGORITHM; PRECOMPUTED CONSTANTS;

MULTIPLYING CIRCUITS;

EID: 27344446040     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11545262_15     Document Type: Conference Paper

References (15)

1. ANSI X9.30. Public Key Cryptography for the Financial Services Industry: Part 1: The Digital Signature Algorithm (DSA). American National Standard Institute. American Bankers Association. 1997.
2. G. R. Blakley, "A Computer Algorithm for Calculating the Product AB Modulo M," IEEE Trans. Computers, vol. C-32, no. 5, pp. 497-500, May 1983.
3. E. F. Brickell, "A fast modular multiplication algorithm with application to two key cryptography," in Advances in Cryptology, Proc. CRYPTO'82, D. Chaum et al., Eds. New York: Plenum, 1983, pp. 51-60.
4. W. Diffie and M. E. Hellman, "New Directions in Cryptography," IEEE Trans. Information Theory, vol. 22, no. 11, pp. 644-654, Nov. 1976.
5. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Information Theory, vol. IT-31, no. 4, pp. 469-472, July 1985.
6. P. Kornerup, "High-Radix Modular Multiplication for Cryptosystems," Proc. 11th IEEE Symp. Computer Arithmetic, G. Jullien, M. J. Irwin, and E. Swartzlander, eds., pp. 277-283, Windsor, Canada, 1993.
7. P. L. Montgomery, "Modular Multiplication without Trial Division," Mathematics of Computation, vol. 44, no. 170, pp. 519-521, Apr. 1985.
8. H. Morita, "A fast modular multiplication algorithm with application to two key cryptography," in Lecture Notes in Computer Science, vol. 435, G. Brassard Ed., Advances in Cryptology - CRYPTO'89 Proc. Berlin, Germany: Springer-Verlag, 1990, pp. 387-399.
9. H. Orup, "Simplifying quotient determination in high-radix modular multiplication," Proc. 12th IEEE Symp. Computer Arithmetic, S. Knowles and W. H. McAI-lister, eds., pp. 193-199, Bath, England, 1995.
10. R. L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Commun. ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
11. K. R. Sloan, "Comments on 'A Computer Algorithm for Calculating the Product AB Modulo M," IEEE Trans. Computers, vol. C-34, no. 3, pp. 290-292, March 1985.
12. N. Takagi, "A radix-4 modular multiplication hardware algorithm for modular exponentiation," IEEE Trans. Comput., vol. 41, no. 8, pp. 949-956, Aug. 1990.
13. A. F. Tenca, G. Todorov, and Ç. K. Koç, "High-Radix Design of a Scalable Modular Multiplier," Cryptographic Hardware and Embedded Systems - CHES 2001, Ç. K. Koç, D. Naccache, C. Paar, eds., pp. 185-201, Paris, France, 2001.
14. C. D. Walter, "Space/Time Trade-offs for Higher Radix Modular Multiplication using Repeated Addition," IEEE Trans. Computers, vol. 46, no. 2, pp. 139-141, Feb. 1997.
15. C. D. Walter, "Systolic Modular Multiplication," IEEE Trans. Computers, vol. 42, no. 3, pp. 376-378, Mar. 1993.