Publication

On the Cryptanalysis of Public-Key Cryptography

Related publications (123)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

User-Aided Data Authentication

Sylvain Pasini

All classical authentication protocols are based on pre-shared authentic information such as long-term secret keys or a public key infrastructure. However, there are many practical settings, where participants can additionally employ authentic Out-Of-Band ...

2009

2-Selmer groups and the Birch-Swinnerton-Dyer Conjecture for the congruent number curves

Robert Christopher Rhoades

We take an approach toward Counting the number of integers n for which the curve (n),: y(2) = x(3) - n(2)x has 2-Selmer groups of a given size. This question was also discussed in a pair of papers by Roger Heath-Brown. In contrast to earlier work, our anal ...

2009

Provable Security in Cryptography

Thomas Baignères

These lecture notes are a compilation of some of my readings while I was preparing two lectures given at EPFL on provable security in cryptography. They are essentially based on a book chapter from David Pointcheval called “Provable Security for Public Key ...

2007

Cryptanalysis of the Sidelnikov cryptosystem

Mohammad Amin Shokrollahi, Lorenz Minder

We present a structural attack against the Sidelnikov cryptosystem. The attack creats a private key from a give public key. Its running time is subexponential and it is effective if the parameters of the Reed-Muller code allow for efficient sampling of min ...

Springer Verlag2007

A kilobit special number field sieve factorization

Arjen Lenstra, Thorsten Kleinjung, Dag Arne Osvik

We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne number 21039 -1. Although this factorization is orders of magnitude ...

2007

E-Passport Threats

Serge Vaudenay

The author focuses on the cryptographic protection of e-passports, working from the assumption that even if people can peacefully live with their e- passports, what sort of cryptography technology is involved here? Can e- passport holders protect their pri ...

2007

On Small Degree Extension Fields in Cryptology

Robert Granger

This thesis studies the implications of using public key cryptographic primitives that are based in, or map to, the multiplicative group of finite fields with small extension degree. A central observation is that the multiplicative group of extension field ...

PhD dissertation, University of Bristol, UK, February 20062006

Cryptosystems and LLL

Thomas Baignères

Since the late 70’s, several public key cryptographic algorithms have been proposed. Diﬃe and Hellman ﬁrst came with this concept in 1976. Since that time, several other public key cryptosystems were invented, such as the well known RSA, ElGamal or Rabin c ...

2006