Many hardware and software pairing implementations can be found in the literature and some pairing friendly parameters are given. How-ever, depending on the situation, it could be useful to generate other nice parameters (e.g. resistance to subgroup attacks, larger security levels, database of pairing friendly curves). The main purpose of this paper is to describe explicitly and exhaustively what should be done to generate the best possible parameters and to make the best choices depending on the implementation context (in terms of pairing algorithm, ways to build the tower field, Fp12 arithmetic, groups involved and their generators, system of coordinates). We focus on low level implementations, assuming that Fp additions have a significan...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. T...
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in t...
International audienceBecause pairings have many applications, many hardware and software pairing im...
Many hardware and software pairing implementations can be found in the literature and some pairing f...
This paper describes a new method to speed up IF p-arithmetic in hardware for pairing-friendly curve...
Abstract—This paper describes a new method to speed up Fp-arithmetic in hardware for pairing-friendl...
This paper describes a new method to speed up Fp-arithmetic for Barreto-Naehrig (BN) curves. We expl...
Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13...
https://www.iacr.org/docs/pub_2013-16.htmlThis paper is the IACR version. It can be made freely avai...
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in t...
Abstract. In this paper we describe an efficient implementation of the Tate and Ate pairings using B...
Recent algorithmic improvements of discrete logarithm computation in special extension fields threat...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. T...
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in t...
International audienceBecause pairings have many applications, many hardware and software pairing im...
Many hardware and software pairing implementations can be found in the literature and some pairing f...
This paper describes a new method to speed up IF p-arithmetic in hardware for pairing-friendly curve...
Abstract—This paper describes a new method to speed up Fp-arithmetic in hardware for pairing-friendl...
This paper describes a new method to speed up Fp-arithmetic for Barreto-Naehrig (BN) curves. We expl...
Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13...
https://www.iacr.org/docs/pub_2013-16.htmlThis paper is the IACR version. It can be made freely avai...
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in t...
Abstract. In this paper we describe an efficient implementation of the Tate and Ate pairings using B...
Recent algorithmic improvements of discrete logarithm computation in special extension fields threat...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
Barreto-Lynn-Scott (BLS) curves are a stand-out candidate for implementing high-security pairings. T...
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in t...