aes on Aditya Telangehttps://adityatelange.in/tags/aes/Recent content in aes on Aditya TelangeAditya Telangehttps://adityatelange.in/assets/tn.jpghttps://adityatelange.in/assets/tn.jpgHugo -- 0.122.0en2020 - 2024 Aditya TelangeFri, 20 May 2022 00:00:00 +0530Cryptohack - Keyed Permutations [5 pts]https://adityatelange.in/writeups/cryptohack/aes/keyed-permutations/Fri, 20 May 2022 00:00:00 +0530https://adityatelange.in/writeups/cryptohack/aes/keyed-permutations/The Solution is shared considering CAN I SHARE MY SOLUTIONS?
Problem AES, like all good block ciphers, performs a “keyed permutation”. This means that it maps every possible input block to a unique output block, with a key determining which permutation to perform.
A “block” just refers to a fixed number of bits or bytes, which may represent any kind of data. AES processes a block and outputs another block.Cryptohack - Resisting Bruteforce [10 pts]https://adityatelange.in/writeups/cryptohack/aes/resisting-bruteforce/Fri, 20 May 2022 00:00:00 +0530https://adityatelange.in/writeups/cryptohack/aes/resisting-bruteforce/The Solution is shared considering CAN I SHARE MY SOLUTIONS?
Problem If a block cipher is secure, there should be no way for an attacker to distinguish the output of AES from a random permutation of bits. Furthermore, there should be no better way to undo the permutation than simply bruteforcing every possible key. That’s why academics consider a cipher theoretically “broken” if they can find an attack that takes fewer steps to perform than bruteforcing the key, even if that attack is practically infeasible.