The Mathematics of Public-Key Cryptography, Lecture 10

October 12, 2000

Summary of material covered in lecture 10

• factoring an RSA modulus can be Turing reduced to computing half(y)
• a semantically secure public-key cryptosystem based on a trapdoor one-way permutation family (e.g., RSA)
• informal justification of semantic security
• plaintext distinguishability problem
• the random oracle model
• construction of an algorithm to invert f, given an algorithm for the plaintext distinguishability problem