Skip to content

Latest commit

 

History

History
27 lines (16 loc) · 1.24 KB

File metadata and controls

27 lines (16 loc) · 1.24 KB

Efficient Implementations of Post Quantum Cryptographic Schemes Based on Plain Lattices


Introduction

Shor’s algorithm for quantum computers, enables us to solve Integer Factorization problems and Discrete Logarithm Problems in polynomial time. This jeopardizes the current public key schemes such as RSA, Diffie-Hellman key exchange. Therefore, we want secure cryptosystems under quantum computing for classical computers. One of the promising solutions for this is lattice-based cryptographic schemes with the Learning with Errors(LWE) problem.

The aim of the project is implementing acryptographic scheme based on plain lattices and LWE principles which are resistent to attacks from quantum based computers.

Team Members

  • E/16/049, Harshana Bandara, email
  • E/16/134, Yasitha Herath, email
  • E/16/388, Thushara Weerasundara, email

Supervisors

  • Dr. Qinyi Li, email
  • Dr. Janaka Alawathugoda, email
  • Prof. Roshan Ragel, email

Website