In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that require multiple computations of modulo multiplicative inverses. In this paper, we describe the modulo operation and we recollect the main approaches to computing the modulus. Then, given a and n positive integers, we present the sequence (zj)j≥0, where zj=zj−1+aβj−n,
Abstract. This paper describes new algorithms for computing a modular inverse e−1 mod f given coprim...
Several modular multiplication algorithms have been reviewed. One modified modulo multiplication alg...
International audienceThe main operation in RSA encryption/decryption is the modular exponentiation,...
In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that requir...
Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of m...
Modular inversions are widely employed in public key crypto-systems, and it is known that they imply...
The services such as electronic commerce, internet privacy, authentication, confidentiality, data in...
Modular multiplication and modular reduction are the atomic constituents of most public-key cryptosy...
AbstractIn 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can calc...
Modular inversions are widely employed in public key crypto-systems, and it is known that they imply...
[[abstract]]Modular multiplication plays an important role to several public-key cryptosystems such ...
A new algorithm for computing $x=a^{-1}\pmod{p^k}$ is introduced. It is based on the exact solution ...
Abstract. We discuss the following problem: Given an integer φ shared secretly among n players and a...
Modular arithmetic is fundamental to several public-key cryptography systems such as the RSA encrypt...
A large set of moduli, for which the speed of bipartite modular multiplication considerably increase...
Abstract. This paper describes new algorithms for computing a modular inverse e−1 mod f given coprim...
Several modular multiplication algorithms have been reviewed. One modified modulo multiplication alg...
International audienceThe main operation in RSA encryption/decryption is the modular exponentiation,...
In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that requir...
Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of m...
Modular inversions are widely employed in public key crypto-systems, and it is known that they imply...
The services such as electronic commerce, internet privacy, authentication, confidentiality, data in...
Modular multiplication and modular reduction are the atomic constituents of most public-key cryptosy...
AbstractIn 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can calc...
Modular inversions are widely employed in public key crypto-systems, and it is known that they imply...
[[abstract]]Modular multiplication plays an important role to several public-key cryptosystems such ...
A new algorithm for computing $x=a^{-1}\pmod{p^k}$ is introduced. It is based on the exact solution ...
Abstract. We discuss the following problem: Given an integer φ shared secretly among n players and a...
Modular arithmetic is fundamental to several public-key cryptography systems such as the RSA encrypt...
A large set of moduli, for which the speed of bipartite modular multiplication considerably increase...
Abstract. This paper describes new algorithms for computing a modular inverse e−1 mod f given coprim...
Several modular multiplication algorithms have been reviewed. One modified modulo multiplication alg...
International audienceThe main operation in RSA encryption/decryption is the modular exponentiation,...
DOI
Add to ORKG