Name
Abstract | ||
|---|---|---|
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 doublesize 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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-74462-7_14 | Selected Areas in Cryptography |
Keywords | Field | DocType |
n-bit hardware,montgomery multiplier,double-size technique,montgomery multiplication,latest security requirement,n-bit montgomery multiplier,doublesize technique,classical n-bit modular multiplier,hardware montgomery multiplier,existing hardware,public key,smartcard | Bit-length,Pace,Montgomery reduction,Computer science,Parallel computing,Smart card,Modular design,Coprocessor,Factoring | Conference |
Volume | ISSN | Citations |
4356 | 0302-9743 | 6 |
PageRank | References | Authors |
0.70 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masayuki Yoshino | 1 | 21 | 7.43 |
| Katsuyuki Okeya | 2 | 447 | 38.47 |
| Camille Vuillaume | 3 | 90 | 10.61 |