Publications associées à The Security of DSA and ECDSA

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

The Security of DSA and ECDSA

Graph Chatbot

Chattez avec Graph Search

Height of rational points on quadratic twists of a given elliptic curve

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

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

On the Cryptanalysis of Public-Key Cryptography

Ron was wrong, Whit is right

Forgery-Resilience for Digital Signature Schemes

Some remarks on the two-variable main conjecture of Iwasawa theory for elliptic curves without complex multiplication

Efficient Fail-Stop Signatures from the Factoring Assumption

The Inconvenient Truth about Web Certificates

Height of rational points on quadratic twists of a given elliptic curve

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

Forgery-Resilience for Digital Signature Schemes

Some remarks on the two-variable main conjecture of Iwasawa theory for elliptic curves without complex multiplication

Efficient Fail-Stop Signatures from the Factoring Assumption

The Inconvenient Truth about Web Certificates

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

On the Cryptanalysis of Public-Key Cryptography

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

Ron was wrong, Whit is right