HAIC Talk: Hard problems for Cryptography - with Chris Brzuska

Description: 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. Watch the questions & answers here: https://youtu.be/3MFVnbw6zYo 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. HAIC Talks is a series of public outreach events on contemporary topics in information security, organized by the Helsinki-Aalto Center for Information Security (HAIC). These events are free and open to everyone. The event was held at Aalto University 9.10.2018. Find out about previous and upcoming HAIC talks here: https://haic.fi/talks/ The Helsinki-Aalto Center for Information Security is a strategic initiative between Aalto University and the University of Helsinki with the aim of ensuring excellence in information security research and education. Website: https://haic.fi/ Facebook: https://www.facebook.com/haic.fi/ Twitter: https://twitter.com/HAIC_fi