Publications associées à Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

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}

\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

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

Graph Chatbot

Chattez avec 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

Breaking `128-bit Secure' Supersingular Binary Curves

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

A Tale of Two Quasi-Polynomial Algorithms

An efficient deterministic test for Kloosterman sum zeros

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}}$)

Automated Side-Channel Vulnerability Discovery and Hardening

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

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

On Selecting the Nonce Length in Distance-Bounding Protocols