Questions tagged [algebraic-attack]
An algebraic attack is a method of cryptanalysis against a cipher 1)expressing the cipher operations as a system of equations. 2)substituting in known data for some of the variables. 3)solving for the key.
10
questions
15
votes
4
answers
3k
views
Generate ANF from SBox
Given an SBox, how can I generate its component equations (in ANF)?
For example, let's say I have this SBox:
6, 4, 7, 8, 0, 5, 2, 10, 14, 3, 13, 1, 12, 15, 9, 11
Then, the equations are:
$y_0 = x_1 ...
- 603
25
votes
4
answers
7k
views
How Brittle Are LCG-Cracking Techniques?
There are published techniques for cracking LCGs, but to my eye those techniques seem very brittle — very minor changes can add nonlinearity that renders techniques like the LLL algorithm unusable. ...
- 526
4
votes
2
answers
1k
views
What is linearization attack
I know that
In cryptography, the linearization attack is a method of cryptanalysis
for block ciphers
I am looking for an example of linearization attack couldn't find it online
Could anyone ...
Sachin Yadav
11
votes
2
answers
1k
views
Evaluating Algebraic Complexity of a S-box
While studying the design and the desirable properties of an AES S-box , I came to know that Algebraic Complexity is also an important property of an S-box which is usually considered while evaluating ...
- 111
7
votes
1
answer
827
views
Is SHA-1 still practically secure under specific scenarios?
It is conjectured that SHA-1 has been broken from the "research" perspective, but not in the real world; that is, there exists an algebraic attack that explores weaknesses on its algebraic ...
- 6,160
4
votes
1
answer
4k
views
Attack on DSA with signatures made with k, k+1, k+2
For homework, I'm asked to find the private key, $x$, in a DSA digital signature scheme. In the particular instance, we are given the parameters $p$, $q$ and $g$, the public key $g^x$, 3 messages $(...
- 449
4
votes
2
answers
307
views
(Impossibility of?) Associative Pseudorandom Permutation
I'm not sure whether this had been a long-standing open problem in cryptography.
Definition
An associative pseudorandom permutation $f(k,m)$ is a permutation such that:
$f(k_1, f(k_2, m)) = f(f(...
- 9,207
8
votes
1
answer
7k
views
Small subgroup confinement attack on Diffie-Hellman
I am trying to understand the small subgroup confinement attack on the Diffie-Hellman algorithm. I will present the attack and try to explain why it works.
Small subgroup confinement attack on the ...
- 2,836
1
vote
0
answers
108
views
Symbolic computation in finite fields [closed]
What I want to know is how to perform symbolic finite field computations in SAGE math? Such computations are required in building algebraic models for cryptanalysis. To explain this mathematically ...
- 141
1
vote
1
answer
166
views
Derive $x$ when given $g,g^x$ and $g^{(1/x)}$?
If an adversary has access to the generator g of a group G and is given access to $g^{x}$ and $g^{(1/x)}$, will it make it any easier to derive the value of $x$ compared to when he had access to only $...
- 113