The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q120901094, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q120901094 / rank | |||
Normal rank | |||
Revision as of 02:08, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The polynomial approximate common divisor problem and its application to the fully homomorphic encryption |
scientific article |
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
