2000 character limit reached
Lattice Problems and Their Reductions(Russian) (1010.2368v1)
Published 12 Oct 2010 in cs.CR
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.