An optimal universal construction for the threshold implementation of bijective S-boxes

DOI10.1109/TIT.2023.3287534MaRDI QIDQ6575000zbMATH OpenFDO

Authors Enrico Piccione, Samuele Andreoli, Lilya Budaghyan, Claude Carlet, Siemen Dhooghe, Svetla Nikova, George Petrides, Vincent Rijmen

Publication date 19 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2023.3287534

zbMATH Keywords

threshold implementation

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited in

(2)

• On decompositions of permutations in quadratic functions
• Non-complete set coverings for higher order threshold implementations

This page was built for publication: An optimal universal construction for the threshold implementation of bijective S-boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575000)