Searching for hard instances of CVP problem-cryptographic perspective

Details Searching for hard instances of CVP problem-cryptographic perspective Searching for hard instances of CVP problem-cryptographic perspective

Jan 2008

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2008spie.6937e..75p&link_type=abstract

Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2007. Edited by Romaniuk, Rys

Statistics

Applications

Scientific paper

Lattice is regular arrangement of points in Rn. The Closest Vector Problem (CVP) is defined as follow: given a point y in Rn and a lattice basis B find lattice vector Bx closest to y . The CVP problem is believed to be computationally intractable in average. Here we propose a new way to generate hard instances of CVP and a method that allows us to construct a cryptographic trapdoor function based on it. We start with brief introduction to lattices. Next we present a very natural application of lattices in cryptography, i.e. GGH cryptosystem and the way the system was broken. Finally we present our modifications way to generate hard instances of CVP, harder than previously proposed in GGH.

Affiliated with

Also associated with

No associations

Rating

Searching for hard instances of CVP problem-cryptographic perspective does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Searching for hard instances of CVP problem-cryptographic perspective, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searching for hard instances of CVP problem-cryptographic perspective will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1258247