Yanbin Pan

A Three-Level Sieve Algorithm for the Shortest Vector Problem

In AsiaCCS 2011, Wang et al. proposed a two-level heuristic sieve algorithm for the shortest vector problem in lattices, which improves the Nguyen-Vidick sieve algorithm. Inspired by their idea, we present a three-level sieve algorithm in this paper, which is shown to have better time complexity. More precisely, the time complexity of our algorithm is

An algebraic broadcast attack against NTRU

2^{0.3778n+on}

Solving low-density multiple subset sum problems with SVP oracle

polynomial-time operations and the corresponding space complexity is

Cryptanalysis of the Randomized Version of a Lattice-Based Signature Scheme from PKC’08

2^{0.2833n+on}

Breaking the Hardness Assumption and IND-CPA Security of HQC Submitted to NIST PQC Project.

polynomially many bits.

The Search Successive Minima Problem Is Equivalent to Its Optimization Version

The NTRU cryptosystem is the most practical scheme known to date and has drawn considerable interest, which depends on three integer parameters (<i>N, p, q</i>) and four sets <i>L</i>_<i>f</i>, <i>L</i>_<i>g</i>, <i>L</i>_<i>r</i>, <i>L</i>_<i>m</i> of polynomials of degree <i>N</i> − 1 with small integer coefficients. We choose <i>p, q</i> such that <i>gcd</i>(<i>p, q</i>) = 1 and <i>p</i> is much smaller than <i>q</i>, denote the ring Z[<i>x</i>]/(<i>x</i>^<i>N</i> -- 1) by <i>R</i> and the multiplication in <i>R</i> by *.