MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity

DOI10.1007/978-3-662-53887-6_7zbMath1404.94035OpenAlexW2552640487MaRDI QIDQ2958119

Lorenzo Grassi, Martin R. Albrecht, Arnab Roy, Tyge Tiessen, Christian Rechberger

Publication date: 1 February 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/c019bf7f-0ecb-424e-b53f-189143f76eb8

zbMATH Keywords

block cipherscryptanalysiszero knowledgehash functionsdistributed cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (42)

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions ⋮ The \(t\)-wise independence of substitution-permutation networks ⋮ On the guaranteed number of activations in $\mathsf{XS}$-circuits ⋮ Zero knowledge proofs towards verifiable decentralized AI pipelines ⋮ Plumo: an ultralight blockchain client ⋮ Effective and efficient masking with low noise using small-Mersenne-prime ciphers ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications ⋮ Coefficient grouping: breaking Chaghri and more ⋮ Provably unforgeable threshold EdDSA with an offline participant and trustless setup ⋮ Implicit white-box implementations: white-boxing ARX ciphers ⋮ A theoretical analysis of generalized invariants of bijective S-boxes ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ Cryptanalysis of Ciminion ⋮ Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers ⋮ Algebraic meet-in-the-middle attack on LowMC ⋮ Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256} ⋮ On the field-based division property: applications to MiMC, Feistel MiMC and GMiMC ⋮ Cryptanalysis of symmetric primitives over rings and a key recovery attack on \textsf{Rubato} ⋮ Combined fault and leakage resilience: composability, constructions and compiler ⋮ Algebraic attacks on Rasta and Dasta using low-degree equations ⋮ Dynamic random probing expansion with quasi linear asymptotic complexity ⋮ Transciphering framework for approximate homomorphic encryption ⋮ ParaDiSE: efficient threshold authenticated encryption in fully malicious model ⋮ Related-key differential cryptanalysis of GMiMC used in post-quantum signatures ⋮ Universal hashing based on field multiplication and (near-)MDS matrices ⋮ Invertible quadratic non-linear functions over \(\mathbb{F}_p^n\) via multiple local maps ⋮ \textsc{Poseidon}2: a faster version of the \textsc{Poseidon} hash function ⋮ New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode ⋮ Coefficient grouping for complex affine layers ⋮ \texttt{Horst} meets \textit{Fluid}-SPN: Griffin for zero-knowledge applications ⋮ Error correction and ciphertext quantization in lattice cryptography ⋮ Boomerang uniformity of popular S-box constructions ⋮ An algebraic attack on ciphers with low-degree round functions: application to full MiMC ⋮ On the algebraic degree of iterated power functions ⋮ New cryptanalysis of LowMC with algebraic techniques ⋮ \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields ⋮ The inverse of \(\chi\) and its applications to Rasta-like ciphers ⋮ Post-quantum ID-based ring signatures from symmetric-key primitives ⋮ Out of oddity -- new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems ⋮ On a generalization of substitution-permutation networks: the HADES design strategy ⋮ Lightweight authenticated encryption mode suitable for threshold implementation

Uses Software

• NTL
• Trivium
• NOEKEON
• Pinocchio
• SWIFFT
• SIMECK
• SIMON
• SNARKs for C
• Grain
• GitHub
• Geppetto
• SPECK
• MiMC
• SWIFFTX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The block cipher companion.
• The complexity of evaluating interpolation polynomials
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Provable security against a differential attack
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Logic minimization techniques with applications to cryptology
• Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
• On the Distribution of Linear Biases: Three Instructive Examples
• LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations
• SPRING: Fast Pseudorandom Functions from Rounded Ring Products
• The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
• Ciphers for MPC and FHE
• MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
• On the complexity of solving bivariate systems
• Trivium
• SWIFFT: A Modest Proposal for FFT Hashing
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• The interpolation attack on block ciphers
• Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
• Higher-Order Masking Schemes for S-Boxes
• On the Indifferentiability of the Sponge Construction

This page was built for publication: MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity