Concept
Compétition de factorisation RSA
Publications associées (9)
Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE
Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms.This ...
EPFL2022On the Analysis of Public-Key Cryptologic Algorithms
The RSA cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir and Len Adleman is the most commonly deployed public-key cryptosystem. Elliptic curve cryptography (ECC) introduced in the mid 80's by Neal Koblitz and Victor Miller is becoming an increasin ...
EPFL2015Breaking `128-bit Secure' Supersingular Binary Curves
The discrete logarithm problem (DLP) in finite fields of small characteristic recently enjoyed a dramatic series of breakthrough results and computational records, with its (heuristic) complexity dropping from subexponential to quasi-polynomial. While thes ...
2014Modelling Time Series Extremes
Anthony Christopher Davison, Valérie Chavez
The need to model rare events of univariate time series has led to many recent advances in theory and methods. In this paper, we review telegraphically the literature on extremes of dependent time series and list some remaining challenges. ...
2012Cryptographic Hash Functions in Groups and Provable Properties
We consider several "provably secure" hash functions that compute simple sums in a well chosen group (G,*). Security properties of such functions provably translate in a natural way to computational problems in G that are simple to define and possibly also ...
EPFL2011On 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 ...
2009About Machine-Readable Travel Documents
Serge Vaudenay, Martin Vuagnoux, Jean Monnerat
Passports are now equipped with RFID chips that contain private information, biometric data, and a digital signature by issuing authorities. We review most of applicable security and privacy issues. We argue that the main privacy issue is not unauthorized ...
Springer2007Quantum Cryptography : On the Security of the BB84 Key-Exchange Protocol
In 1984, C.H. Bennet and G. Brassard proposed a new protocol aimed to solve the problem of symmetric cryptographic key exchange. This protocol was called BB84 after the name of its authors. While a traditional method would rely on public key cryptography ( ...
2003Factoring
Factoring, finding a non-trivial factorization of a composite positive integer, is believed to be a hard problem. How hard we think it is, however, changes almost on a daily basis. Predicting how hard factoring will be in the future, an important issue for ...
1994