… We explore cryptographic primitives with low multiplicative complexity. This is … encryption
(FHE), and zero-knowledge proofs (ZK) where primitives from symmetric cryptography are …

… cryptographic primitives with low multiplicative complexity have … to be vital to improve the
efficiency of these protocols. The … of the MiMC designers who consider attacks with less than \(2^…

… PQ signature schemes where MiMC was not competitive at all, … on the complexity of PRGs,
PRFs, and cryptographic hashes [8, … on the multiplicative complexity we refer to the [3, Sect. 6]. …

… MiMC: Efficient encryption and cryptographic hashing with minimal multiplicative complexity.
In International Conference on the Theory and Application of Cryptology and Information …

… Algebraically simple PRFs, ciphers, or cryptographic hash … of rounds with a minimal security
margin for efficiency. For a … that benefit from a low multiplication count or algebraic simplicity […

… field-based operations, which can be efficiently modeled using the bit-… with lower data
complexities for \(d=5,9,17\). Our results for … Notice that we make no distinction between the secret …

… functions – are typically designed by iterating an efficiently implementable … multiplicative
complexity by instantiating it with the square map. We refer to this modified version of MiMC …

… Sponge mode instantiated by MiMC permutation with a fixed key In the SNARK setting
we use MiMC-n/n It is possible to use MiMC-2n/n for large block size … Towards stream …

… and hash functions. In this note, we show that the block ciphers MiMC-2n/n (or FeistelMiMC) …
As there is no key in this construction, it is unclear how Theorem 1 could be used to attack …

… representing the complexity of matrix multiplication and \(D_{\… – finite field inversion and
low-degree linearised polynomials … , which can in turn be efficiently solved using our three-step …