The Future of Cryptography: a Case-study of Lattice-based ones
Good for anyone who is interested in security. Familiarity with basic cryptography aspects is helpful but not required.
Thursday, 02 January 2020
13:30 - 14:15
Public key encryption (PKE) cryptography plays a big role in securing communication channels of internet. The security of every PKE scheme is usually based on a hard problem that has no polynomial time solution using any computational structure. However, widely used classic PKE schemes such as RSA or elliptic curve cryptography (ECC), are based on hard problems that have polynomial solutions using a quantum computer. Therefore, such PKE schemes will not be secure in post-quantum era. There exist different post-quantum PKE schemes, which rely on hard problems that do not have polynomial time solutions even using a quantum computer. Among post-quantum schemes, lattice-based cryptography and especially learning with errors (LWE) problem have gained high attention due to their low computational complexity. In addition, special cryptographic problems such as fully homomorphism have solutions based on LWE problem. In this talk, we are going to provide a general overview of lattice-based cryptography schemes and evaluate them compared to other PKE schemes.
Cryptography Learning with Errors (LWE) Post-Quantum Cryptography Lattice-based Cryptography. Quantum Attacks
Shahriar Ebrahimi have received his BSc and MSc degrees both from Sharif University of Technology (SUT), where he is currently a PhD Candidate of Computer Engineering under supervision of Dr. S. Bayat-Sarmadi. He is a full-time researcher in Secure and Smart Systems (3S) Lab in CE department of SUT. He was also a visiting researcher in Mainz (ZDV center) and Hamburg (DKRZ center) universities back in 2014 and 2016. His research interests include: Post-quantum cryptography, Lattice-based cryptography, Internet of Things (IoT) and Computer/Network Architecture and Security.