Abstract
Determining the weight of Boolean functions is of exponential complexity. By using combinatorial results, it is proved that from their algebraic normal form (ANF), it is possible to have polynomial time results on the weight, for some classes of functions. As a result, the structure of the majority functions MAJ 2q-1 is given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New-York, 1968
Th. Beth, D. Jungnickel, H. Lenz, Design Theory, Cambridge University Press, Cambridge, 1986
A. Beutelspacher, Classical Geometries in CRC Handbook of Combinatorial Designs, C.J. Colbourn, J.H. Dinitz eds., CRC Press, 1996
P.J. Cameron, Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, 1996
C. Carlet, Partially Bent Functions, Designs, Codes and Cryptography, 3, 135–145, 1993
K. Chakrabarty, J.P. Hayes, Balanced Boolean Functions, IEE Proc.-Comput. Digit. Tech., Vol. 145,No. 1, January 1998
K. Chakrabarty, J.P. Hayes, Balance testing and balance-testable design of logic circuits, J. Electron. Testing: Theory Appl., 1996, 8, pp 81–86
K. Chakrabarty, J.P. Hayes, Cumulative balance testing of logic circuits, IEEE Trans. VLSI Syst., 1995, 3, pp 72–83
R.E. Blahut, Decoding of cyclic codes and codes on curves, in Handbook of Coding Theory, V.S. Pless and W.C. Huffman Editors, North-Holland, 1998
C.J. Colbourn, J.H. Dinitz eds. The CRC Handbook of Combinatorial Designs, CRC Press, 1996.
H. Dobbertin, Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity, Fast Software Encryption, 1994, Lecture Notes in Computer Sciences, Vol. 1008, Springer Verlag.
E. Filiol, C. Fontaine, Highly Nonlinear Balanced Boolean Functions with a good Correlation-Immunity, Advances in Cryptology-Eurocrypt’98, Vol 1403, Lecture Notes in Computer Science, Springer Verlag, 1998
P. Frankl, Extremal Set Systems, in Handbook of Combinatorics, R.L. Graham, M. Grötschel and L. Lovász (eds), Elsevier, 1995
J.W.P. Hirshfeld, Projective Geometries over Finite Fields, Oxford University Press, 1979
F.J. MacWilliams, N.J.A. Sloane. The Theory of Error-Correcting Codes, North-Holland Mathematical library, North-Holland, 1977.
B. Preenel, W.V. Leekwijck, L.V. Linden, R. Govaerts, J. Vandewalle, Propagation Characteristics of Boolean Functions, in Advances in Cryptology, Eurocrypt’90, vol 437, Springer Verlag, 1991
T. Siegenthaler, Correlation Immunity of Nonlinear Combining Functions for Cryptographic Applications, IEEE Transactions on Information Theory, Vol. IT30,N. 5, 1984, pp 776–780
J.A. Thas, Partial Geometries, in CRC Handbook of Combinatorial Designs, C.J. Colbourn, J.H. Dinitz eds., CRC Press, 1996
Y. Zeng, X.M. Zhang, H. Imai, Restriction, Terms and Nonlinearity of Boolean Functions, to appear in the Special Issue on Cryptography, Theoretical Computer Science, in honour of Professor Arto.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filiol⋆, E. (1999). Designs, Intersecting Families, and Weight of Boolean Functions. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive