If I design a lightweight cryptographic algorithm, how do I calculate gate equivalents (GE)?

  • $\begingroup$ "If I design a lightweight algorithm" - If you do this, please don't use it in a production setting or to actually protect sensitive information. For an algorithm to be called "lightweight" it typically needs to have fewer gates than the current standard for that platform (AES?) $\endgroup$ – SEJPM Dec 8 '15 at 19:43
  • $\begingroup$ Thank you for your advice. And how do I calculate gates used in the algorithm ? $\endgroup$ – Sofyan Reza Ferianto Dec 11 '15 at 7:26
  • $\begingroup$ I'm not an expert on embedded / integrated circuits (and such stuff), but I'd guess you calculate the number of gates per round and multiply this with the number of rounds. And you get the number required for your round by examing each operation and finding out the required number of gates. $\endgroup$ – SEJPM Dec 11 '15 at 20:04
  • 1
    $\begingroup$ Please refer the link. Security for 1000 Gate Equivalents lightweightcrypto.org/present/present_cardis2008.pdf $\endgroup$ – GopiRaja Feb 20 '16 at 2:15
  • $\begingroup$ In short, a GE is the area of a 2-input NAND gate. For other gates, you use the relative area. $\endgroup$ – Aleph Feb 20 '16 at 9:13