Publications related to Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

A Tale of Two Quasi-Polynomial Algorithms

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

Automated Side-Channel Vulnerability Discovery and Hardening

Ali Galip Bayrak

In traditional cryptography, an attacker tries to infer a mathematical relationship between the inputs and outputs of a cryptosystem to recover secret information. With the advances in the theoretical basis of the cryptographic algorithms, this task became ...

EPFL2014

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

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

Alexandre Raphaël Duc, Sebastian Faust

A recent trend in cryptography is to formally show the leakage resilience of cryptographic implementations in a given leakage model. One of the most prominent leakage models -- the so-called bounded leakage model -- assumes that the amount of leakage is a- ...

Springer2014

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Joppe Willem Bos, Andrea Miele

Motivated by the advantages of using elliptic curves for discrete logarithm-based public-key cryptography, there is an active research area investigating the potential of using hyperelliptic curves of genus 2. For both types of curves, the best known algor ...

Springer Berlin Heidelberg2014

A Fast and Versatile Quantum Key Distribution System with Hardware Key Distillation and Wavelength Multiplexing

Andreas Peter Burg, Jeremy Hugues-Felix Constantin, Nicolas Gisin

We present a compactly integrated, 625 MHz clocked coherent one-way quantum key distribution system which continuously distributes secret keys over an optical fibre link. To support high secret key rates, we implemented a fast hardware key distillation eng ...

Institute of Physics (IoP) and Deutsche Physikalische Gesellschaft2014

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\mathbb{F}_{2^{4 \cdot 1223}}$ and $\mathbb{F}_{2^{12 \cdot 367}}$)

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

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-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thomé. U ...

Springer Berlin Heidelberg2014

An efficient deterministic test for Kloosterman sum zeros

Robert Granger

We propose a simple deterministic test for deciding whether or not a non-zero element

a \in \mathbb{F}_{2^n}

or

\mathbb{F}_{3^n}

is a zero of the corresponding Kloosterman sum over these fields, and analyse its complexity. The test seems to have been o ...

American Mathematical Society2014

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Sebastian Faust

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain a ...

2013

On Selecting the Nonce Length in Distance-Bounding Protocols

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

Distance-bounding protocols form a family of challenge-response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

Oxford University Press2013

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

Graph Chatbot

Chat with Graph Search

A Tale of Two Quasi-Polynomial Algorithms

Automated Side-Channel Vulnerability Discovery and Hardening

Breaking `128-bit Secure' Supersingular Binary Curves

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

A Fast and Versatile Quantum Key Distribution System with Hardware Key Distillation and Wavelength Multiplexing

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\mathbb{F}_{2^{4 \cdot 1223}}$ and $\mathbb{F}_{2^{12 \cdot 367}}$)

An efficient deterministic test for Kloosterman sum zeros

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

On Selecting the Nonce Length in Distance-Bounding Protocols

A Tale of Two Quasi-Polynomial Algorithms

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

On Selecting the Nonce Length in Distance-Bounding Protocols

Breaking `128-bit Secure' Supersingular Binary Curves

Automated Side-Channel Vulnerability Discovery and Hardening

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\mathbb{F}_{2^{4 \cdot 1223}}$ and $\mathbb{F}_{2^{12 \cdot 367}}$)

A Fast and Versatile Quantum Key Distribution System with Hardware Key Distillation and Wavelength Multiplexing

An efficient deterministic test for Kloosterman sum zeros