Results 1 - 10 of 2,947

An Efficient Architecture for Interleaved Modular Multiplication

by Ahmad M. Abdelfattah, Ayman M. Bahaa, El-din Hossam M. A. Fahmy
"... Abstract—Modular multiplication is the basic operation ..."
Abstract - Add to MetaCart
Abstract—Modular multiplication is the basic operation

Tripartite modular multiplication

by Kazuo Sakiyama, Junfeng Fan, Bart Preneel, Ingrid Verbauwhede - 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 im-plement 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 im-plement 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

by O. Prasanthi, M. Subba Reddy
"... 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

by Marcelo E. Kaihara, Naofumi Takagi , 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 7 (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

by Diego Viot, Rodolfo Aurélio, Helano Castro, Jardel Silveira
"... Side-channel attack is any attack based on information gained from the physical implementation of a cryptosystem. Private-key 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 side-channel attack. Some algorithms for public-key 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

by Pascal Giorgi, Laurent Imbert, Thomas Izard
"... 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

by Professor Dr. D. J. Guan , 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 Mont-gomery 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 Mont-gomery algorithm for modular multiplication. This is one of the notes

An Expandable Montgomery Modular Multiplication Processor

by Adnan A. A, Gutub Alaaeldin, A. M. Amin
"... X design for an expandable modular multiplication hard-wire is proposed. This design allows for cascading the hard-wart ’ 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 hard-wire is proposed. This design allows for cascading the hard-wart ’ if larger moduli are required. The proposed design uses hhtgoiriery modular multiplication algorithm [5]. 1

Hardware Architecture for the Montgomery Modular Multiplication

by Nadia Nedjah, Luiza, De Macedo Mourelle
"... Abstract:- Modular multiplication is the most dominant part of the computation performed in public-key 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 public-key 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

On the Design of RNS Bases for Modular Multiplication

by Mohammad Esmaeildoust , Shirin Rezaei , Marzieh Gerami , Keivan Navi , Mohammad Esmaeildoust
"... Abstract Modular multiplication is the main and basic operation in public key cryptography algorithms like Elliptic Curve Cryptography (ECC). By using Residue Number System (RNS) in these algorithms, large number computation is replaced by computation over the small moduli without carry propagation ..."
Abstract - Add to MetaCart
Abstract Modular multiplication is the main and basic operation in public key cryptography algorithms like Elliptic Curve Cryptography (ECC). By using Residue Number System (RNS) in these algorithms, large number computation is replaced by computation over the small moduli without carry
Results 1 - 10 of 2,947