Results 11 to 20 of about 126 (69)
Algebraic Meet-in-the-Middle Attack on LowMC [PDF]
, 2022 By exploiting the feature of partial nonlinear layers, we propose a new technique called algebraic meet-in-the-middle (MITM) attack to analyze the security of LowMC, which can reduce the memory complexity of the simple difference enumeration attack over ...
Fukang Liu +4 more
openaire +3 more sources
Efficient implementation of LowMC in HElib [PDF]
, 2018 LowMC is a symmetric block cipher designed for fully homomorphic encryption. This thesis focuses on Martin Albrecht’s implementation of the cipher in the FHE library HElib, and how his implementation can be improved when encrypting a single plaintext.
Francis, Isabel Thevahi
openaire +3 more sources
New Attacks on LowMC Using Partial Sets in the Single-Data Setting [PDF]
IACR Communications in CryptologyThe LowMC family of block ciphers was proposed by Albrecht et al. in Eurocrypt 2015, specifically targeting adoption in FHE and MPC applications due to its low multiplicative complexity. The construction operates a 3-bit quadratic S-box as the sole non-linear transformation in the algorithm.
Subhadeep Banik +2 more
openaire +2 more sources
Memory-Efficient Single Data-Complexity Attacks on LowMC Using Partial Sets. [PDF]
IACR Cryptol. ePrint Arch., 2022 The LowMC family of block ciphers was first proposed by Albrecht et al. in [ARS+15], specifically targeting adoption in FHE and MPC applications due to its low multiplicative complexity.
Subhadeep Banik +3 more
openaire +2 more sources
Improving MPCitH with Preprocessing: Mask Is All You Need
Transactions on Cryptographic Hardware and Embedded SystemsThe MPC-in-the-head with preprocessing (MPCitH-PP) paradigm presents a novel approach for constructing post-quantum digital signatures like Picnic3.
Guowei Liu +6 more
doaj +3 more sources
One More Pair, More Information Gained: Improved Attacks on LowMC with Full S-box Layers Using Two Plaintext/Ciphertext Pairs. [PDF]
IACR Cryptol. ePrint Arch.Motivated by LowMC cryptanalysis challenge, research in recent years focuses more on attacking LowMC in \PICNIC application setting, \ie an attacker can see only a single plaintext/ciphertext pair.
Yimeng Sun +5 more
openaire +2 more sources
Low-Memory Algebraic Attacks on Round-Reduced LowMC [PDF]
, 2021 With the proposal of Picnic3, it has become interesting to investigate the security of LowMC with a full S-box layer. To significantly improve the efficiency of the Picnic signature, the designers of Picnic3 recommended to use the 4-round LowMC as the ...
Fukang Liu, Takanori Isobe, Willi Meier
core
Improved Quantum Analysis of SPECK and LowMC (Full Version) [PDF]
, 2023 As the prevalence of quantum computing is growing in leaps and bounds over the past few years, there is an ever-growing need to analyze the symmetric-key ciphers against the upcoming threat.
Hwajeong Seo +4 more
core
Implementing Grover oracles for quantum key search on AES and LowMC [PDF]
, 2023 Grover\u27s search algorithm gives a quantum attack against block ciphers by searching for a key that matches a small number of plaintext-ciphertext pairs. This attack uses $O(\sqrt{N})$ calls to the cipher to search a key space of size $N$.
Samuel Jaques +3 more
core
Improvements to the Linear Operations of LowMC: A Faster Picnic [PDF]
, 2019 Picnic is a practical approach to digital signatures where the security is primarily based on the existence of a one-way function, and the signature size strongly depends on the number of multiplications in the circuit describing that one-way function ...
Léo Perrin +4 more
core