HAIC Talk: Hard problems for cryptography: From Factoring to Sudoku – 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.,…