Publications related to Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

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

Elliptic curve cryptosystems (ECCs) are utilised as an alternative to traditional public-key cryptosystems, and are more suitable for resource-limited environments because of smaller parameter size. In this study, the authors carry out a thorough investiga ...

2010

Practical unconditionally secure two-channel message authentication

Atefeh Mashatan

We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. (Two-channel cryptography employs a broadband, insecure wireless channel and an authenticated, narrow-band manual channel at the sa ...

2010

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

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

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

Robert Granger

This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of

\mathbb{F}_{q^6}

, for

q \equiv 1 \bmod{6}

. Our result arises from considering the Weil restriction of scalars of this group from

\mathbb{F}_{q^6}

...

Springer Berlin Heidelberg2010

ARMADILLO: A Multi-purpose Cryptographic Primitive Dedicated to Hardware

Serge Vaudenay, Stéphane Badel, Pouyan Sepehrdad, Nilay Dagtekin, Khaled Ouafi, Jorge Nakahara, Petr Susil

This paper describes and analyzes the security of a general-purpose cryptographic function design, with application in RFID tags and sensor networks. Based on these analyzes, we suggest minimum parameter values for the main components of this cryptographic ...

Springer2010

Obfuscation for Cryptographic Purposes

Martijn Stam

Loosely speaking, an obfuscation O of a function f should satisfy two requirements: firstly, using O, it should be possible to evaluate f; secondly, O should not reveal anything about f that cannot be learnt from oracle access to f alone. Several definitio ...

Springer Verlag2010

Analysis and design of symmetric cryptographic algorithms

Jean-Philippe Aumasson

This thesis is concerned with the analysis and design of symmetric cryptographic algorithms, with a focus on real-world algorithms. The first part describes original cryptanalysis results, including: The first nontrivial preimage attacks on the (reduced) h ...

EPFL2009

Adaptive Message Authentication for Vehicular Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Nikodin Ristanovic, Panagiotis Papadimitratos, Georgios Theodorakopoulos

Public key cryptography can introduce significant processing delays in vehicular communication platforms. This can lead to serious performance issues, especially in the case of multi-hop Inter-Vehicle Communication. In this paper we propose Adaptive Messag ...

Sheridan Printing2009

On the security of 1024-bit RSA and 160-bit elliptic curve cryptography

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

Meeting the requirements of NIST’s new cryptographic standard ‘Suite B Cryptography’ means phasing out usage of 1024-bit RSA and 160-bit Elliptic Curve Cryptography (ECC) by the year 2010. This write-up comments on the vulnerability of these systems to an ...

2009

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

Graph Chatbot

Chat with Graph Search

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

Practical unconditionally secure two-channel message authentication

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

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

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

ARMADILLO: A Multi-purpose Cryptographic Primitive Dedicated to Hardware

Obfuscation for Cryptographic Purposes

Analysis and design of symmetric cryptographic algorithms

Adaptive Message Authentication for Vehicular Networks

On the security of 1024-bit RSA and 160-bit elliptic curve cryptography

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

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

Practical unconditionally secure two-channel message authentication

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

ARMADILLO: A Multi-purpose Cryptographic Primitive Dedicated to Hardware

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

Analysis and design of symmetric cryptographic algorithms

On the security of 1024-bit RSA and 160-bit elliptic curve cryptography

Adaptive Message Authentication for Vehicular Networks

Obfuscation for Cryptographic Purposes