Skip to content

Back to the catalog

Optimal Threshold Implementations of all bijective 4-bit S-boxes and new Infinite Families
eprint.iacr.orgpaper

Optimal Threshold Implementations of all bijective 4-bit S-boxes and new Infinite Families

ePrint paper presenting share-optimal, direct, uniform, first-order threshold implementations (TIs) with no fresh randomness. It shows every bijective 4-bit permutation of algebraic degree t admits a TI with t+1 shares, and introduces the first infinite families of cryptographically nontrivial power permutations with optimal TIs. The results disprove several earlier conjectures and give new glitch-resistant masking options for lightweight cipher S-boxes.

TL;DR Every 4-bit bijective S-box of degree t gets a uniform, randomness-free (t+1)-share threshold implementation, plus new infinite optimal TI families for power permutations.
Open original ↗

Techniques named here

  • Threshold implementations
  • Optimal TI for bijective 4-bit S-boxes

Related in Hardware & RF