Publications related to The Security of DSA and ECDSA

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

We formulate a conjecture about the distribution of the canonical height of the lowest non-torsion rational point on a quadratic twist of a given elliptic curve, as the twist varies. This conjecture seems to be very deep and we can prove only partial resul ...

Oxford Univ Press2016

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

Robert Granger, Jens Markus Zumbrägel

In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. By combining the polynomial time relat ...

Springer Berlin Heidelberg2013

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

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

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Marcelo Kaihara

We describe a cell processor implementation of Pollard’s rho method to solve discrete logarithms in groups of elliptic curves over prime fields. The implementation was used on a cluster of PlayStation 3 game consoles to set a new record. We present in deta ...

2012

On the Cryptanalysis of Public-Key Cryptography

Joppe Willem Bos

Nowadays, the most popular public-key cryptosystems are based on either the integer factorization or the discrete logarithm problem. The feasibility of solving these mathematical problems in practice is studied and techniques are presented to speed-up the ...

EPFL2012

Ron was wrong, Whit is right

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Maxime Augier, Christophe Wachter

We performed a sanity check of public keys collected on the web. Our main goal was to test the validity of the assumption that different random choices are made each time keys are generated. We found that the vast majority of public keys work as intended. ...

IACR2012

Forgery-Resilience for Digital Signature Schemes

Khaled Ouafi, Atefeh Mashatan

We introduce the notion of forgery-resilience for digital signature schemes, a new paradigm for digital signature schemes exhibiting desirable legislative properties. It evolves around the idea that, for any message, there can only be a unique valid signat ...

2012

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

Jeanine Marie Van Order

We establish several results towards the two-variable main conjecture of Iwasawa theory for elliptic curves without complex multiplication over imaginary quadratic fields, namely (i) the existence of an appropriate p-adic L-function, building on works of H ...

2012

Efficient Fail-Stop Signatures from the Factoring Assumption

Khaled Ouafi, Atefeh Mashatan

In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in wh ...

Springer2011

The Inconvenient Truth about Web Certificates

Jean-Pierre Hubaux, Julien Freudiger, Nevena Vratonjic, Vincent Bindschaedler

HTTPS is the de facto standard for securing Internet communications. Although it is widely deployed, the security provided with HTTPS in practice is dubious. HTTPS may fail to provide security for multiple reasons, mostly due to certificate-based authentic ...

2011

The Security of DSA and ECDSA

Graph Chatbot

Chat with 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

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 a $6120$-bit DLP on a Desktop Computer

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

Forgery-Resilience for Digital Signature Schemes

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

Ron was wrong, Whit is right

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