Publications associées à Elliptic curve digital signature algorithm

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

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

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

Fast Key Recovery Attack on ARMADILLO1 and Variants

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

The ARMADILLO cryptographic primitive is a multi-purpose cryptographic primitive for RFID devices proposed at CHES’10. The main purpose of the primitive is to provide a secure authentication in a challenge-response protocol. It has two versions, named ARMA ...

Springer2011

High-Performance Modular Multiplication on the Cell Processor

Joppe Willem Bos

This paper presents software implementation speed records for modular multiplication arithmetic on the synergistic processing elements of the Cell broadband engine (Cell) architecture. The focus is on moduli which are of special interest in elliptic curve ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

High-Performance Modular Multiplication on the Cell Processor

Joppe Willem Bos

Springer Berlin Heidelberg2010

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Robert Granger

We show that for any elliptic curve

E(\mathbb{F}_{q^n})

, if an adversary has access to a Static Diffie-Hellman Problem (Static DHP) oracle, then by making

O(q^{1-\frac{1}{n+1}})

Static DHP oracle queries during an initial learning phase, for fixed $n>1 ...

Springer Berlin Heidelberg2010

On the Use of the Negation Map in the Pollard Rho Method

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung

The negation map can be used to speed up the Pollard rho method to compute discrete logarithms in groups of elliptic curves over finite fields. It is well known that the random walks used by Pollard rho when combined with the negation map get trapped in fr ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

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 Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Robert Granger

We show that for any elliptic curve

E(\mathbb{F}_{q^n})

, if an adversary has access to a Static Diffie-Hellman Problem (Static DHP) oracle, then by making

O(q^{1-\frac{1}{n+1}})

Static DHP oracle queries during an initial learning phase, for fixed $n>1 ...

Springer Berlin Heidelberg2010

Elliptic curve digital signature algorithm

Low-Latency Elliptic Curve Scalar Multiplication

Ron was wrong, Whit is right

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

Efficient Fail-Stop Signatures from the Factoring Assumption

Fast Key Recovery Attack on ARMADILLO1 and Variants

Efficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields

High-Performance Modular Multiplication on the Cell Processor

High-Performance Modular Multiplication on the Cell Processor

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

On the Use of the Negation Map in the Pollard Rho Method

Graph Chatbot

Chattez avec Graph Search

Fast Key Recovery Attack on ARMADILLO1 and Variants

Ron was wrong, Whit is right

Efficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields

High-Performance Modular Multiplication on the Cell Processor

High-Performance Modular Multiplication on the Cell Processor

Efficient Fail-Stop Signatures from the Factoring Assumption

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

On the Use of the Negation Map in the Pollard Rho Method