Publications associées à Breaking `128-bit Secure' Supersingular Binary Curves

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.

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Robert Granger, Jens Markus Zumbrägel

In this paper we propose a binary field variant of the Joux-Lercier medium-sized Function Field Sieve, which results not only in complexities as low as

L_{q^n}(1/3,(4/9)1/3)

for computing arbitrary logarithms, but also in an heuristic polynomial time alg ...

Springer Berlin Heidelberg2013

Breaking `128-bit Secure' Supersingular Binary Curves

Graph Chatbot

Chattez avec Graph Search

Efficient Public-Key Distance Bounding Protocol

On the Analysis of Public-Key Cryptologic Algorithms

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

Efficient Ephemeral Elliptic Curve Cryptographic Keys

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

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Automated Side-Channel Vulnerability Discovery and Hardening

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

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

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

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

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Efficient Public-Key Distance Bounding Protocol

On the Analysis of Public-Key Cryptologic Algorithms

Efficient Ephemeral Elliptic Curve Cryptographic Keys

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Automated Side-Channel Vulnerability Discovery and Hardening