Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Double-Size Bipartite Modular Multiplication

Masayuki YoshinoContact Information, Katsuyuki OkeyaContact Information and Camille VuillaumeContact Information

(1)  Hitachi, Ltd., Systems Development Laboratory, Kawasaki, Japan
Abstract
This paper proposes new techniques of double-size bipartite multiplications with single-size bipartite modular multiplication units. Smartcards are usually equipped with crypto-coprocessors for accelerating the computation of modular multiplications, however, their operand size is limited. Security institutes such as NIST and standards such as EMV have recommended or forced to increase the bit-length of RSA cryptography over years. Therefore, techniques to compute double-size modular multiplications with single-size modular multiplication units has been studied this decade to extend the life expectancy of the low-end devices. We propose new double-size techniques based on multipliers implementing either classical or Montgomery modular multiplications, or even both simultaneously (bipartite modular multiplication), in which case one can potentially compute modular multiplications twice faster.

Keywords  bipartite modular multiplication - double-size technique -  RSA - crypto-coprocessor - smartcard


Contact Information Masayuki Yoshino
Email: masayuki.yoshino.aa@hitachi.com

Contact Information Katsuyuki Okeya
Email: katsuyuki.okeya.ue@hitachi.com

Contact Information Camille Vuillaume
Email: camille.vuillaume.ch@hitachi.com
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.110 • Server: mpweb04
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)