Udhay Shankar N quotes wikipedia:
> The question was finally resolved in 2009 with the development of the
> first true fully homomorphic cryptosystem. The scheme, constructed by
> Craig Gentry, employs lattice based encryption and allows evaluation
> of both addition and multiplication operations w
> Differential Path for SHA-1 with complexity O(2**52)
> Cameron McDonald, Philip Hawkes, and Josef Pieprzyk
> Macquarie University
>
> http://eprint.iacr.org/2009/259.pdf
I wonder now with this new improved differential path if any distributed
computations may be forming to finally create a SHA-1
from http://en.wikipedia.org/wiki/Homomorphic_encryption :
> The utility of fully homomorphic encryption has been long
> recognized. The problem of constructing such a scheme was first
> proposed within a year of the development of RSA.[1] A solution proved
> more elusive; for more than 30 years,
