Katalin Gyarmati:
Public key cryptosystems
In my presentation, I will explain the RSA algorithm and some attacks that can break it. For instance, each modulus can only be used by one user, and the RSA algorithm's private key must be at least a third of the modulus's fourth root. Most attacks on RSA rely on factorization algorithms, so we will study some of these methods. If there is time, we will also study the discrete logarithm problem.