Thursday, June 25, 2009

IBM researcher solves longstanding cryptographic challenge

An IBM researcher named Craig Gentry has solved a thorny mathematical problem in a unpublished doctorate that has confounded scientists since the invention of public-key encryption several decades ago. The breakthrough, called "privacy homomorphism," or "fully homomorphic encryption," makes possible the deep and unlimited analysis of encrypted information - data that has been intentionally scrambled - without sacrificing confidentiality.

BAD HARDWARE: Seems that public key encrypting got in the end literal meaning. :)
A Heaven for public surveillance.

Comments: Post a Comment

<< Home

This page is powered by Blogger. Isn't yours?