Characterizing the upper bound on the transparency order of (n, m)-functions

DOI10.1515/JMC-2023-0040MaRDI QIDQ6606844FDOQ6606844

Authors: Y. Zhou, You Wu, Bing Shen, Jinbo Wang, Rong Cheng 

Publication date: 17 September 2024

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Recommendations

• On characterization of transparency order for \((n, m)\)-functions
• Transparency order of \((n, m)\)-functions -- its further characterization and applications
• Transparency order for Boolean functions: analysis and construction
• Redefining the transparency order
• A note on the signal-to-noise ratio of \((n, m)\)-functions

zbMATH Keywords

transparency orderredefined transparency order\((n, m)\)-functionsmodified transparency order

Mathematics Subject Classification ID

Cryptography (94A60) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Cites Work

• Title not available (Why is that?)
• On ``bent functions
• Highly Nonlinear Balanced S-Boxes With Good Differential Properties
• Fast Software Encryption
• Redefining the transparency order
• On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks
• Transparency order for Boolean functions: analysis and construction
• On characterization of transparency order for \((n, m)\)-functions

This page was built for publication: Characterizing the upper bound on the transparency order of \((n, m)\)-functions

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