Re: My attempt to break Rijndael (SAT-attack)

On Wed, 28 Feb 2007 01:06:35 +0100, Sebastian Gottschalk wrote:
Thorsten Kiefer wrote:

I added the clauses for the plaintext, ciphertext and all 128 clauses of the key.
It takes 24 seconds to solve this.
Then I remove the key-clauses and insert only 126 clauses of the key.
This takes 30 seconds to solve.
...
Then I remove the key-clauses and insert only 116 clauses of the key.
This takes 617 seconds to solve.

If you assume the formula a*b^n for the time complexity, then you can find:
time(n) = 24 * 1.2^n, where n is the number of missing key-clauses(/bits).

Or maybe you're just taken too few sample points. It should be b>=2.

Unfortunately my favorite SAT-solver is stochastic an therefore the time(n)-formula
is not totally reliable.

Is this more interesting now ?

No.

Hey, don't be so grumpy. It is, too, interesting. Keep at it, TK.

--
To email me, substitute nowhere->spamcop, invalid->net.
.

Relevant Pages