Twitter | Pretraživanje | |
Dаvіd Вucһаnаn 27. pro
I implemented AES128 in 69 bytes of x86 assembly. (from challenge 0). Can anyone beat that? :P
Reply Retweet Označi sa "sviđa mi se"
Dаvіd Вucһаnаn 27. pro
Odgovor korisniku/ci @David3141593
(for the pedantic: yes, this assumes bit 7 of AL is 0)
Reply Retweet Označi sa "sviđa mi se"
Dаvіd Вucһаnаn 27. pro
Odgovor korisniku/ci @David3141593
For anyone saying "uSinG aEs-Ni iS cHeAtInG": a) AESKEYGENASSIST only supports round constants as immediate arguments, so every other implementation I saw unrolls the key expansion loop. b) I tricked a lot of smart CTF players into thinking this was a non-standard AES impl :P
Reply Retweet Označi sa "sviđa mi se"
Dаvіd Вucһаnаn
c) Explain the round loop exit condition. d) Make the code smaller :P (I think this is possible, the shuffling stage was kinda optimised for obscurity rather than size)
Reply Retweet Označi sa "sviđa mi se" More
Dаvіd Вucһаnаn 27. pro
Odgovor korisniku/ci @David3141593
Reply Retweet Označi sa "sviđa mi se"
Benjamin Vernoux 27. pro
Odgovor korisniku/ci @David3141593
Could you post the source / exe / bin somewhere (github, gitlab...) (Yes I'm lazy to extract it from your picture and it is more interesting with whole code/challenge) ? I'm interested to check if can disassemble it correctly and how it look like in decompiled C view
Reply Retweet Označi sa "sviđa mi se"