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 …

In this paper, we describe a new algorithm for discrete logarithms in small characteristic.
This algorithm is based on index calculus and includes two new contributions. The first is a …

A popular approach to tweakable blockcipher design is via masking, where a certain
primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute …

In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small
characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi …

For $ q $ a prime power, the discrete logarithm problem (DLP) in $\mathbb {F} _ {q} $
consists of finding, for any $ g\in\mathbb {F} _ {q}^{\times} $ and $ h\in\langle g\rangle $, an …

Solving the equation P a (X):= X q+ 1+ X+ a= 0 over the finite field FQ, where Q= pn, q= pk
and p is a prime, arises in many different contexts including finite geometry, the inverse …

We show that a Magma implementation of Joux's L 1/4+ o (1) algorithm can be used to
compute discrete logarithms in the 1303-bit finite field\mathbb F _ 3^ 6 ⋅ 137 and the 1551 …

Abstract In 2013, Joux, and then Barbulescu, Gaudry, Joux and Thomé, presented new
algorithms for computing discrete logarithms in finite fields of small and medium …

In 2013 the function field sieve algorithm for computing discrete logarithms in finite fields of
small characteristic underwent a series of dramatic improvements, culminating in the first …

This paper introduces PandA, a software framework for Pairings and Arithmetic. It is
designed to bring together advances in the efficient computation of cryptographic pairings …