Download now Free registration required
A method for finding the closest point for lattices with a regular spherical structure and a modified ML decoder for the Closest Vector Problem (CVP) are presented. Based on the algorithm one can construct a public key encryption algorithm. A CVP algorithm using convex hull to avoid the complexity of finding radii for the existing ML decoders is also presented.
- Format: PDF
- Size: 276 KB