Year: 2014
Type: article
Abstract: Lattice-based cryptography provides a much stronger notion of security, in that the average-case of certain problems in lattice-based cryptography is equivalent to the worst-case of those problems.There are strong indications that these problems will remain secure under the assumption of the availability of quantum computers, unlike both the integer-factorization and discrete logarithm problems as relied upon in many conventional cryptosystems.In this paper, the author will explore various methods to improve the practicality of lattice-based cryptosystems (GGH Encryption scheme) and to optimize the algorithm that make up these cryptosystems for modern computer processors.
Author: Vishnu Kumar
Institution: Dehradun Institute of Technology University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2335010064
