CryptoDB
Skyscraper: Fast Hashing on Big Primes
| Authors: | |
|---|---|
| Download: | |
| Abstract: | Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. Such hash functions are notably slow, losing a factor of up to 1000 compared to regular constructions like SHA-2/3.In this paper, we present the hash function Skyscraper, which is aimed at large prime fields and provides major improvements compared to Reinforced Concrete and Monolith. First, the design is exactly the same for all large primes, which simplifies analysis and deployment. Secondly, it achieves a performance comparable to cryptographic hash standards by using low-degree non-invertible transformations and minimizing modulo reductions. Concretely, it hashes two 256-bit prime field (BLS12-381 curve scalar field) elements in 135 nanoseconds, whereas SHA-256 needs 42 nanoseconds on the same machine.The low circuit complexity of Skyscraper, together with its high native speed, should allow a substantial reduction in many VC scenarios, particularly in recursive proofs. |
BibTeX
@article{tches-2025-35243,
title={Skyscraper: Fast Hashing on Big Primes},
journal={IACR Transactions on Cryptographic Hardware and Embedded Systems},
publisher={Ruhr-Universität Bochum},
volume={2025},
pages={743-780},
url={https://tches.iacr.org/index.php/TCHES/article/view/12064},
doi={10.46586/tches.v2025.i2.743-780},
author={Clémence Bouvier and Lorenzo Grassi and Dmitry Khovratovich and Katharina Koschatko and Christian Rechberger and Fabian Schmid and Markus Schofnegger},
year=2025
}