In this paper, we investigate the efficient software implementations of the Montgomery modular multiplication algorithm on a multi-core system. A HW/SW co-design technique is used to find the efficient system architecture and the instruction scheduling method. We first implement the Montgomery modular multiplication on a multi-core system with general purpose cores. We then speed up it by adopting the Multiply-Accumulate (MAC) operation in each core. As a result, the performance can be improved by a factor of 1.53 and 2.15 when 256-bit and 1024-bit Montgomery modular multiplication being performed, respectively. © 2007 IEEE.status: publishe
Popular public key algorithms such as RSA and Diffie-Hellman key exchange, and more advanced cryptog...
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. ...
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. ...
This chapter describes Peter L. Montgomery\u27s modular multiplication method and the various improv...
Abstract. Montgomery modular multiplication is one of the fundamen-tal operations used in cryptograp...
A design for an expandable modular multiplication hardware is proposed. This design allows for casca...
A new version of Montgomery’s algorithm for modular multiplication of large integers and its impleme...
Abstract. Montgomery multiplication is one of the fundamental operations used in cryptographic algor...
Abstract. This paper describes the methodology and design of a scala-ble Montgomery multiplication m...
This paper gives the information regarding different methodology for modular multiplication with the...
This paper gives the information regarding different methodology for modular multiplication with the...
This paper presents a new modular multiplication algorithm that allows one to implement modular mult...
International audienceThis paper refers to an alternative hardware implementation for executing modu...
This report describes the design and implementation results in FPGAs of a scalable hardware architec...
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. ...
Popular public key algorithms such as RSA and Diffie-Hellman key exchange, and more advanced cryptog...
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. ...
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. ...
This chapter describes Peter L. Montgomery\u27s modular multiplication method and the various improv...
Abstract. Montgomery modular multiplication is one of the fundamen-tal operations used in cryptograp...
A design for an expandable modular multiplication hardware is proposed. This design allows for casca...
A new version of Montgomery’s algorithm for modular multiplication of large integers and its impleme...
Abstract. Montgomery multiplication is one of the fundamental operations used in cryptographic algor...
Abstract. This paper describes the methodology and design of a scala-ble Montgomery multiplication m...
This paper gives the information regarding different methodology for modular multiplication with the...
This paper gives the information regarding different methodology for modular multiplication with the...
This paper presents a new modular multiplication algorithm that allows one to implement modular mult...
International audienceThis paper refers to an alternative hardware implementation for executing modu...
This report describes the design and implementation results in FPGAs of a scalable hardware architec...
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. ...
Popular public key algorithms such as RSA and Diffie-Hellman key exchange, and more advanced cryptog...
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. ...
Several public-key cryptographic systems (Schneier, 1996) make heavy use of modular multiplication. ...