SUMS: Zhang -- Breaking (badly constructed) 1024-bit RSA

This week’s SUMS talk is being given by Yinan Zhang.  As always, pizza and drinks will
be available after the talk.  

Abstract: 
RSA and public key cryptography has underpinned internet security for many
years and is now ubiquitous as a result of the world becoming more online and
interconnected.  While the theoretical background of RSA is simple, creating a practical
system can be plagued with various issues rendering the system insecure.  In this talk
we examine three recent papers which exploits non-pseudorandomly generated keys to
factorise RSA moduli.