Cryptology ePrint Archive: Report 2011/436

Available versions in chronological order


Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
Yuanmi Chen and Phong Q. Nguyen

Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
Yuanmi Chen and Phong Q. Nguyen
Publication Info: This is the full version of EUROCRYPT '12.

Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
Yuanmi Chen and Phong Q. Nguyen
Publication Info: This is the full version of EUROCRYPT '12.


[ Cryptology ePrint archive ]