Metraipolis › archive › dc_9be23697478e

Hyper-encryption — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Hyper-encryption
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-07T15:09:04.474Z
SHA-256 of the archived text
0322746dc17e53427b5efa2656f1187877866481f51b077ebcbb647e4d8eefae
Stable URL of this page
https://metraipolis.com/documento/dc_9be23697478e

How to cite

Hyper-encryption — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Hyper-encryption (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_9be23697478e (Metraipolis archive dc_9be23697478e, sha256 0322746dc17e53427b5efa2656f1187877866481f51b077ebcbb647e4d8eefae)
BibTeX
@misc{dc9be23697478e,
  title = {Hyper-encryption — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Hyper-encryption},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_9be23697478e; sha256 0322746dc17e53427b5efa2656f1187877866481f51b077ebcbb647e4d8eefae},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Hyper-encryption. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. 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.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «information theory»).
Fonte: Wikipedia in inglese, voce «Hyper-encryption» — https://en.wikipedia.org/wiki/Hyper-encryption
Wikidata Q5957534: «form of encryption using a high-bandwidth source of public random bits, together with a secret key that is shared by only the sender and recipient of the message, uses the assumptions of the bounded-storage model as the basis of its secrecy» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5957534
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Hyper-encryption?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1267470250, consultata il 2026-11-07T15:04:18.833Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 39e3e444c2c1d551e9e42ea7d82515bbc6fc24eb7155c03d654fa273af1fb611