Lattice Problems and Their Reductions(Russian)

2010/10/12 by Usatyuk, V. S.
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1010.2368

Abstract

This article presets a review of lattice problems. Paper contains the main eighteen problems with their reductions and referents to his cryptography application. As an example of reduction, we detail analyze connection between SVP and CVP. Moreover, we give an Ajtai theorem and demonstrate its role in lattice based cryptography.

Related

• Short review of lattice basis reduction types and his applications (Russian)
• Review of Lattice-based Public key Cryptography(Russian)
• Some Mathematical Problems Behind Lattice-Based Cryptography
• Lattices, Homomorphic Encryption, and CKKS
• A Tutorial Introduction to Lattice-based Cryptography and Homomorphic Encryption