Results 1 to 10 of about 1,747,196 (183)
Algebraic Collision Attacks on Keccak
In this paper, we analyze the collision resistance of the two smallest versions of Keccak which have a width of 200 and 400 bits respectively. We show that algebraic and linearization techniques can serve collision cryptanalysis by using some interesting
Rachelle Heim Boissier +2 more
doaj +5 more sources
Improved Attacks on LowMC with Algebraic Techniques
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 +4 more sources
Algebraic Attacks against Some Arithmetization-Oriented Primitives
Recent advanced Zero-Knowledge protocols, along with other high-level constructions such as Multi-Party Computations (MPC), have highlighted the need for a new type of symmetric primitives that are not optimized for speed on the usual platforms (desktop
Augustin Bariant +3 more
doaj +2 more sources
A White-Box Masking Scheme Resisting Computational and Algebraic Attacks
White-box cryptography attempts to protect cryptographic secrets in pure software implementations. Due to their high utility, white-box cryptosystems (WBC) are deployed by the industry even though the security of these constructions is not well defined ...
Okan Seker +2 more
doaj +2 more sources
Algebraic Attacks on RAIN and AIM Using Equivalent Representations
Designing novel symmetric-key primitives for advanced protocols like secure multiparty computation (MPC), fully homomorphic encryption (FHE) and zero-knowledge proof systems (ZK), has been an important research topic in recent years.
Fukang Liu +3 more
doaj +2 more sources
New Low-Memory Algebraic Attacks on LowMC in the Picnic Setting
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 +4 more sources
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks [PDF]
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in $\mathcal{O}(D^2)$ operations, for $D ...
Frederik Armknecht +2 more
exaly +4 more sources
Algebraic Attacks on RFID Protocols [PDF]
This work aims to identify the algebraic problems which enable many attacks on RFID protocols. Toward this goal, three emerging types of attacks on RFID protocols, concerning authentication, untraceability, and secrecy are discussed. We demonstrate the types of attacks by exhibiting previously unpublished vulnerabilities in several protocols and ...
Ton Van Deursen +2 more
exaly +5 more sources
Algebraic method to recover superpolies in cube attacks
Cube attacks are an important type of key recovery attacks against nonlinear feedback shift register (NFSR)-based cryptosystems. The key step in cube attacks closely related to key recovery is recovering superpolies. However, in the previous cube attacks
Tian Tian
exaly +2 more sources
Protecting Obfuscation against Algebraic Attacks [PDF]
Recently, Garg, Gentry, Halevi, Raykova, Sahai, and Waters (FOCS 2013) constructed a general-purpose obfuscating compiler for NC1 circuits. We describe a simplified variant of this compiler, and prove that it is a virtual black box obfuscator in a generic multilinear map model.
Boaz Barak +4 more
openaire +3 more sources

