introduction

Welcome to the ideal lattice challenge.

This website offers the possibility to test SVP and lattice reduction algorithms for ideal lattices. We offer two halls of fame for the same lattices - for SVP and Approx-SVP. In most dimensions we offer multiple lattices, belonging to different cyclotomic polynomials (distinguished by the index of the cyclotomic).

participation

How to participate:

You can either
  • download a sample lattice on the right side, or
  • download the generator and generate lattices yourself (generation takes some time!)

How to Enter on of the Hall of Fame

  • If in dimension n you find a shorter vector than
    norm
    you can enter the SVP Hall of Fame.
  • Otherwise if you find a shorter vector than
    norm
    you can enter the Approx-SVP Hall of Fame.

In both cases you can enter the Hall of Fame if you are the first in dimension n to solve a challenge or your submitted vector is shorter than the shortest one in a dimension that was solved before.

More Information

  1. T. Plantard, M. Schneider: Creating a Challenge for Ideal Lattices, IACR Cryptology ePrint Archive: Report 2013/039

svp hall of fame

Position Dimension Index Seed Euclidean norm Contestant Solution
113013102912Shang-Yi Yangvec
213026203000Jean-Christophe Deneuvillevec
313026203004Kenji KASHIWABARA and Tadanori TERUYAvec
412825502924Kenji KASHIWABARA and Tadanori TERUYAvec
512825602959Tsukasa Ishiguro, Shinsaku Kiyomoto, Yutaka Miyake, Tsuyoshi Takagivec

Approx-svp hall of fame

Position Dimension Index Seed Euclidean norm Contestant Solution
16526530626850Yuntao Wang; Yoshinori Aono; Takuya Hayashi; Jintai Ding; Tsuyoshi Takagivec
26526530626936Yuntao Wang; Yoshinori Aono; Takuya Hayashi; Tsuyoshi Takagivec
36526530661210Jean-Christophe Deneuvillevec
46526530661349Yuntao Wang, Yoshinori Aono, Takuya Hayashi, Tsuyoshi Takagivec
56006010542883Jean-Christophe Deneuvillevec