Skip to content

Using ANN to solve Closest Vector in a Lattice Problem

Notifications You must be signed in to change notification settings

Morazotti/CVP-ANN

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 

Repository files navigation

This project aims to solve Closest Vector in a Lattice problem by using Spherical Decoding, introduced by Mohammadkarimi et al. (2019).

We are interested in implementing such solution to be able to solve quantum complexity problems described by Nielsen et al. (2006).

For a detailed explanation of this project, check cvp_nn.pdf, and the implementation at cvp_nn.ipynb.

About

Using ANN to solve Closest Vector in a Lattice Problem

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published