Updating key size estimations for pairings
R Barbulescu, S Duquesne - Journal of cryptology, 2019 - Springer
Recent progress on NFS imposed a new estimation of the security of pairings. In this work
we study the best attacks against some of the most popular pairings and propose new key …
we study the best attacks against some of the most popular pairings and propose new key …
Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
In the past two years there have been several advances in Number Field Sieve (NFS)
algorithms for computing discrete logarithms in finite fields\mathbb F _ p^ n where p is prime …
algorithms for computing discrete logarithms in finite fields\mathbb F _ p^ n where p is prime …
Extended tower number field sieve with application to finite fields of arbitrary composite extension degree
T Kim, J Jeong - IACR International Workshop on Public Key …, 2017 - Springer
We propose a generalization of exTNFS algorithm recently introduced by Kim and
Barbulescu (CRYPTO 2016). The algorithm, exTNFS, is a state-of-the-art algorithm for …
Barbulescu (CRYPTO 2016). The algorithm, exTNFS, is a state-of-the-art algorithm for …
A taxonomy of pairings, their security, their complexity
R Barbulescu, N El Mrabet, L Ghammam - 2020 - hal.science
A recent NFS attack against pairings made it necessary to increase the key sizes of the most
popular families of pairings: BN, BLS12, KSS16, KSS18 and BLS24. The attack applies to …
popular families of pairings: BN, BLS12, KSS16, KSS18 and BLS24. The attack applies to …
Faster individual discrete logarithms in finite fields of composite extension degree
A Guillevic - Mathematics of computation, 2019 - ams.org
Computing discrete logarithms in finite fields is a main concern in cryptography. The best
algorithms in large and medium characteristic fields (eg, $\rm {GF}(p^ 2) $, $\rm {GF}(p^{12}) …
algorithms in large and medium characteristic fields (eg, $\rm {GF}(p^ 2) $, $\rm {GF}(p^{12}) …
[PDF][PDF] 基于椭圆曲线中配对的密码学研究综述
王辈， 胡红钢 - Journal of Cryptologic Research, 2022 - jcr.cacrnet.org.cn
近些年, 椭圆曲线中的配对在密码学中的应用日趋广泛, 对配对的计算效率也有了越来越高的
要求. 为了提高配对的计算效率, 研究者们一方面从理论与算法的角度改进已有的配对 …
要求. 为了提高配对的计算效率, 研究者们一方面从理论与算法的角度改进已有的配对 …
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
Pairing based cryptography is in a dangerous position following the breakthroughs on
discrete logarithms computations in finite fields of small characteristic. Remaining instances …
discrete logarithms computations in finite fields of small characteristic. Remaining instances …
Discrete logarithms
A Guillevic, F Morain - Guide to pairing-based cryptography, 2017 - taylorfrancis.com
The Discrete Logarithm Problem (DLP) is one of the most used mathematical problems in
asymmetric cryptography design, the other one being the integer factorization. It is …
asymmetric cryptography design, the other one being the integer factorization. It is …
Improvements on the individual logarithm step in extended tower number field sieve
Y Zhu, J Zhuang, C Lv, D Lin - Cryptology ePrint Archive, 2016 - eprint.iacr.org
The hardness of discrete logarithm problem over finite fields is the foundation of many
cryptographic protocols. When the characteristic of the finite field is medium or large, the …
cryptographic protocols. When the characteristic of the finite field is medium or large, the …
[HTML][HTML] Refined analysis to the extended tower number field sieve
Y Zhu, J Wen, J Zhuang, C Lv, D Lin - Theoretical computer science, 2020 - Elsevier
The hardness of discrete logarithm problem over finite fields is the security foundation of
many cryptographic protocols. When the characteristic of the finite field is medium or large …
many cryptographic protocols. When the characteristic of the finite field is medium or large …