Results 1 to 10 of about 582 (72)
Improved Attacks on LowMC with Algebraic Techniques [PDF]
IACR Transactions on Symmetric Cryptology, 2023 The LowMC family of SPN block cipher proposed by Albrecht et al. was designed specifically for MPC-/FHE-/ZKP-friendly use cases. It is especially used as the underlying block cipher of PICNIC, one of the alternate third-round candidate digital signature
Yimeng Sun, Jiamin Cui, Meiqin Wang
doaj +7 more sources
New Low-Memory Algebraic Attacks on LowMC in the Picnic Setting [PDF]
IACR Transactions on Symmetric Cryptology, 2022 The security of the post-quantum signature scheme Picnic is highly related to the difficulty of recovering the secret key of LowMC from a single plaintext-ciphertext pair.
Fukang Liu +3 more
doaj +6 more sources
Implementing Grover Oracles for Quantum Key Search on AES and LowMC [PDF]
Lecture Notes in Computer Science, 2020 Grover's 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$. Previous work in the specific case of AES derived the full gate cost by analyzing quantum circuits for the cipher ...
Samuel Jaques +2 more
exaly +7 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. Thus, LowMC has been designed to minimize the total quantity of logical “and” operations, as well as the “and” depth.
Christoph Dobraunig, Maria Eichlseder
exaly +5 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. A unique feature of LowMC is that its internal affine layers are chosen at random, and thus each block cipher family contains a ...
Willi Meier, Qingju Wang
exaly +6 more sources
Efficient FPGA Implementations of LowMC and Picnic [PDF]
Lecture Notes in Computer Science, 2020 Post-quantum cryptography has received increased attention in recent years, in particular, due to the standardization effort by NIST. One of the second-round candidates in the NIST post-quantum standardization project is Picnic, a post-quantum secure signature scheme based on efficient zero-knowledge proofs of knowledge.
Sebastian Ramacher
exaly +6 more sources
Effect of the difference enumeration attack on LowMC instances
网络与信息安全学报, 2021 The LowMC is an algorithm with low multiplicative complexities.For the parameter with limited data complexities and low number of S-boxes, the difference enumeration attack was proposed, which could theoretically attack all rounds of the LowMC ...
Xinxin GE, Zhihu LI, Meiqin WANG, Kai HU
doaj +5 more sources
Advances in Multimedia, 2022 To improve the effect of English translation teaching, this paper combines the differential evolution algorithm to construct and simulate the interactive English translation teaching mode and analyzes the differential enumeration attack.
Chi Che
doaj +2 more sources
Cryptanalysis of LowMC instances using single plaintext/ciphertext pair
IACR Transactions on Symmetric Cryptology, 2020 Arguably one of the main applications of the LowMC family ciphers is in the post-quantum signature scheme PICNIC. Although LowMC family ciphers have been studied from a cryptanalytic point of view before, none of these studies were directly concerned ...
Subhadeep Banik +3 more
doaj +5 more sources
New cryptanalysis of LowMC with algebraic techniques
Designs, Codes, and Cryptography, 2023 AbstractLowMC is a family of block ciphers proposed by Albrecht et al. at EUROCRYPT 2015, which is tailored specifically for FHE and MPC applications. At ToSC 2018, a difference enumeration attack was given for the cryptanalysis of low-data instances of full LowMCv2 with few applied S-boxes per round.
Hailun Yan
exaly +2 more sources