Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (Q3003372): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SWIFFT / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NTRU / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1936753088 / rank | |||
Normal rank | |||
Latest revision as of 02:21, 20 March 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
