scientific article; zbMATH DE number 1866861
From MaRDI portal
Publication:4792292
zbMATH Open1021.94524MaRDI QIDQ4792292FDOQ4792292
Authors: Claude Carlet 
Publication date: 12 October 2003
Title of this publication is not available (Why is that?)
Recommendations
- On the Degree, Nonlinearity, Algebraic Thickness, and Nonnormality of Boolean Functions, With Developments on Symmetric Functions
- scientific article; zbMATH DE number 1543297
- Computer Aided Systems Theory – EUROCAST 2005
- On various nonlinearity measures for Boolean functions
- Boolean functions optimizing most of the cryptographic criteria
nonlinearityalgebraic degreebent functionsBoolean functionsnon-normalityalgebraic thicknesscryptographic applications
Cited In (29)
- Three parameters of Boolean functions related to their constancy on affine spaces
- On the confusion coefficient of Boolean functions
- On the nonlinearity of linear recurrence sequences
- Computer Aided Systems Theory – EUROCAST 2005
- Title not available (Why is that?)
- Cryptographic properties of monotone Boolean functions
- On various nonlinearity measures for Boolean functions
- Thickness distribution of Boolean functions in 4 and 5 variables and a comparison with other cryptographic properties
- Progress in Cryptology - INDOCRYPT 2004
- Asymptotic nonlinearity of vectorial Boolean functions
- Complexity theoretic aspects of some cryptographic functions
- Finding nonnormal bent functions
- Asymptotic nonlinearity of Boolean functions
- Normal Boolean functions
- Diameter Versus Certificate Complexity of Boolean Functions
- Construction of bent functions from near-bent functions
- On the Cryptographic Complexity of the Worst Functions
- Title not available (Why is that?)
- Constructive relationships between algebraic thickness and normality
- Probabilistic estimation of the algebraic degree of Boolean functions
- Multiplicative complexity of vector valued Boolean functions
- Title not available (Why is that?)
- Automata, Languages and Programming
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- A new measure to estimate pseudo-randomness of Boolean functions and relations with Gröbner bases
- Checking normality of Boolean functions
- Almost Security of Cryptographic Boolean Functions
- On the Degree, Nonlinearity, Algebraic Thickness, and Nonnormality of Boolean Functions, With Developments on Symmetric Functions
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4792292)
