We present an attack on one of the Hidden Pairing schemes proposed by Dent and Galbraith. We drastically reduce the number of variables necessary to perform a multivariate attack and in some cases we can completely recover the private key. Our attack relies only on knowledge of the public system parameters
Abstract. In pairing-based cryptography, the security of protocols us-ing composite order groups rel...
Greater common divisor (GCD) attack is an attack that relies on the polynomial structure of the cryp...
In recent years, many applications of elliptic curves to cryptography have been developed. Cryptosy...
Abstract. We present an attack on one of the Hidden Pairing schemes proposed by Dent and Galbraith. ...
Recent attacks show how an unskilled implementation of elliptic curve cryptosystems may reveal the ...
peer reviewedIn this short note, we describe a variant of Shamir's (n, t)-threshold scheme based on ...
Analyse, arithmétique et géométrie Pairings were first studied as potential attacks on elliptic curv...
In this paper we study the linear congruential generator on elliptic curves from the cryptographic p...
International audienceLet N = pq be an RSA modulus and e be a public exponent. Numerous attacks on R...
Abstract. Pairings are typically implemented using ordinary pairing-friendly elliptic curves. The tw...
The success of Garbage-man-in-the-middle (GMITM) attack relies on the possibility to access to the ...
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric pro...
International audienceIn this paper, we present a new fault attack on elliptic curve scalar product ...
Abstract. Several papers have studied fault attacks on computing a pairing value e(P,Q), where P is ...
Several papers have studied fault attacks on computing a pairing value e(P, Q), where P is a public ...
Abstract. In pairing-based cryptography, the security of protocols us-ing composite order groups rel...
Greater common divisor (GCD) attack is an attack that relies on the polynomial structure of the cryp...
In recent years, many applications of elliptic curves to cryptography have been developed. Cryptosy...
Abstract. We present an attack on one of the Hidden Pairing schemes proposed by Dent and Galbraith. ...
Recent attacks show how an unskilled implementation of elliptic curve cryptosystems may reveal the ...
peer reviewedIn this short note, we describe a variant of Shamir's (n, t)-threshold scheme based on ...
Analyse, arithmétique et géométrie Pairings were first studied as potential attacks on elliptic curv...
In this paper we study the linear congruential generator on elliptic curves from the cryptographic p...
International audienceLet N = pq be an RSA modulus and e be a public exponent. Numerous attacks on R...
Abstract. Pairings are typically implemented using ordinary pairing-friendly elliptic curves. The tw...
The success of Garbage-man-in-the-middle (GMITM) attack relies on the possibility to access to the ...
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric pro...
International audienceIn this paper, we present a new fault attack on elliptic curve scalar product ...
Abstract. Several papers have studied fault attacks on computing a pairing value e(P,Q), where P is ...
Several papers have studied fault attacks on computing a pairing value e(P, Q), where P is a public ...
Abstract. In pairing-based cryptography, the security of protocols us-ing composite order groups rel...
Greater common divisor (GCD) attack is an attack that relies on the polynomial structure of the cryp...
In recent years, many applications of elliptic curves to cryptography have been developed. Cryptosy...
DOI
Add to ORKG