Minimal condition for shortest vectors in lattices of low dimension (Q1739940): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4228459 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4542515 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lattice Signatures without Trapdoors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Low-dimensional lattice basis reduction revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4788544 / rank | |||
Normal rank |
Revision as of 01:55, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimal condition for shortest vectors in lattices of low dimension |
scientific article |
Statements
Minimal condition for shortest vectors in lattices of low dimension (English)
0 references
29 April 2019
0 references
lattice
0 references
shortest vector problem
0 references
Minkowski-reduced basis
0 references
greedy-reduced basis
0 references