Results 31 to 40 of about 171 (59)
Neural Leakage–based Cryptanalysis of LowMC with Linear Complexity
MPC-in-the-Head protocols enable post-quantum digital signatures based solely on symmetric primitives, with PICNIC being a prominent example built on the LowMC block cipher.
Kwangjo Kim
core
Quantum Implementation of the SAND Algorithm and Its Quantum Resource Estimation for Brute-Force Attack. [PDF]
Entropy (Basel)Wu H, Feng X, Zhang J.
europepmc +1 more source
Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques [PDF]
Lecture Notes in Computer Science, 2021 In this paper, we revisit the difference enumeration technique for LowMC and develop new algebraic techniques to achieve efficient key-recovery attacks.
Takanori Isobe, Fukang Liu
exaly +6 more sources
Optimized Interpolation Attacks on LowMC [PDF]
Lecture Notes in Computer Science, 2015 LowMC is a collection of block cipher families introduced at Eurocrypt 2015 by Albrecht et al. Its design is optimized for instantiations of multi-party computation, fully homomorphic encryption, and zero-knowledge proofs.
Yunwen Liu, Qingju Wang, Willi Meier
exaly +8 more sources
Higher-Order Cryptanalysis of LowMC [PDF]
Lecture Notes in Computer Science, 2016 LowMC is a family of block ciphers developed particularly for use in multi-party computations and fully homomorphic encryption schemes, where the main performance penalty comes from non-linear operations.
Christoph Dobraunig, Maria Eichlseder
exaly +7 more sources
New Attacks on LowMC Instances with a Single Plaintext/Ciphertext Pair [PDF]
Lecture Notes in Computer Science, 2021 Cryptanalysis of the LowMC block cipher when the attacker has access to a single known plaintext/ciphertext pair is a mathematically challenging problem.
Subhadeep Banik, Serge Vaudenay
exaly +6 more sources
Linear Equivalence of Block Ciphers with Partial Non-Linear Layers: Application to LowMC [PDF]
Lecture Notes in Computer Science, 2019 LowMC is a block cipher family designed in 2015 by Albrecht et al. It is optimized for practical instantiations of multi-party computation, fully homomorphic encryption, and zero-knowledge proofs.
Christian Rechberger +2 more
exaly +5 more sources
Improved Algebraic Attacks on Round-Reduced LowMC with Single-Data Complexity [PDF]
Lecture Notes in Computer ScienceRecently, Picnic3 has introduced several alternative LowMC instances, which prompts the cryptanalysis competition for LowMC. In this paper, we provide new solutions to the competition with full S-box layers under single-data complexity. First, we present
Yongqiang Li
exaly +5 more sources