| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428961 | Information Processing Letters | 2006 | 6 Pages |
Abstract
We propose cryptanalysis of the First Domingo-Ferrer's algebraic privacy homomorphism where n=pq. We show that the scheme can be broken by (d+1) known plaintexts in O(d3log2n) time. Even when the modulus n is kept secret, it can be broken by 2(d+1) known plaintexts in O(d4logdn+d3log2n+ɛ(m)) time with overwhelming probability.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
