Transparency order for Boolean functions: analysis and construction
From MaRDI portal
Publication:2324785
DOI10.1007/s10623-019-00604-1zbMath1419.94051OpenAlexW2909901102WikidataQ128685097 ScholiaQ128685097MaRDI QIDQ2324785
Qichun Wang, Pantelimon Stănică
Publication date: 12 September 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00604-1
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Exponential sums (11T23)
Related Items
On characterization of transparency order for \((n, m)\)-functions ⋮ Transparency order of \((n, m)\)-functions -- its further characterization and applications ⋮ Results on the Gowers U2 Norm of Generalized Boolean Functions ⋮ Further research results on confusion coefficient of Boolean functions ⋮ On the confusion coefficient of Boolean functions ⋮ A note on the signal-to-noise ratio of \((n, m)\)-functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptographic properties of the hidden weighted bit function
- Redefining the transparency order
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- Rotation symmetric Boolean functions-count and cryptographic properties
- Maximal values of generalized algebraic immunity
- Decomposed S-boxes and DPA attacks: a quantitative case study using PRINCE
- Differential Power Analysis in Hamming Weight Model: How to Choose among (Extended) Affine Equivalent S-boxes
- Confused by Confusion: Systematic Evaluation of DPA Resistance of Various S-boxes
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- Construction of Rotation Symmetric S-Boxes with High Nonlinearity and Improved DPA Resistivity
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Symmetric Boolean Functions
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- A Statistical Model for DPA with Novel Algorithmic Confusion Analysis
- Power Analysis Attacks
- A Classification of the Cosets of the Reed-Muller Code R (1, 6)
- DPA Resilience of Rotation-Symmetric S-boxes
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- On the Classification of Boolean Functions by the General Linear and Affine Groups
- Differential Power Analysis of Stream Ciphers
- On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks
- Fast Software Encryption
- Fast Software Encryption
