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 introduce a new variant of the number field sieve algorithm for discrete logarithms in F _
p^ n called exTNFS. The most important modification is done in the polynomial selection …

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 …

Abstract The fusion of Artificial Intelligence (AI) into cybersecurity has brought transformative
advancements in protecting digital infrastructures from evolving cyber threats. This …

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 …

In this paper, we provide a notable step towards filling the gap between theory (estimates of
running-time) and practice (a discrete logarithm record computation) for the Tower Number …

Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient
way to instantiate a pairing scheme is through Pairing-Friendly Elliptic Curves. Because a …

In a recent work, Kim and Barbulescu had extended the tower number field sieve algorithm
to obtain improved asymptotic complexities in the medium prime case for the discrete …

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 …

We study the discrete logarithm problem at the boundary case between small and medium
characteristic finite fields, which is precisely the area where finite fields used in pairing …