This talk focuses on the Monolith hash function and presents it as a potential alternative to Poseidon and Poseidon2.
This talk focuses on the current situation regarding the cryptographic security of the Poseidon and Poseidon2 hash functions.
While the algorithmic description of circuit-friendly hash functions is often straightforward, the underlying architecture allows for many different ways of implementing them. This talk will go over various implementation characteristics in certain …
Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, elliptic-curve-based SNARKs require large (256-bit and higher) primes. Such hash functions are notably …
Hash functions are a crucial component in incrementally verifiable computation (IVC) protocols and applications. Among those, recursive SNARKs and folding schemes require hash functions to be both fast in native CPU computations and compact in …
Zero-knowledge (ZK) applications form a large group of use cases in modern cryptography, and recently gained in popularity due to novel proof systems. For many of these applications, cryptographic hash functions are used as the main building blocks, …