Results 41 to 50 of about 126 (69)
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives *
, 2020 We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly ...
Steven Goldfeder Princeton +7 more
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
Security Evaluation of SP-Networks with Partial Non-Linear Layer against Differential Cryptanalysis
Метою роботи є дослiдження стiйкостi сучасних SP–мереж iз частковим нелiнiйним шаром до диференцiального криптоаналiзу. Об’єктом дослiдження виступають блоковi шифри, побудованi на основi SP–мереж.
Абкерiмов, Арсен Ленурович
core
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. 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 +2 more
exaly +4 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 ...
Itai Dinur, Yunwen Liu, Willi Meier
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 +2 more
exaly +5 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.
Daniel Kales +2 more
exaly +6 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 +2 more
exaly +4 more sources
Linear Equivalence of Block Ciphers with Partial Non-Linear Layers: Application to LowMC [PDF]
Lecture Notes in Computer Science, 2019 \(\textsc {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. \(\textsc {LowMC}\) is used in the \(\textsc {Picnic}\) signature scheme, submitted to NIST’s post-quantum standardization project and is a ...
Itai Dinur +2 more
exaly +3 more sources