Skip to main content
Cryptography

Return to Question

Tweeted twitter.com/StackCrypto/status/1116128876642672640
link corrected
Source Link
kelalaka
kelalaka
  • 49.5k
  • 12
  • 118
  • 205

I'm trying to understand [Understanding brute force][1]Understanding brute force by Bernstein. I couldn't understand how the described machine can brute force the AES.

The attacker builds a very small key-search circuit. The key-search circuit has three inputs: a 12-byte string $\beta$, a 4-byte integer $n$, and a 16-byte string $s$. The key-search circuit has one output: a 16-byte string $Z(\beta, n, s)$ defined recursively by $Z(\beta, 0, s) = s$ and $Z(\beta, n + 1, s) = Z(\beta, n, H(s \oplus (\beta, n))$.

[1]https://cr.yp.to/snuffle/bruteforce-20050425.pdf

I'm trying to understand [Understanding brute force][1] by Bernstein. I couldn't understand how the described machine can brute force the AES.

The attacker builds a very small key-search circuit. The key-search circuit has three inputs: a 12-byte string $\beta$, a 4-byte integer $n$, and a 16-byte string $s$. The key-search circuit has one output: a 16-byte string $Z(\beta, n, s)$ defined recursively by $Z(\beta, 0, s) = s$ and $Z(\beta, n + 1, s) = Z(\beta, n, H(s \oplus (\beta, n))$.

[1]https://cr.yp.to/snuffle/bruteforce-20050425.pdf

I'm trying to understand Understanding brute force by Bernstein. I couldn't understand how the described machine can brute force the AES.

The attacker builds a very small key-search circuit. The key-search circuit has three inputs: a 12-byte string $\beta$, a 4-byte integer $n$, and a 16-byte string $s$. The key-search circuit has one output: a 16-byte string $Z(\beta, n, s)$ defined recursively by $Z(\beta, 0, s) = s$ and $Z(\beta, n + 1, s) = Z(\beta, n, H(s \oplus (\beta, n))$.

deleted 4 characters in body
Source Link
Yunus Karakaya
Yunus Karakaya
  • 286
  • 1
  • 8

I'm trying to understand Understanding brute force[Understanding brute force][1] by Bernstein. I couldn't understand how the described machine can brute force the AES.

The attacker builds a very small key-search circuit. The key-search circuit has three inputs: a 12-byte string $\beta$, a 4-byte integer $n$, and a 16-byte string $s$. The key-search circuit has one output: a 16-byte string $Z(\beta, n, s)$ defined recursively by $Z(\beta, 0, s) = s$ and $Z(\beta, n + 1, s) = Z(\beta, n, H(s \oplus (\beta, n))$.

[1]https://cr.yp.to/snuffle/bruteforce-20050425.pdf

I'm trying to understand Understanding brute force by Bernstein. I couldn't understand how the described machine can brute force the AES.

The attacker builds a very small key-search circuit. The key-search circuit has three inputs: a 12-byte string $\beta$, a 4-byte integer $n$, and a 16-byte string $s$. The key-search circuit has one output: a 16-byte string $Z(\beta, n, s)$ defined recursively by $Z(\beta, 0, s) = s$ and $Z(\beta, n + 1, s) = Z(\beta, n, H(s \oplus (\beta, n))$.

I'm trying to understand [Understanding brute force][1] by Bernstein. I couldn't understand how the described machine can brute force the AES.

The attacker builds a very small key-search circuit. The key-search circuit has three inputs: a 12-byte string $\beta$, a 4-byte integer $n$, and a 16-byte string $s$. The key-search circuit has one output: a 16-byte string $Z(\beta, n, s)$ defined recursively by $Z(\beta, 0, s) = s$ and $Z(\beta, n + 1, s) = Z(\beta, n, H(s \oplus (\beta, n))$.

[1]https://cr.yp.to/snuffle/bruteforce-20050425.pdf

Source Link
Yunus Karakaya
Yunus Karakaya
  • 286
  • 1
  • 8

The small key-search circuit for brute-force of Bernstein

I'm trying to understand Understanding brute force by Bernstein. I couldn't understand how the described machine can brute force the AES.

The attacker builds a very small key-search circuit. The key-search circuit has three inputs: a 12-byte string $\beta$, a 4-byte integer $n$, and a 16-byte string $s$. The key-search circuit has one output: a 16-byte string $Z(\beta, n, s)$ defined recursively by $Z(\beta, 0, s) = s$ and $Z(\beta, n + 1, s) = Z(\beta, n, H(s \oplus (\beta, n))$.