Results 1  10
of
234,509
An Efficient Architecture for Interleaved Modular Multiplication
"... Abstract—Modular multiplication is the basic operation ..."
Tripartite modular multiplication
 in Press, Corrected Proof. DOI: 10.1016/j.vlsi.2011.03.008. [13] T. Granlund, “GMP, the GNU
"... Abstract. This paper presents a new modular multiplication algorithm that allows one to implement modular multiplications efficiently. It proposes a systematic approach for maximizing a level of parallelism when performing a modular multiplication. The proposed algorithm effectively integrates thre ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. This paper presents a new modular multiplication algorithm that allows one to implement modular multiplications efficiently. It proposes a systematic approach for maximizing a level of parallelism when performing a modular multiplication. The proposed algorithm effectively integrates
RSA Algorithm Modular Multiplication
"... Abstract — This paper presents the architecture and modeling of modular multiplication for RSA public key algorithm. It supports multiple lengths like 128 bits, 256 bits, 512 bits of data. In this paper simple shift and add algorithm is used to implement the modular multiplication. It makes the proc ..."
Abstract
 Add to MetaCart
Abstract — This paper presents the architecture and modeling of modular multiplication for RSA public key algorithm. It supports multiple lengths like 128 bits, 256 bits, 512 bits of data. In this paper simple shift and add algorithm is used to implement the modular multiplication. It makes
Bipartite Modular Multiplication
, 2005
"... This paper proposes a new fast method for calculating modular multiplication. The calculation is performed using a new representation of residue classes modulo M that enables the splitting of the multiplier into two parts. These two parts are then processed separately, in parallel, potentially doub ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper proposes a new fast method for calculating modular multiplication. The calculation is performed using a new representation of residue classes modulo M that enables the splitting of the multiplier into two parts. These two parts are then processed separately, in parallel, potentially
MODULAR MULTIPLICATION ALGORITHM FOR PKC
"... Sidechannel attack is any attack based on information gained from the physical implementation of a cryptosystem. Privatekey operations need a due amount of time to be performed. Attackers are able to break these systems by unmistakably measuring such time, what characterizes a timing attack, a kin ..."
Abstract
 Add to MetaCart
kind of sidechannel attack. Some algorithms for publickey encryption, like RSA, exhaustively use the mathematical operation of modular exponentiation, which has the modular multiplication as basis. Thus, in this paper we compare two different methods of modular multiplication by their applicabilities
Multipartite Modular Multiplication
"... Current processors typically embeds many cores running at high speed. We may then ask ourselves whether software parallelism is practical for low level arithmetic operations. In this paper we generalize the bipartite modular multiplication method of Kaihara and Takagi. We present a multipartite mult ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Current processors typically embeds many cores running at high speed. We may then ask ourselves whether software parallelism is practical for low level arithmetic operations. In this paper we generalize the bipartite modular multiplication method of Kaihara and Takagi. We present a multipartite
Montgomery Algorithm for Modular Multiplication
, 2003
"... The Montgomery algorithm for modular multiplication is considered to be the fastest algorithm to compute xy mod n in computers when the values of x, y, and n are large. In this lecture note, we shall describe the Montgomery algorithm for modular multiplication. This is one of the notes for the algo ..."
Abstract
 Add to MetaCart
The Montgomery algorithm for modular multiplication is considered to be the fastest algorithm to compute xy mod n in computers when the values of x, y, and n are large. In this lecture note, we shall describe the Montgomery algorithm for modular multiplication. This is one of the notes
An Expandable Montgomery Modular Multiplication Processor
"... X design for an expandable modular multiplication hardwire is proposed. This design allows for cascading the hardwart ’ if larger moduli are required. The proposed design uses hhtgoiriery modular multiplication algorithm [5]. 1 ..."
Abstract
 Add to MetaCart
X design for an expandable modular multiplication hardwire is proposed. This design allows for cascading the hardwart ’ if larger moduli are required. The proposed design uses hhtgoiriery modular multiplication algorithm [5]. 1
Hardware Architecture for the Montgomery Modular Multiplication
"... Abstract: Modular multiplication is the most dominant part of the computation performed in publickey cryptography systems such systems. The operation is time consuming for large operands. This paper examines the characteristics of yet another architecture to implement modular multiplication using ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract: Modular multiplication is the most dominant part of the computation performed in publickey cryptography systems such systems. The operation is time consuming for large operands. This paper examines the characteristics of yet another architecture to implement modular multiplication using
New Modular Multiplication Algorithms for Fast Modular Exponentiation
 in “Advances in Cryptology—Proceedings of Eurocrypt ’96
, 1996
"... . A modular exponentiation is one of the most important operations in publickey cryptography. However, it takes much time because the modular exponentiation deals with very large operands as 512bit integers. The modular exponentiation is composed of repetition of modular multiplications. Therefore ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
. A modular exponentiation is one of the most important operations in publickey cryptography. However, it takes much time because the modular exponentiation deals with very large operands as 512bit integers. The modular exponentiation is composed of repetition of modular multiplications
Results 1  10
of
234,509