I need to analyse a binary code and check if Keccak is used in this code. I can identify AES, by using Rijndael S-box. Is there a similiar box for Keccak?
2
-
$\begingroup$ Well, the Keccak permutation should be pretty unique and be somewhat easily identifiable... $\endgroup$– SEJPMCommented May 1, 2018 at 11:22
-
$\begingroup$ The most distinct thing about Keccak internally that I have seen is the A XOR (!B & C) function immediately prior to XOR with the round constant. It does not have substitution boxes like AES, and it is not ARX either, though it is similar to the latter. Be careful searching AES by substitution box. Other algorithms now borrow the AES S-Boxes and could yield false positives. $\endgroup$– WDSCommented Nov 15, 2018 at 1:44
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
1
I just found the "round constants" which hopefully are sufficiently unique to allow identification of the algorithm.
-
1$\begingroup$ the constants in a 32-bit implementation may not be the same as the reference code $\endgroup$ Commented May 1, 2018 at 18:16