Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers (Q2894427): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BKZ / rank | |||
Normal rank | |||
Revision as of 08:07, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers |
scientific article |
Statements
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers (English)
0 references
29 June 2012
0 references
simple fully-homomorphic encryption (FHE) schemes
0 references
hardness of approximate integer common divisors problems
0 references
partial version (PACD)
0 references
general version (GACD)
0 references
new PACD algorithm
0 references
new GACD algorithm
0 references
