https://www.iacr.org/docs/pub_2013-16.htmlThis paper is the IACR version. It can be made freely available on the homepages of authors, on their employer's institutional page, and in non-commercial archival repositories such as the Cryptology ePrint Archive, ArXiv/CoRR, HAL, etc.International audienceThere have been notable improvements in discrete logarithm computations in finite fields since 2015 and the introduction of the Tower Number Field Sieve algorithm (TNFS) for extension fields. The Special TNFS is very efficient in finite fields that are target groups of pairings on elliptic curves, where the characteristic is special (e.g.~sparse). The key sizes for pairings should be increased, and alternative pairing-friendly curves can be cons...
Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient way to inst...
Recent algorithmic improvements of discrete logarithm computation in special extension fields threat...
International audienceThere have been recent advances in solving the finite extension field discrete...
https://www.iacr.org/docs/pub_2013-16.htmlThis paper is the IACR version. It can be made freely avai...
Since 2015, there has been a significant decrease in the asymptotic complexity of computing discrete...
There have been recent advances in solving the finite extension field discrete logarithm problem as ...
Following the emergence of Kim and Barbulescu\u27s new number field sieve (exTNFS) algorithm at CRYP...
Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13...
International audienceThere have been recent advances in solving the finite extension field discrete...
Recent progress in number field sieve (NFS) has shaken the security of Pairing-based Cryptography. F...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
In this paper we present a comprehensive comparison between pairing-friendly elliptic curves, consid...
Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient way to inst...
Recent algorithmic improvements of discrete logarithm computation in special extension fields threat...
International audienceThere have been recent advances in solving the finite extension field discrete...
https://www.iacr.org/docs/pub_2013-16.htmlThis paper is the IACR version. It can be made freely avai...
Since 2015, there has been a significant decrease in the asymptotic complexity of computing discrete...
There have been recent advances in solving the finite extension field discrete logarithm problem as ...
Following the emergence of Kim and Barbulescu\u27s new number field sieve (exTNFS) algorithm at CRYP...
Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13...
International audienceThere have been recent advances in solving the finite extension field discrete...
Recent progress in number field sieve (NFS) has shaken the security of Pairing-based Cryptography. F...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
International audienceFollowing the emergence of Kim and Barbulescu's new number field sieve (exTNFS...
In this paper we present a comprehensive comparison between pairing-friendly elliptic curves, consid...
Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient way to inst...
Recent algorithmic improvements of discrete logarithm computation in special extension fields threat...
International audienceThere have been recent advances in solving the finite extension field discrete...