New attacks on LowMC using partial sets in the single-data setting

DOI10.62056/AYZOJBKRZMaRDI QIDQ7318571zbMATH OpenFDO

Authors Subhadeep Banik, Andrea Caforio, Serge Vaudenay

Publication date 25 August 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AYZOJBKRZ

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Cites work

• Advances in cryptology -- ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6--10, 2021. Proceedings. Part I
• An improved algebraic attack on Hamsi-256
• Beating brute force for systems of polynomial equations over finite fields
• Ciphers for MPC and FHE
• Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
• Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
• New attacks on LowMC instances with a single plaintext/ciphertext pair

Cited in

(1)

• Low-data cryptanalysis of LowMC instances with full S-box layers

This page was built for publication: New attacks on LowMC using partial sets in the single-data setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318571)