A Tutorial on High Performance Computing Applied to Cryptanalysis

Explore high-performance computing techniques applied to cryptanalysis in this comprehensive tutorial presented at Eurocrypt 2012 by Antoine Joux. Delve into the unique aspects of computations in cryptanalysis, learn about the main steps involved, and discover how to choose appropriate targets for analysis. Gain insights into the coding phase for record-breaking implementations, understand the scale of computations through reference points, and examine case studies including EC Point counting, SHA-O collision, and Triple collisions. Follow the progression of elliptic curve discrete logarithm problem-solving on finite fields, from initial approaches to refined linear algebra techniques. Acquire valuable knowledge on leveraging computing power effectively for cryptanalytic challenges in this informative talk.

Intro
Why "HPC in Cryptanalysis" ?
How special are computations in Cryptanalysis ?
Main steps
Starting points : personal sample
Stopping at toy implementations
Finding computing power
Choosing a target
Proof of concept case
Medium case
The coding phase for records (personal view)
Running the computation
Size of computations - Some reference points
EC Point counting (1998)
SHA-O collision (2004)
Triple collisions (2009)
Initial view for EC DLOG on GF(p)
More data for 6 x 22
More data for 6 x 23
Back to the drawing board
New Linear Algebra, testing on 6 x 25
New linear algebra 6 x 26 ?
Conclusion