Thanks for getting me thinking. While my CTF problem ended up being a CBC-based encryption algorithm and I needed a bit-flipping attack, this got the head-gears turning properly to reach that solution. Probably the best explanation of an ECB attack I could find, very well laid out.
6:37 Why first block is "aabcdefghijklmno", instead of "aabcdefghijklmn"? If size of cipher changed, when I added "o", does not it mean, that "o" is in the second block?
🔂🔂🔂 So.. did you watch the other video or not?? 🔂🔂🔂
Thanks for getting me thinking. While my CTF problem ended up being a CBC-based encryption algorithm and I needed a bit-flipping attack, this got the head-gears turning properly to reach that solution.
Probably the best explanation of an ECB attack I could find, very well laid out.
Awesome, nice work!
Thank you for your very clear explanations!
No worries, keep coming back!
fantastic explanation, thanks
Glad it was helpful!
6:37 Why first block is "aabcdefghijklmno", instead of "aabcdefghijklmn"? If size of cipher changed, when I added "o", does not it mean, that "o" is in the second block?
With the padding scheme, you always need to have padding. If the input is the size of a block, the last block will just be full of padding bytes.
@@247CTF Weird, it's wasting of memory :D
Without it, how can you know if you're removing padding or data :)
When do I need to remove something?
With padding mode you always need to remove something. Between 1 and 16 bytes.
Thanks for explanation, my challenger made it double encrypted, so now i have 10 trillion tries to bruteforce the plain
Damn, did you solve it?