tailieunhanh - Báo cáo hóa học: " Research Article Enhanced Montgomery Multiplication on DSP Architectures for Embedded Public-Key"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Enhanced Montgomery Multiplication on DSP Architectures for Embedded Public-Key | Hindawi Publishing Corporation EURASIP Journal on Embedded Systems Volume 2008 Article ID 583926 9 pages doi 2008 583926 Research Article Enhanced Montgomery Multiplication on DSP Architectures for Embedded Public-Key Cryptosystems P. Gastaldo G. Parodi and R. Zunino Department of Biophysical and Electronic Engineering DIBE University of Genoa Via Opera Pia 11a 16145 Genova Italy Correspondence should be addressed to P. Gastaldo Received 21 September 2007 Revised 16 January 2008 Accepted 27 February 2008 Recommended by Sandro Bartolini Montgomery s algorithm is a popular technique to speed up modular multiplications in public-key cryptosystems. This paper tackles the efficient support of modular exponentiation on inexpensive circuitry for embedded security services and proposes a variant of the finely integrated product scanning FIPS algorithm that is targeted to digital signal processors. The general approach improves on the basic FIPS formulation by removing potential inefficiencies and boosts the exploitation of computing resources. The reformulation of the basic FIPS structure results in a general approach that balances computational efficiency and flexibility. Experimental results on commercial DSP platforms confirm both the method s validity and its effectiveness. Copyright 2008 P. Gastaldo et al. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. 1. INTRODUCTION Modular exponentiation is the core operation of successful public-key cryptosystems such as RSA 1 and ElGamal encryption 1 modular arithmetic also plays a key role in elliptic curve cryptography 1 . The RSA scheme requires exponentiation on k-bit positive integers with k ranging typically from 512 to 2048 the ElGamal scheme uses exponentiation on prime numbers at least 1024 bits . When dealing with large .