Skip to main content
. 2022 Oct 8;24(10):1428. doi: 10.3390/e24101428
Algorithm 5 The LWE algorithm.
  • Input: 

    LWE samples (A,c=As+e)∈Zqm×n×Zqm

  • Output: 

    secret vector s∈Zqn

  •  1:

    Construct a q-ary lattice Λq(A)={v∈Zqm|∃x∈Zn,s.t.v≡Axmodq}, whose lattice basis is equivalent to B=[A|qIm]T∈Z(m+n)×m.

  •  2:

    Perform elementary row transformations on B and obtain the lattice basis B1=InAn×(m−n)′0qIm−n∈Zm×m.

  •  3:

    Using Kannan’s embedding technique, reduce BDD to Unique-SVP and obtain B2=B10cM∈Z(m+1)×(m+1).

  •  4:

    Process B2 with VQE and derive a short vector e.

  •  5:

    returns=A−1(c−e)