Results 11 to 20 of about 6,764 (215)
Multiset-Algebraic Cryptanalysis of Reduced Kuznyechik, Khazad, and secret SPNs
We devise the first closed formula for the number of rounds of a blockcipher with secret components so that these components can be revealed using multiset, algebraic-degree, or division-integral properties, which in this case are equivalent.
Alex Biryukov +2 more
doaj +4 more sources
Cryptanalysis of Algebraic Verifiable Delay Functions
Verifiable Delay Functions (VDF) are a class of cryptographic primitives aiming to guarantee a minimum computation time, even for an adversary with massive parallel computational power. They are useful in blockchain protocols, and several practical candidates have been proposed based on exponentiation in a large finite field: Sloth++, Veedo, MinRoot ...
Alex Biryukov +6 more
openalex +3 more sources
Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis [PDF]
In this paper we describe a class of cryptographic guess-and-determine attacks which is based on the notion of a linearizing set. A linearizing set-based attack is applied to a system of Multivariate Quadratic equations (MQ) over $GF(2)$ field, which ...
Alexander Semenov +3 more
doaj +2 more sources
Algebraic Cryptanalysis of 58-Round SHA-1 [PDF]
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article is to sophisticate and improve Wang’s attack by using algebraic techniques. We introduce new notions, namely semi-neutral bit and adjuster and propose then an improved message modification technique based on algebraic techniques.
Makoto Sugita +3 more
openalex +2 more sources
Formal Power Series on Algebraic Cryptanalysis [PDF]
In the complexity estimation for an attack that reduces a cryptosystem to solving a system of polynomial equations, the degree of regularity and an upper bound of the first fall degree are often used in cryptanalysis. While the degree of regularity can be easily computed using a univariate formal power series under the semi-regularity assumption ...
Shuhei Nakamura
openalex +3 more sources
Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes [PDF]
We give a polynomial time attack on the McEliece public key cryptosystem based on subcodes of algebraic geometry (AG) codes. The proposed attack reposes on the distinguishability of such codes from random codes using the Schur product.
Couvreur, Alain +2 more
core +5 more sources
Methods to solve algebraic equations in cryptanalysis [PDF]
ABSTRACT The goal of the present paper is a survey of methods to solve equation systems common in cryptanalysis. The methods depend on the equation representation and fall into three categories: Gröbner basis algorithms, SAT-solving methods and Agreeing-Gluing algorithms.
Igor Semaev, Michal Mikuš
openalex +2 more sources
Algebraic Techniques in Differential Cryptanalysis Revisited [PDF]
At FSE 2009, Albrecht et al. proposed a new cryptanalytic method that combines algebraic and differential cryptanalysis. They introduced three new attacks, namely Attack A, Attack B and Attack C. For Attack A, they explain that the time complexity is difficult to determine.
Meiqin Wang +3 more
openalex +3 more sources
Cryptanalysis of RSA Using Algebraic and Lattice Methods
This paper applies tools from the geometry of numbers to solve several problems in cryptanalysis. We use algebraic techniques to cryptanalyze several public key cryptosystems. This paper focuses on RSA and RSA-like schemes, and use tools from the theory of integer lattices to get our results.
Faisal Amir Harahap +3 more
openalex +3 more sources
Algebraic Cryptanalysis of Block Ciphers
Rustem Biyashev +3 more
openalex +2 more sources

