Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
The structured design of cryptographically good s-boxes
Journal of Cryptology
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Constructions of bent functions and difference sets
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Propagation characteristics of Boolean functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Rotation-Symmetric Functions and Fast Hashing
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
Highly Nonlinear 0-1 Balanced Boolean Functions Satisfying Strict Avalanche Criterion
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
| Hi-index | 0.00 |
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function's class. We exhaustively searched for all boolean functions on V6. We found two interesting classes of degree 3 homogeneous boolean functions: the first class is degree 3 homogeneous bent boolean functions; and the second is degree 3 homogeneous balanced boolean functions. Both the bent and balanced functions discovered have nice algebraic and combinatorial structures. We note that some structures can be extended to a large boolean space. The application of homogeneous boolean functions for fast implementation on parallel architectures is mooted.