Look I know AES256 is ridiculously secure but to keep aes secure even after quantum computers, I have a concern.
Using the Grovers theorem aes can be reduced from 256 to 128 bits for brute force attack which is also pretty strong but I don't want to be limited to it
Is it (atleast in theory) possible to implement aes512, aes1024, etc...
I mean what's stopping us like for 128bit aes we use 10 rounds of shuffling, for 192, 12 rounds and for 256, 14 rounds
Then a general rule can be said that for every 64 bits after 128 we increase the shuffling count by 2 and adding initial 10 at 128
By this rule we can say that aes512 the shuffling rounds will be 22 rounds then why has no one has ever did it?
Asked
Active
Viewed 63 times
1
Ashwin
- 11
- 3