IDEAL LATTICE
CHALLENGE

Submission

Submission

Download

Challenges in Dimension

52	54	56	58	60	64	66
70	72	78	80	82	84	88
92	96	100	102	104	106	108
110	112	116	120	126	128	130
132	136	138	140	144	148	150
156	160	162	164	166	168	172
176	178	180	184	190	192	196
198	200	204	208	210	212	216
220	222	224	226	228	232	238
240	250	252	256	260	262	264
268	270	272	276	280	282	288
292	294	296	300	306	310	312
316	320	324	328	330	332	336
342	344	346	348	352	356	358
360	366	368	372	378	380	382
384	388	392	396	400	408	416
418	420	424	430	432	438	440
442	444	448	452	456	460	462
464	466	468	476	478	480	486
490	492	498	500	502	504	506
508	512	520	522	524	528	536
540	544	546	552	556	560	562
564	568	570	576	580	584	586
588	592	598	600	606	612	616
618	620	624	630	632	636	640
642	646	648	652	656	658	660
664	672	676	682	684	688	690
692	696	700	704	708	712	716
718	720	726	732	736	738	742
744	750	756	760	764	768	772
776	780	784	786	792	796	800
808	810	812	816	820	822	826
828	832	836	838	840	848	852
856	858	860	862	864	876	880
882	884	886	888	896	900	904
906	910	912	918	920	924	928
930	932	936	940	946	952	956
960	966	970	972	976	980	982
984	990	996	1000	1004	1008	1012
1016	1018	1020	1024

Contact

Thomas Plantard

(University of Wollongong)

Nam Nguyen

(TU Darmstadt)

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
use the generator online to produce a lattice with (integer) seeds of your choice, or
download the generator and install it with an NTL older than NTL 9.4 (necessary since NTL 9.4 and later versions use a different pseudorandom number generator) to create challenges on your local machine.

How to Enter on of the Hall of Fame

If in dimension n you find a shorter vector than
you can enter the SVP Hall of Fame.
Otherwise if you find a shorter vector than
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

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

Acknowledgment:

Special thanks to Yuntao Wang and Junpei Yamaguchi for pointing out the change in the NTL pseudorandom generator and to Yuntao Wang for helping with the online version of the generator.

svp hall of fame

Position	Dimension	Index	Euclidean norm	Contestant	Solution
1	176	267	3471	Leizhang Wang, Yuntao Wang, Baocang Wang	vec
2	172	173	3419	Leizhang Wang, Yuntao Wang, Baocang Wang	vec
3	168	203	3414	Leizhang Wang, Yuntao Wang, Baocang Wang	vec
4	164	249	3330	Leizhang Wang, Yuntao Wang, Baocang Wang	vec
5	162	163	3266	Leizhang Wang, Yuntao Wang, Baocang Wang	vec

Complete list

Approx-svp hall of fame

Position	Dimension	Index	Euclidean norm	Contestant	Solution
1	750	751	718314	Leizhang Wang, Yuntao Wang, Baocang Wang	vec
2	700	701	658346	Ziyu Zhao	vec
3	660	661	582938	Yuntao Wang; Yoshinori Aono	vec
4	660	661	583069	Yoshinori Aono	vec
5	660	661	671466	Yoshinori Aono	vec