Organizer: Christian Janson
This talk is the second one in the seminar series “Reading the Crypto Classics” for the very special winter term 2020/2021. The idea of this seminar is to jointly read classical milestone papers in the area of cryptography, to discuss their impact and understand their relevance for current research areas. The seminar is running as an Oberseminar, but at the same time meant to be a joint reading group seminar of the CROSSING Special Interest Group on Advanced Cryptography with all interested CROSSING members being invited to participate.
This issue will cover the paper/talk
Agrawal, Kayal, Saxena: „PRIMES is in P“ ( (opens in new tab)) PDF
with the following abstract:
“We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.”