Hard problems for cryptography: From Factoring to Sudoku – with Chris Brzuska
Hard problems for cryptography: From Factoring to Sudoku
Professor Chris Brzuska
Cryptographers use hard problems to construct unbreakable encryption schemes, pseudorandom number generators and more. A typical example is the factoring of large numbers, i.e., we learn in primary school how to multiply numbers, but given a large number, even supercomputers struggle to take it apart into its prime factors.
In the talk, we will see the diversity of hard problems that are candidates for secure cryptography, ranging from factoring to sudoku.
About the speaker:
Christopher Brzuska is a faculty member at the departments computer science and mathematics and systems analysis at Aalto University. His research area is cryptography and his activities range from investigating secure payment to generating numbers that look random although they are actually not.
Brzuska studied mathematics in Duisburg-Essen, Bordeaux and Darmstadt, holds a PhD from the computer science department at TU Darmstadt and worked as a post-doctoral researcher at Tel-Aviv University and Microsoft Research Cambridge. He was an assistant professor for IT Security Analysis at TU Hamburg where he closely collaborated with NXP Semiconductors.
The HAIC public outreach initiative aims to make information security more accessible to a broader audience. As part of this initiative, are organizing HAIC Talks, a series of public lectures on contemporary topics in information security. In the style of studia generalia, these lectures are free and open to everyone. No background knowledge in information security is required. HAIC Talks are made possible through the generous support of the Aalto University School of Science.
Sign-up for our HAIC Talks mailing list to hear about future events.