BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//HAIC - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:HAIC
X-ORIGINAL-URL:https://haic.fi
X-WR-CALDESC:Events for HAIC
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20170326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20171029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20191027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20181009T174500
DTEND;TZID=Europe/Helsinki:20181009T191500
DTSTAMP:20260614T232506
CREATED:20180917T135407Z
LAST-MODIFIED:20180928T143254Z
UID:685-1539107100-1539112500@haic.fi
SUMMARY:HAIC Talk: Hard problems for cryptography: From Factoring to Sudoku - with Chris Brzuska
DESCRIPTION: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. \nIn the talk\, we will see the diversity of hard problems that are candidates for secure cryptography\, ranging from factoring to sudoku. \nAbout 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. \nBrzuska 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. \nRegistration: HAIC Talks are open to everyone and free of charge but we ask you to register for the event.
URL:https://haic.fi/event/haic-talk-cryptography-with-chris-brzuska/
LOCATION:Dipoli\, Lumituuli\, Otakaari 24\, Espoo\, 02150\, Finland
END:VEVENT
END:VCALENDAR