 |
 |
 |
 |
Design and analysis of algorithms used in cryptographic protocols or security assessments.
We carried out a sanity check of public key material on the web. Some of the findings were discussed here.
Three of our record calculations are linked to under slashdot. The latest is a 73-digit factor found using the elliptic curve method.
Chosen-prefix Collisions for MD5 and Applications describes the construction of a certificate for a rogue Certification Authority. This paper supports migration away from 1024-bit RSA and this describes our number crunching on clusters at EPFL.
Links and papers
- Solving shortest and closest vector problems: The decomposition approach
- ‘128-bit secure’ supersingular curve crypto scheme cracked in two hours
- Congress on Privacy and Surveillance, 30 Sep 2013, EPFL
- Die Zeit on Tor
- Spiegel on prism and such
- Not recent, but just released: NSA Cryptolog
- Ron was wrong, Whit is right
- Efficient SIMD arithmetic modulo a Mersenne number
- Factorization of a 768-bit RSA modulus
- Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using Sloppy Reduction
- Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate
- A kilobit special number field sieve factorization
