Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers (Q2894427)
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 6051220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers |
scientific article; zbMATH DE number 6051220 |
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
0.8494052290916443
0 references
0.8416953086853027
0 references
0.8303680419921875
0 references
0.8208574652671814
0 references
