International audienceAddition chains are classical tools used to speed up expo- nentiation in cryptographic algorithms. In this paper we proposed to use a subset of addition chains, the Euclidean addition chains, in order to define a new public key cryptosystem
Finding the shortest addition chain for a given exponent is a significant problem in cryptography. I...
This thesis provides a unique cryptosystem comprised of different number theory applications. We fir...
AbstractIn this paper, the authors give the definitions of a coprime sequence and a lever function, ...
International audienceEfficiency and security are the two main objectives of every elliptic curve sc...
Field exponentiation and scalar multiplication are the pillars of and the most computationally expen...
An efficient computation of scalar multiplication in elliptic curve cryptography can be achieved by ...
Solutions to addition chain problem can be applied to operations involving huge number such as scala...
This paper shows that stochastic heuristic approach for implicitly solving addition chain problem (A...
International audienceCode-based cryptography is among the most attractive post-quantum cryptographi...
AbstractMost of public-key cryptosystems rely on one-way functions, which can be used to encrypt and...
Addition chain calculations play a critical role in determining the efficiency of cryptosystems base...
Euclidean lattices are a rich algebraic object that occurs in a wide variety of contexts in mathemat...
Abstract. The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any in...
Abstract — Modular exponentiation is one of the most important op-erations in public-key cryptosyste...
The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any integer n. A...
Finding the shortest addition chain for a given exponent is a significant problem in cryptography. I...
This thesis provides a unique cryptosystem comprised of different number theory applications. We fir...
AbstractIn this paper, the authors give the definitions of a coprime sequence and a lever function, ...
International audienceEfficiency and security are the two main objectives of every elliptic curve sc...
Field exponentiation and scalar multiplication are the pillars of and the most computationally expen...
An efficient computation of scalar multiplication in elliptic curve cryptography can be achieved by ...
Solutions to addition chain problem can be applied to operations involving huge number such as scala...
This paper shows that stochastic heuristic approach for implicitly solving addition chain problem (A...
International audienceCode-based cryptography is among the most attractive post-quantum cryptographi...
AbstractMost of public-key cryptosystems rely on one-way functions, which can be used to encrypt and...
Addition chain calculations play a critical role in determining the efficiency of cryptosystems base...
Euclidean lattices are a rich algebraic object that occurs in a wide variety of contexts in mathemat...
Abstract. The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any in...
Abstract — Modular exponentiation is one of the most important op-erations in public-key cryptosyste...
The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any integer n. A...
Finding the shortest addition chain for a given exponent is a significant problem in cryptography. I...
This thesis provides a unique cryptosystem comprised of different number theory applications. We fir...
AbstractIn this paper, the authors give the definitions of a coprime sequence and a lever function, ...
DOI
Add to ORKG