Paper 2026/1351

Hardware Private Cubic Circuits

Frederik Reiter, Technische Universität Darmstadt
Amir Moradi, Technische Universität Darmstadt
Abstract

Cryptographic hardware implementations often leak secret information through side channels. This can allow attackers to learn secret data, such as a cryptographic key, without any vulnerability in the cryptographic algorithm itself. A popular countermeasure to such attacks is masking, which ensures that processed data is independent of the secrets by splitting them into multiple independent shares, often at the cost of significant overhead in terms of required area, latency, and randomness. The composable PINI notion in the glitch-extended probing model ensures some degree of security against such side-channel analysis attacks, and guarantees that the circuit may be arbitrarily composed with other PINI circuits while maintaining the same security level. This allows for the secure implementation of arbitrary circuits using trivial composition, replacing elementary gates with "gadgets" realizing the same functionality in a PINI-secure manner. Up to now, PINI gadgets at arbitrary security order are limited to quadratic functions, i.e., 2-input gates, with the best known as HPC3.X realizing a 2-input multiplier in one clock cycle. In this work, we present HPCC, the first low-latency 3-input multiplication gadget for arbitrary fields that maintains a constant latency of one cycle, independent of the number of shares. HPCC additionally allows for the computation of any number of multiplications in a single cycle with relatively little overhead when two of the three operands are identical. When instantiated with two shares and for $\mathbb{F}_2$, HPCC halves the previous record for lowest number of fresh masks required at comparable area cost. With more shares, HPCC is the only single-cycle gadget realizing 3-input multiplications in arbitrary fields. We leverage HPCC to implement the first composable AES S-Box with two cycles of latency with an arbitrary number of shares. This S-Box design significantly outperforms the previous record in terms of area and randomness when instantiated with three shares and stands as the only two-cycle solution for more shares.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published by the IACR in TCHES 2026
Keywords
Side Channel AnalysisMaskingHardwarePINICubicHPC
Contact author(s)
frederik reiter @ wihi tu-darmstadt de
amir moradi @ tu-darmstadt de
History
2026-07-12: revised
2026-07-01: received
See all versions
Short URL
https://ia.cr/2026/1351
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/1351,
      author = {Frederik Reiter and Amir Moradi},
      title = {Hardware Private Cubic Circuits},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1351},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1351}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.