Metraipolis › archive › dc_35caec1fa269

Very smooth hash — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Very_smooth_hash
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-05T23:20:29.249Z
SHA-256 of the archived text: 1952f378e0a9160e43ecc889edd47ea711c9de90e5e58f7846366c7d1b95298c
Stable URL of this page: https://metraipolis.com/documento/dc_35caec1fa269

How to cite

Very smooth hash — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Very_smooth_hash (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_35caec1fa269 (Metraipolis archive dc_35caec1fa269, sha256 1952f378e0a9160e43ecc889edd47ea711c9de90e5e58f7846366c7d1b95298c)

BibTeX

@misc{dc35caec1fa269,
  title = {Very smooth hash — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Very_smooth_hash},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_35caec1fa269; sha256 1952f378e0a9160e43ecc889edd47ea711c9de90e5e58f7846366c7d1b95298c},
  year = {2026}
}

Archived text

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

In cryptography, Very Smooth Hash (VSH) is a provably secure cryptographic hash function invented in 2005 by Scott Contini, Arjen Lenstra, and Ron Steinfeld. Provably secure means that finding collisions is as difficult as some mathematical problem that is known to be hard. Unlike other provably secure collision-resistant hashes, VSH is efficient and usable in practice. Asymptotically, it only requires a single multiplication per log(n) message-bits and uses RSA-type arithmetic. Therefore, VSH can be useful in embedded environments where code space is limited. Two major variants of VSH were proposed. For one, finding a collision is provably as difficult as finding a nontrivial modular square root of a very smooth number modulo n. The other one uses a prime modulus p (with no trapdoor), and its security proof relies on the hardness of finding discrete logarithms of very smooth numbers modulo p. Both versions have similar efficiency. VSH is not suitable as a substitute for a random oracle, but can be used to build a provably secure randomized trapdoor hash function. This function can replace the trapdoor function used in the Cramer–Shoup signature scheme, maintaining its provable security while speeding up verification time by about 50%.

Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «cryptographic hash function»).
Fonte: Wikipedia in inglese, voce «Very smooth hash» — https://en.wikipedia.org/wiki/Very_smooth_hash
Wikidata Q3553011 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3553011
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Very_smooth_hash?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 1371440008, consultata il 2026-10-05T23:05:44.506Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 6cc3738aa7ca7e743fff495675f67516a44f320def365cd7985f5c64248888b9