Results 1 to 10 of about 560 (65)
Improved Attacks on LowMC with Algebraic Techniques [PDF]
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]
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
Effect of the difference enumeration attack on LowMC instances
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
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
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
Implementing Grover Oracles for Quantum Key Search on AES and LowMC [PDF]
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 ...
Jaques, Samuel +3 more
openaire +5 more sources
MRHS solver based on linear algebra and exhaustive search [PDF]
We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks.
Raddum Håvard, Zajac Pavol
doaj +2 more sources
Higher-Order Cryptanalysis of LowMC [PDF]
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 +2 more
openaire +4 more sources
Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques [PDF]
In this paper, we revisit the difference enumeration technique for LowMC and develop new algebraic techniques to achieve efficient key-recovery attacks. In the original difference enumeration attack framework, an inevitable step is to precompute and store a set of intermediate state differences for efficient checking via the binary search.
Fukang Liu, Takanori Isobe, Willi Meier
openaire +3 more sources
Efficient FPGA Implementations of LowMC and Picnic [PDF]
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.
Daniel Kales +4 more
openaire +5 more sources

