Skip to content

This project proposes the use of plain lattices with learning with errors problem to implement a cryptographic scheme which can run on classical computers and provides security against quantum based attacks. We are proposing key sizes for efficient operations and implement a lattice trapdoor function. Also we will improve current random oracle b…

cepdnaclk/e16-4yp-post-quantum-cryptographic-schemes-based-on-plain-lattices

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

39 Commits
 
 
 
 
 
 

Repository files navigation


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

About

This project proposes the use of plain lattices with learning with errors problem to implement a cryptographic scheme which can run on classical computers and provides security against quantum based attacks. We are proposing key sizes for efficient operations and implement a lattice trapdoor function. Also we will improve current random oracle b…

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages