Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (Q3003372): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SWIFFT / rank | |||
Normal rank | |||
Revision as of 13:11, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Making NTRU as Secure as Worst-Case Problems over Ideal Lattices |
scientific article |
Statements
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (English)
0 references
27 May 2011
0 references
Lattice-based cryptography
0 references
NTRU
0 references
provable security
0 references
