Re: AES - finding bits of incomplete key
From: Michael Amling (nospam_at_nospam.com)
Date: 11/20/04
- Previous message: Amamba: "Re: Looking for a good program"
- In reply to: Kevin Drapel: "AES - finding bits of incomplete key"
- Next in thread: Kevin Drapel: "Re: AES - finding bits of incomplete key"
- Reply: Kevin Drapel: "Re: AES - finding bits of incomplete key"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 20 Nov 2004 20:56:14 GMT
Kevin Drapel wrote:
> Hello
>
> I have a question regarding AES (Rijndael) of 128 bits, this is a
> contest proposed in a cryptography course. Assume you have the plain
> text and the cipher text. You also have the *upper part* of the 128 bits
> key used to cipher the plain text. The least significant bits are
> missing (eg. 36 bits). I already implemented a complete brute-force
> attack and obviously, it works well but I'm wondering if knowing part of
> the key could help to design a better attack or quickly discard some
> impossible keys.
>
> Example with 36 missing bits :
>
> plaintext: 45081A3B23616B4302371D7025480C6B
> ciphertext: 99E451324E4AD54BE108FB457182C647
> key: 0153081D794369652A13687*********
If you find a method faster than brute force for completing a partial
key a plaintext/ciphertext pair, publish it. You'll be the first.
--Mike Amling
- Previous message: Amamba: "Re: Looking for a good program"
- In reply to: Kevin Drapel: "AES - finding bits of incomplete key"
- Next in thread: Kevin Drapel: "Re: AES - finding bits of incomplete key"
- Reply: Kevin Drapel: "Re: AES - finding bits of incomplete key"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|