Publications associées à Indiscreet discrete logarithms

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

Indiscreet discrete logarithms

Graph Chatbot

Chattez avec Graph Search

Automated Side-Channel Vulnerability Discovery and Hardening

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Solving a $6120$-bit DLP on a Desktop Computer

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

On the Cryptanalysis of Public-Key Cryptography

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

Cryptographic Hash Functions in Groups and Provable Properties

Using the Cloud to Determine Key Strengths

Cryptographic Hash Functions in Groups and Provable Properties

Automated Side-Channel Vulnerability Discovery and Hardening

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Unifying Leakage Models: From Probing Attacks to Noisy Leakage

Using the Cloud to Determine Key Strengths

Solving a $6120$-bit DLP on a Desktop Computer

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

On the Cryptanalysis of Public-Key Cryptography

Solving 112-bit prime ECDLP on game consoles using sloppy reduction