Re: Modification on AES
- From: McDohl <mcdohl@xxxxxxxxxxxxxx>
- Date: Sat, 26 Dec 2009 18:44:11 GMT
On Fri, 25 Dec 2009 20:45:01 -0800, J.D. wrote:
That is true. But in addition to the s-box not being invertible/
decryptable if it is not a permutation, any n-by-n s-box that is not a
permutation will necessarily have some entries that are duplicates of
each other, opening the door to collision attacks.
Thanks. I didn't know that. After the s-box is generated, cycle through
the bytes, checking if they were used before. If they were, increase by 1
until an unused value is found.
--
"The beginning of knowledge is the discovery of something we do not
understand."-Frank Herbert
.
- Follow-Ups:
- Re: Modification on AES
- From: J.D.
- Re: Modification on AES
- References:
- Modification on AES
- From: McDohl
- Re: Modification on AES
- From: McDohl
- Re: Modification on AES
- From: J.D.
- Modification on AES
- Prev by Date: Re: Appendix-C. A Worked Example. - Scalable Key Cryptography.
- Next by Date: Re: Modification on AES
- Previous by thread: Re: Modification on AES
- Next by thread: Re: Modification on AES
- Index(es):
Relevant Pages
|