Metraipolis › archive › dc_47fd47797a70

CubeHash — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/CubeHash
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-05T23:22:57.455Z
SHA-256 of the archived text
96de7ad2f90e2ccc48f87776e21004c5a3f32c458ea19c566bbffffffe522f7c
Stable URL of this page
https://metraipolis.com/documento/dc_47fd47797a70

How to cite

CubeHash — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/CubeHash (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_47fd47797a70 (Metraipolis archive dc_47fd47797a70, sha256 96de7ad2f90e2ccc48f87776e21004c5a3f32c458ea19c566bbffffffe522f7c)
BibTeX
@misc{dc47fd47797a70,
  title = {CubeHash — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/CubeHash},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_47fd47797a70; sha256 96de7ad2f90e2ccc48f87776e21004c5a3f32c458ea19c566bbffffffe522f7c},
  year = {2026}
}

Archived text

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

CubeHash is a cryptographic hash function submitted to the NIST hash function competition by Daniel J. Bernstein. CubeHash has a 128 byte state, uses wide pipe construction, and is ARX based. Message blocks are XORed into the initial bits of a 128-byte state, which then goes through an r-round bijective transformation between blocks. The initial NIST proposal ("Cubehash8/1") required about 200 cycles per byte. After clarifications from NIST, the author changed the proposal to Cubehash16/32, which "is approximately 16 times faster than CubeHash8/1, easily catching up to both SHA-256 and SHA-512 on the reference platform" while still maintaining a "comfortable security margin". CubeHash advanced to the second round of the competition, but was not chosen as one of the 5 finalists. According to NIST, it has a "simple, well-understood design" that is suitable for constrained environments. However, performance suffers for short messages when the processor does not have a vector unit. Bernstein has since tuned the parameters further and his main recommendation is CubeHash512, defined as CubeHash16+16/32+32–512.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «Merkle tree»).
Fonte: Wikipedia in inglese, voce «CubeHash» — https://en.wikipedia.org/wiki/CubeHash
Wikidata Q4036754 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4036754
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/CubeHash?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 1312133677, consultata il 2026-10-05T23:06:36.807Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 23483880de3d137baca85f8bc63694f6fac57881e8dc4d13a186b148363f7043