Products of linear recurring sequences with maximum complexity
IEEE Transactions on Information Theory
Propagation characteristics of Boolean functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On cryptographic propagation criteria for Boolean functions
Information and Computation
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
On Propagation Characteristics of Resilient Functions
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Fast Correlation Attacks Based on Turbo Code Techniques
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
On Correlation-Immune Functions
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Differential Cryptanalysis of the Full 16-Round DES
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
On Relationships among Avalanche, Nonlinearity, and Correlation Immunity
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
More correlation-immune and resilient functions over Galois fields and Galois rings
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Design of SAC/PC(l) of order k boolean functions and three other cryptographic criteria
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Propagation characteristics and correlation-immunity of highly nonlinear boolean functions
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Cryptographically resilient functions
IEEE Transactions on Information Theory
On cryptographic properties of the cosets of R(1, m)
IEEE Transactions on Information Theory
Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions
Finite Fields and Their Applications
On the iterative construction of bent functions
ISP'06 Proceedings of the 5th WSEAS International Conference on Information Security and Privacy
A new iterative method to construct bent functions
ISP'06 Proceedings of the 5th WSEAS International Conference on Information Security and Privacy
A characterization of bent functions on n + 1 variables
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
A general formulation of algebraic and fast correlation attacks based on dedicated sample decimation
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
| Hi-index | 0.00 |
By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These new definitions result in a better understanding of the properties of Boolean functions and provide a better insight in the space defined by this metric. This approach leads to the construction of “hand-made” Boolean functions, i.e., functions for which the security with respect to some specific monotone sets of inputs is considered, instead of the security with respect to all possible monotone sets with the same cardinality, as in the usual definitions. This approach has the advantage that some trade-offs between important properties of Boolean functions can be relaxed.