Hyper-encryption

Hyper-encryption is a form of encryption invented by Michael O. Rabin which uses a high-bandwidth source of public random bits, together with a secret key that is shared by only the sender and recipient(s) of the message.[1] It uses the assumptions of Ueli Maurer's bounded-storage model as the basis of its secrecy. Although everyone can see the data, decryption by adversaries without the secret key is still not feasible, because of the space limitations of storing enough data to mount an attack against the system.

Unlike almost all other cryptosystems except the one-time pad, hyper-encryption can be proved to be information-theoretically secure, provided the storage bound cannot be surpassed. Moreover, if the necessary public information cannot be stored at the time of transmission, the plaintext can be shown to be impossible to recover, regardless of the computational capacity available to an adversary in the future, even if they have access to the secret key at that future time.

A highly energy-efficient implementation of a hyper-encryption chip was demonstrated by Krishna Palem et al. using the Probabilistic CMOS or PCMOS technology and was shown to be ~205 times more efficient in terms of Energy-Performance-Product.[2][3]

See also

References

  1. ↑ Rabin, M.O. (2005-10-19). "Provably unbreakable hyper-encryption in the limited access model". IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005: 34–37. doi:10.1109/ITWTPI.2005.1543953.
  2. ↑ "Revolutionary microchip uses 30 times less power". Rice University.
  3. ↑ Lakshmi N. Chakrapani, Bilge E. S. Akgul, Suresh Cheemalavagu, Pinar Korkmaz, Krishna V. Palem and Balasubramanian Seshasayee. "Ultra Efficient Embedded SOC Architectures based on Probabilistic CMOS (PCMOS) Technology". Design Automation and Test in Europe Conference (DATE), 2006.

Further reading

External links


This article is issued from Wikipedia - version of the Thursday, December 11, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.