MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
type: Item
instance of: scholarly article
title: MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
zbMATH Open document ID: 1404.94035
DOI: 10.1007/978-3-662-53887-6_7
author: Martin R. Albrecht
author: Lorenzo Grassi
author: Christian Rechberger
author: Arnab Roy
author: Tyge Tiessen
published in: Advances in Cryptology – ASIACRYPT 2016
publication date: 2017-02-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6679506
zbMATH Keywords: distributed cryptography
zbMATH Keywords: cryptanalysis
zbMATH Keywords: block ciphers
zbMATH Keywords: hash functions
zbMATH Keywords: zero knowledge
describes a project that uses: SNARKs for C
describes a project that uses: MiMC
describes a project that uses: Trivium
describes a project that uses: SWIFFT
describes a project that uses: SIMON
describes a project that uses: Grain
describes a project that uses: NOEKEON
describes a project that uses: Pinocchio
describes a project that uses: SIMECK
describes a project that uses: Geppetto
describes a project that uses: SWIFFTX
describes a project that uses: NTL
describes a project that uses: SPECK
describes a project that uses: GitHub
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2552640487
cites work: On the Distribution of Linear Biases: Three Instructive Examples
cites work: Q4228459
cites work: Ciphers for MPC and FHE
cites work: SPRING: Fast Pseudorandom Functions from Rounded Ring Products
cites work: On the Indifferentiability of the Sponge Construction
cites work: On the complexity of the \(F_5\) Gröbner basis algorithm
cites work: Q4693774
cites work: Logic minimization techniques with applications to cryptology
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers
cites work: Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
cites work: Higher-Order Masking Schemes for S-Boxes
cites work: Trivium
cites work: Q4536252
cites work: LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations
cites work: Q4364562
cites work: Q4279672
cites work: The interpolation attack on block ciphers
cites work: Montgomery multiplication in \(\text{GF}(2^ k)\)
cites work: Provable security against a differential attack
cites work: The block cipher companion.
cites work: SWIFFT: A Modest Proposal for FFT Hashing
cites work: On the complexity of solving bivariate systems
cites work: Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
cites work: Q4718481
cites work: Q4934708
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: The complexity of evaluating interpolation polynomials
description: scientific article; zbMATH DE number 6679506