Minimal condition for shortest vectors in lattices of low dimension

DOI10.1016/J.ENDM.2019.02.002OpenAlexW2922642148MaRDI QIDQ1739940

Hyang-Sook Lee, Seunghwan Chang, Juhee Lee, Seongan Lim, Tae-Wan Kim

Publication date: 29 April 2019

Full work available at URL: https://doi.org/10.1016/j.endm.2019.02.002

zbMATH Keywords

latticeshortest vector problemMinkowski-reduced basisgreedy-reduced basis

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Lattice Signatures without Trapdoors
• Low-dimensional lattice basis reduction revisited
• Trapdoors for hard lattices and new cryptographic constructions
• Public-key cryptosystems from the worst-case shortest vector problem
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal condition for shortest vectors in lattices of low dimension