Higher-Order Cryptanalysis of LowMC

DOI10.1007/978-3-319-30840-1_6zbMath1384.94056OpenAlexW2485873601MaRDI QIDQ2806764

Christoph Dobraunig, Maria Eichlseder, Florian Mendel

Publication date: 19 May 2016

Published in: Information Security and Cryptology - ICISC 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30840-1_6

zbMATH Keywords

cryptanalysiskey recoveryLowMCzero-sum distinguisherhigher-order cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

Cryptanalysis of full LowMC and LowMC-M with algebraic techniques ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Algebraic meet-in-the-middle attack on LowMC ⋮ Algebraic attacks on Rasta and Dasta using low-degree equations ⋮ New attacks on LowMC instances with a single plaintext/ciphertext pair ⋮ Transciphering framework for approximate homomorphic encryption ⋮ An algebraic attack on ciphers with low-degree round functions: application to full MiMC ⋮ New cryptanalysis of LowMC with algebraic techniques ⋮ Improved Rebound Attacks on AESQ: Core Permutation of CAESAR Candidate PAEQ ⋮ Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ Mind the middle layer: the HADES design strategy revisited ⋮ The inverse of \(\chi\) and its applications to Rasta-like ciphers ⋮ The MALICIOUS framework: embedding backdoors into tweakable block ciphers ⋮ 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

This page was built for publication: Higher-Order Cryptanalysis of LowMC