High-performance modular exponentiation algorithm by using a new modified modular multiplication algorithm and common-multiplicand-multiplication method

World Congress on Internet Security, WorldCIS-2011

Volumn , Issue , 2011, Pages 192-197

  Rezai, Abdalhossin ^a   Keshavarzi, Parviz ^a  

^a SEMNAN UNIVERSITY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON-MULTIPLICAND MULTIPLICATION; EXPONENTIATION ALGORITHMS; MODULAR EXPONENTIATION; MODULAR EXPONENTIATION ALGORITHMS; MODULAR MULTIPLICATION; MONTGOMERY MODULAR MULTIPLICATION; SIGNED-DIGIT REPRESENTATION; SLIDING WINDOW METHODS;

CRYPTOGRAPHY;

EID: 79955901537     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/worldcis17046.2011.5749849     Document Type: Conference Paper

References (17)

1. N. Nedjah, and L.M. Mouller, "Hihgh-performance hardware of the sliding-window method for parallel computation of modular exponentitions," international journal of parallel programming, Springer Netherlands, vol.37, pp.537-555, 2009.
2. S. R. Dusse, B. S. Kaliski, "A cryptographic library for the Motorola DSP 56000," Advance in Cryptology Proceedings of UROCRYPT'90, LNCS,vol.73, pp. 230-244, 1990.
3. P. Keshavarzi, and C. Harrison, "A new modular multiplication algorithm for VLSI implementation of public-key cryptography," Proceedings of First International Symposium on Communication Systems and Digital Signal Processin, pp.516-519, 1998.
4. K. Sakiyama, L. Batina, B. Preneel, and I. Verbauwhede, "High-performance publik-key cryptoprocessor for wireless mobile applications," Mobile networks and applications, vol. 99, pp. 245-258, 2007.
5. A. H. Rezai, and P. Keshavarzi, " Improvement of high-speed modular exponentiation algorithm by optimum using smart methods," Proceedings of 18th Iranian Conference on Electrical Engineering, Iran, pp.2104-2109, May 2010.
6. A. H. Rezai, and P. Keshavarzi, "Speed Improvement in elliptic curve cryptosystem scalar multiplication algorithm," proceedings of 7th International ISC Conference on Information Security and Cryptology2010, Iran, pp.181-188, September 2010.
7. P. L. Montgomery, "Modular multiplication without trial division", Mathematics of computation, vol. 44, no.170, pp. 519-521,1985.
8. A. F. Tenca, and C. K. Koc, "A scalable architecture for modular multiplication based on Montgomery's algorithm,"IEEE Trans. On computer, vol.52, no.9, pp. 1215-1221, 2003.
9. N.Pinckney, P. Amberg and D. Harris, "Parallelized Booth-encoded radix-4 Montgomery multipliers," proceeding of 16th IFIP/IEEE Intlernational Conferene on Very Large Scale Integration, Oct. 2008.
10. T. Blum and C. Paar, "High-radix Montgomery multiplication on reconfigurable hardware," IEEE Trans. on computers, vol. 50, no.7 pp. 759-764, 2001.
11. N. Pinckney and D. Harris, "Parallelized radix-4 scalable Montgomery multipliers," Journal of Integrated Circuits and Systems, vol.3, no.1, pp. 39-45,2008.
12. L. A. Tawalbeh, A. F. Tenca, and C. K. Koc,"A radix-4 scalable design," IEEE Potentials,vol.24, no.2, pp.16-18, 2005.
13. C. K. Koc, and C. Y. Hung, "Adaptive m-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers," Computer mathematic application, vol.24, no.3, pp.3-12, 1992.
14. B. Philips and N.Burgess, "minimal weight digit set conversions," IEEE Trans. on computers, vol. 53, no.6 pp. 666-677, 2004.
15. J. C. Ha, S. J. Moon, "A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation," Information Processing Letters, vol.66, no.2, pp.105-107,1998.
16. C. Wu, D. Lou and T.Chang, "An efficient Montgomery exponentiation algorithm for public-key cryptosystem," Proceedings of IEEE international conference on intelligence and security information, pp.284-285, June 2008.
17. C. Wu, "An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation," Information Sciences, vol.179, pp.410-421,2009.