IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Cryptography and Information Security
Montgomery Multiplication with Twice the Bit-Length of Multipliers
Masayuki YOSHINOKatsuyuki OKEYACamille VUILLAUME
著者情報
ジャーナル 認証あり

2008 年 E91.A 巻 1 号 p. 203-210

詳細
抄録
We present a novel approach for computing 2n-bit Montgomery multiplications with n-bit hardware Montgomery multipliers. Smartcards are usually equipped with such hardware Montgomery multipliers; however, due to progresses in factoring algorithms, the recommended bit length of public-key schemes such as RSA is steadily increasing, making the hardware quickly obsolete. Thanks to our double-size technique, one can re-use the existing hardware while keeping pace with the latest security requirements. Unlike the other double-size techniques which rely on classical n-bit modular multipliers, our idea is tailored to take advantage of n-bit Montgomery multipliers. Thus, our technique increases the perenniality of existing products without compromises in terms of security.
著者関連情報
© 2008 The Institute of Electronics, Information and Communication Engineers
前の記事 次の記事
feedback
Top