Making NTRU as secure as worst-case problems over ideal lattices (Q3003372)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5900245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making NTRU as secure as worst-case problems over ideal lattices |
scientific article; zbMATH DE number 5900245 |
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
0.8844078183174133
0 references
0.8807377815246582
0 references
0.8488795757293701
0 references
0.8451946377754211
0 references
0.8360802531242371
0 references
