The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The polynomial approximate common divisor problem and its application to the fully homomorphic encryption |
scientific article; zbMATH DE number 6870718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The polynomial approximate common divisor problem and its application to the fully homomorphic encryption |
scientific article; zbMATH DE number 6870718 |
Statements
The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (English)
0 references
22 May 2018
0 references
polynomial approximate GCD problem
0 references
Chinese remainder theorem
0 references
fully homomorphic encryption
0 references
large integer arithmetic
0 references
SIMD operation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8494052290916443
0 references
0.8278207778930664
0 references
0.8158265948295593
0 references
0.8148522973060608
0 references
0.8128234148025513
0 references
