New fast modular multiplication method and its application to modular exponentiation-based cryptography

Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

Volumn 83, Issue 12, 2000, Pages 88-93

  Hayashi, Akira ^a  

^a KANAZAWA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ESTIMATION; PARALLEL PROCESSING SYSTEMS;

EL GAMAR CRYPTOGRAPHY; EXPONENTIATION COMPUTATION; MULTIPLICATION REMAINDER COMPUTATION; PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 0033691491     PISSN: 10420967     EISSN: None     Source Type: Journal    
DOI: 10.1002/1520-6440(200012)83:12<88::AID-ECJC10>3.0.CO;2-5     Document Type: Article

References (14)

1. Rivest R, Shamir A, Adleman L. A method for obtaining digital signatures and public key cryptosystems. Commun ACM 1978;21:120-126.
2. Rabin MO. Digital signatures and public-key functions as intractable as factorization. MIT/LCS/TR-212 Tech. memo, Massachusetts Institute of Technology, 1979.
3. El Gamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 1985;31:469-472.
4. n. Proc CRYPTO'91, Santa Barbara, p 252-266.
5. Menezes AJ, Vanstone SA. Elliptic curve cryptosystems and their implementation. J Cryptol 1993;6:209-224.
6. Kuwakado K, Koyama K. Efficient cryptosystems over elliptic curves based on a form-free primes. IEICE Trans Fundam 1994;E77-A:1309-1318.
7. NIST. Specifications for a digital signature standard. Federal Information Processing Standard Publication 186, 1991.
8. Diffie W, Hellman M. New directions in cryptography. IEEE Trans Inf Theory 1976;22:644-654.
9. Okamoto T. Provably secure and practical identification schemes and corresponding signature schemes. Proc CRYPTO'92, Santa Barbara, p 31-53.
10. Knuth DE. The art of computer programming. Vol. 2, 2nd ed. Addison-Wesley; 1980. Chapter 4.
11. Quisquater JJ, Couvreur C. Fast decipherment algorithm for RSA public-key cryptosystem. Electron Lett 1982;18:905-907.
12. Ito T, Sako K. Algorithm on finite field and high-speed algorithm for multiple length remainder operation. Inf Process 1993;34:170-179.
13. Morita H. Cryptography and high-speed algorithm. Inf Process 1993;34:336-342.
14. Koblitz N. A course in number theory and cryptography. Springer; 1987. Chapter 1.