Cryptology ePrint Archive: Report 2011/436
Available versions in chronological order
20110812:183412 (posted 12-Aug-2011 18:34:12 UTC)
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
Yuanmi Chen and Phong Q. Nguyen
20120720:123921 (posted 20-Jul-2012 12:39:21 UTC)
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.
20120720:125803 (posted 20-Jul-2012 12:58:03 UTC)
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
]