The inventors of the AES Rijndael state that there are no 'linear' mathematical relations between plaintext and the corresponding ciphertext when passed through Rijndael. How can you prove this statement? What is the process to prove or disprove the presence of a mathematical relation between a pair of plaintext and ciphertext of any cryptographic algorithm?
Yes as stated by Peter above the cipher text is obtained from plain text and vice-versa.
There are Keys(Mathematical Transformation) which do the job. Rijndael AES is block cipher based scheme where block size could be 128,192 or 256 bits. It is most secure because for 128 bits it can generate 2^ 128 (10^38) keys and to break it one has to try all possible keys. I feel you mean to say this that so many keys related plain text to break it which seems impractical today.
Dr. Peter Breuer is right. Let me rephrase: the claim is that there is no 'linear' mathematical relation between plaintext and the corresponding ciphertext.
I've made the modification in the question too.
Why is it so? How to prove it?
- Badges
- Science topic
- Similar topics
- Mathematics