MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
From MaRDI portal
Recommendations
Cites work
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Ciphers for MPC and FHE
- Higher-order masking schemes for S-boxes
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 503336 (Why is no real title available?)
- scientific article; zbMATH DE number 1088245 (Why is no real title available?)
- scientific article; zbMATH DE number 1759315 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- Logic minimization techniques with applications to cryptology
- LS-designs: bitslice encryption for efficient masked software implementations
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Montgomery multiplication in \(\text{GF}(2^ k)\)
- On the complexity of solving bivariate systems
- On the complexity of the \(F_5\) Gröbner basis algorithm
- On the Distribution of Linear Biases: Three Instructive Examples
- On the Indifferentiability of the Sponge Construction
- Provable security against a differential attack
- Snarks for C: verifying program executions succinctly and in zero knowledge
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products
- Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression
- SWIFFT: A Modest Proposal for FFT Hashing
- The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
- The block cipher companion.
- The complexity of evaluating interpolation polynomials
- The interpolation attack on block ciphers
- Towards stream ciphers for efficient FHE with low-noise ciphertexts
- Trivium
Cited in
(89)- Rasta: a cipher with low ANDdepth and few ANDs per bit
- \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
- The \(t\)-wise independence of substitution-permutation networks
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- Feistel structures for MPC, and more
- Algebraic cryptanalysis of STARK-friendly designs: application to MARVELlous and MiMC
- 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
- Ciphers for MPC and FHE
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Compact privacy protocols from post-quantum and timed classical assumptions
- 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
- 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
- Faster secure multi-party computation of AES and DES using lookup tables
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- Linear cryptanalysis and its variants with fast Fourier transformation technique on MPC/FHE/ZK-friendly \(\mathbb{F}_p\)-based ciphers
- The Welch-Gong stream cipher -- evolutionary path
- A lower bound for differential uniformity by multiplicative complexity \& bijective functions of multiplicative complexity 1 over finite fields
- Anonymous counting tokens
- Generic security of the SAFE API and its applications
- Algebraic-differential attacks on a family of arithmetization-oriented symmetric ciphers
- Algebraic attacks on round-reduced \textsc{Rain} and full \textsf{AIM-III}
- Security analysis of P-SPN schemes against invariant subspace attack with inactive S-boxes
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Concurrently secure blind Schnorr signatures
- Generalized Feistel ciphers for efficient prime field masking
- The algebraic FreeLunch: efficient Gröbner basis attacks against arithmetization-oriented primitives
- Constraint-friendly map-to-elliptic-curve-group relations and their applications
- Integral cryptanalysis in characteristic p
- Exponential sums in linear cryptanalysis
- Link between the differential cryptanalysis and linear approximations over finite abelian groups and its applications
- Security analysis of the P-SPN structure with a class of linear layer matrix against invariant subspace attack
- A degree bound for the c-boomerang uniformity of permutation monomials
- Generalized indifferentiable sponge and its application to Polygon Miden VM
- \textsf{Polocolo}: a ZK-friendly hash function based on S-boxes using power residues
- Gröbner basis cryptanalysis of Anemoi
- A new security evaluation method based on resultant for arithmetic-oriented algorithms
- Modelling ciphers with overdefined systems of quadratic equations: application to Friday, Vision, RAIN and Biscuit
- Minimize the randomness in Rasta-like designs: how far can we go? Application to \textsc{Pasta}
- A univariate attack against the limited-data instance of Ciminion
- Generalized triangular dynamical system: an algebraic system for constructing cryptographic permutations over finite fields
- Arithmetization-oriented APN permutations
- The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications
- Research on nonlinear invariants of a power function over a binary field
- A Fiat-Shamir transformation from duplex sponges
- Tracking algebraic degree with exponent sets: higher-order differential attacks on FHE-friendly cipher \({\mathsf{Yu}_2\mathsf{X}}\)
- The XHash family for ZK-friendly hash functions
- DuX: a block cipher for efficient FHE evaluation
- Pairwise independence of AES-like block ciphers
- Leveraging smaller finite fields for more efficient ZK-friendly hash functions
- Amortizing Circuit-PSI in the multiple sender/receiver setting
- A degree bound for the c-boomerang uniformity
- Low-data cryptanalysis of LowMC instances with full S-box layers
- Batched \& non-interactive blind signatures from lattices
- Interstellar: efficient GKR-based IVC scheme with privacy-preserving collaborative folding
- Interpolation cryptanalysis of unbalanced Feistel networks with low degree round functions
Describes a project that uses
Uses Software
This page was built for publication: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958119)
