Trial lecture: “Integer Factorization and the security of RSA”

Abstract:
“Integer Factoring is a computational hard problem that consists of finding the prime factors of a given positive integer. This problem is used as a building block for public-key cryptographic schemes in modern cryptography. In this lecture, I will discuss the applications of this problem, such as the RSA cryptosystem, and the known algorithms to solve it.”

Committee:
Nikolay Kaleyski (head of the doctoral evaluation committee)
Markus Hittmeir
Martjin Stam

Supervisors:
Igor Semaev (Main supervisor)
Chunlei Li (Co-supervisor)
Qian Guo (Co-supervisor)

The trial lecture will be held on Tuesday 28^th June at 10:00 o’clock, online by zoom.