Abstract: Finding the shortest vector in a lattice is a problem that is believed to be hard both for classical and quantum computers. Many major postquantum secure cryptosystems base their security on ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results