MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity

By Martin R. Albrecht, Lorenzo Grassi, Christian Rechberger, Arnab Roy, Tyge Tiessen. International Conference on the Theory and Application of Cryptology and Information Security, 2016

363 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017, background): “Last but not least there are the block ciphers and hash functions around MiMC [5] which need less than 2 · s multiplications for s -bit security in a field of size close to 2 s .”
From Keys to Databases - Real-World Applications of Secure Multi-Party Computation (2018, methodology): “Jana at present provides two distinct property-preserving encryptions: deterministic (equalitypreserving) encryption via the MiMC block cipher [9]; and order revealing encryption encrypted as POPE indexes [10].”
Poseidon: A New Hash Function for Zero-Knowledge Proof Systems (2021, methodology): “We take Blake2s and Pedersen hash estimates from [38], the SHA-256 count from Hopwood’s notes15, whereas for MiMC and Rescue we calculated them ourselves based on the round numbers provided in [4, 6].”