Login / Signup

A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in $\mathbb {F}_{2^n}$.

Sihem MesnagerKwang Ho KimDujin JoJunyop ChoeMunhyon HanDok Nam Lee
Published in: Des. Codes Cryptogr. (2020)
Keyphrases
  • lightweight
  • dos attacks
  • communication infrastructure
  • theorem prover
  • special case
  • development environments
  • wireless networks
  • floating point
  • block cipher