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?

  • $\begingroup$ Well, the Keccak permutation should be pretty unique and be somewhat easily identifiable... $\endgroup$ – SEJPM May 1 '18 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$ – WDS Nov 15 '18 at 1:44

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$ – Richie Frame May 1 '18 at 18:16

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.