Results 51 to 60 of about 582 (72)

Digital Signatures from Symmetric-Key Primitives [PDF]

open access: yes, 2017
We propose practically efficient signature schemes which feature several attractive properties: (a) they only rely on the security of symmetric-key primitives (block ciphers, hash functions), and are therefore a viable candidate for post-quantum security,
Christian Rechberger   +4 more
core  

Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques [PDF]

open access: yesLecture 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, Takanori Isobe, Willi Meier
exaly   +4 more sources

Linear Equivalence of Block Ciphers with Partial Non-Linear Layers: Application to LowMC [PDF]

open access: yesLecture 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 ...
Sebastian Ramacher
exaly   +4 more sources

New Attacks on LowMC Instances with a Single Plaintext/Ciphertext Pair [PDF]

open access: yesLecture 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
exaly   +4 more sources

Lightweight Implementation of the LowMC Block Cipher Protected Against Side-Channel Attacks

Proceedings of the 4th ACM Workshop on Attacks and Solutions in Hardware Security, 2020
LowMC is a parameterizable block cipher developed for use in Multi-Party Computation (MPC) and Fully Homomorphic Encryption (FHE). In these applications, linear operations are much less expensive in terms of resource utilization compared to the non-linear operations due to their low multiplicative complexity.
Abubakr Abdulgadir   +2 more
exaly   +2 more sources

Improved Algebraic Attacks on Round-Reduced LowMC with Single-Data Complexity [PDF]

open access: yesLecture Notes in Computer Science
Recently, 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   +4 more sources

Home - About - Disclaimer - Privacy