Approximate-deterministic public key encryption from hard learning problems (Q3179474)
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 6667821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate-deterministic public key encryption from hard learning problems |
scientific article; zbMATH DE number 6667821 |
Statements
Approximate-Deterministic Public Key Encryption from Hard Learning Problems (English)
0 references
21 December 2016
0 references
deterministic public key encryption
0 references
learning parity with noise
0 references
learning with errors
0 references
0 references
0 references
0 references
0 references
0 references
0.7912505269050598
0 references
0.7898877859115601
0 references
0.7891248464584351
0 references
0.7817966341972351
0 references
0.780786395072937
0 references
