Difference between revisions of "28 February 2017"

From mn/ifi/AFSecurity
Jump to: navigation, search
Line 17: Line 17:
  
 
'''ABSTRACT:'''
 
'''ABSTRACT:'''
Cryptographic research is constantly on the move as new cryptanalytical techniques become available. After the discovery of quantum algorithms that can overcome the computational complexity of cryptographic primitives in current mainstream algorithms, the search is on to find suitable candidate primitives for new quantum resistant algorithms. This research field lives under the banner of post-quantum cryptography.
+
Cryptographic research is constantly on the move as new cryptanalytical techniques become available. After the discovery of quantum algorithms that can overcome the computational complexity of cryptographic primitives in current mainstream algorithms, the search is on to find suitable candidate primitives for new quantum-resistant algorithms. This research field carries the banner of post-quantum cryptography.
  
 
I will try to give an overview of how quantum algorithms come into play in cryptanalysis and which problems arise for current cryptography. Finally I will sketch some of the families of primitives that have been proposed in the quest for finding solutions that may survive in the post-quantum era.
 
I will try to give an overview of how quantum algorithms come into play in cryptanalysis and which problems arise for current cryptography. Finally I will sketch some of the families of primitives that have been proposed in the quest for finding solutions that may survive in the post-quantum era.

Revision as of 08:06, 25 January 2017

AFSecurity Seminar

Post-Quantum Crypto

DATE: 28 February 2017

LOCATION:  Kristen Nygaards sal (room 5370), Ole Johan Dahl's House.

AGENDA:

14:00h Welcome at IFI

14:15h Talk: Post-Quantum Cryptography: A Concise Overview

15:00h Discussion

SPEAKER: Thomas Gregersen, NSM

ABSTRACT: Cryptographic research is constantly on the move as new cryptanalytical techniques become available. After the discovery of quantum algorithms that can overcome the computational complexity of cryptographic primitives in current mainstream algorithms, the search is on to find suitable candidate primitives for new quantum-resistant algorithms. This research field carries the banner of post-quantum cryptography.

I will try to give an overview of how quantum algorithms come into play in cryptanalysis and which problems arise for current cryptography. Finally I will sketch some of the families of primitives that have been proposed in the quest for finding solutions that may survive in the post-quantum era.


SPEAKER BIO: Thomas Gregersen holds a PhD in mathematics from the University of Oslo. In 2014 he joined NSM (National Security Authorithy) as a researcher.