RSA Cryptanalysis and factorization algorithms

Master’s defense by Tommy Bülow

30 October 2012 at 11:00 am


The main purpose of the thesis is to present in a clear, precise, and coherent way the theory behind cryptanalysis of RSA encryption so that it becomes accessible to a "typical" computer scientist with limited mathematical background.

The focus is on attacks based on integer factorization algorithms, in particular those using the so-called sieving methods, but attacks that target either the RSA parameters or improper use of RSA are also covered.

The resources needed by an adversary in order to conduct these attacks are briefly considered, and along the way a set of explicit precautions anyone wanting to implement and/or use RSA must take against the considered attacks and factoring algorithms is collected.

The defense is public; all are welcome.The defense will be held in Danish.

Place: DIKU - Meeting room A+B -ground floor

Supervisor: Cand. scient. Nils Andersen, DIKU

External examiner: Professor Lars Ramkilde Knudsen, Math Dept., DTU