Publications related to Indiscreet discrete logarithms

LPN in Cryptography

The security of public-key cryptography relies on well-studied hard problems, problems for which we do not have efficient algorithms. Factorization and discrete logarithm are the two most known and used hard problems. Unfortunately, they can be easily solv ...

EPFL2017

Computational Aspects of Jacobians of Hyperelliptic Curves

Alina Dudeanu

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...

EPFL2016

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For~

q

a prime power, the discrete logarithm problem (DLP) in~

\F_{q}

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer~

x

such that

g^x = h

. We present an algorithm for computing discrete logarithm ...

2016

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Robert Granger, Philipp Svetolik Jovanovic

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 tweak-dependent mask. In this work, we revisit the principle of masking. We do so a ...

Springer Int Publishing Ag2016

Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography

Alexandre Raphaël Duc

Modern cryptography pushed forward the need of having provable security. Whereas ancient cryptography was only relying on heuristic assumptions and the secrecy of the designs, nowadays researchers try to make the security of schemes to rely on mathematical ...

EPFL2015

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Arjen Lenstra, Andrea Miele

We show how any pair of authenticated users can on-the-fly agree on an elliptic curve group that is unique to their communication session, unpredictable to outside observers, and secure against known attacks. Our proposal is suitable for deployment on cons ...

Springer-Verlag Berlin2015

A Tale of Two Quasi-Polynomial Algorithms

Robert Granger

In 2013 the Discrete Logarithm Problem in finite fields of small characteristic enjoyed a rapid series of developments, starting with the heuristic polynomial-time relation generation method due to Gologlu, Granger, McGuire and Zumbragel, and culminating w ...

2015

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

2015

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Robert Granger, Philipp Svetolik Jovanovic

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 tweak-dependent mask. In this work, we revisit the principle of masking. We do so a ...

2015

Breaking `128-bit Secure' Supersingular Binary Curves

Robert Granger

The discrete logarithm problem (DLP) in finite fields of small characteristic recently enjoyed a dramatic series of breakthrough results and computational records, with its (heuristic) complexity dropping from subexponential to quasi-polynomial. While thes ...

2014

Indiscreet discrete logarithms

Graph Chatbot

Chat with Graph Search

LPN in Cryptography

Computational Aspects of Jacobians of Hyperelliptic Curves

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography

Efficient Ephemeral Elliptic Curve Cryptographic Keys

A Tale of Two Quasi-Polynomial Algorithms

On the discrete logarithm problem in finite fields of fixed characteristic

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Breaking `128-bit Secure' Supersingular Binary Curves

Computational Aspects of Jacobians of Hyperelliptic Curves

Breaking `128-bit Secure' Supersingular Binary Curves

LPN in Cryptography

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography

Efficient Ephemeral Elliptic Curve Cryptographic Keys

On the discrete logarithm problem in finite fields of fixed characteristic

A Tale of Two Quasi-Polynomial Algorithms

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption