Abstract
A Hadamard matrix is a square matrix with entries \(\pm 1\) whose rows are orthogonal to each other. Hadamard matrices appear in various fields including cryptography, coding theory, combinatorics etc. This study takes an interest in \(\gamma \) near Butson-Hadamard matrix that is a generalization of Hadamard matrices for \(\gamma \in {\mathbb R}\cap {\mathbb Z}[\zeta _m] \). These matrices are examined in this study. In particular, the unsolvability of certain equations is studied in the case of cyclotomic number fields. Winterhof et al. considered the equations for \(\gamma \in {\mathbb Z}\), and by the authors for \(\gamma \in {\mathbb R}\cap {\mathbb Z}[\zeta _m]\). In this study, we obtain another method for checking the nonexistence cases of these equations, which uses the tool of norm from algebraic number theory. Then, the direct applications of these results to \(\gamma \) near Butson-Hadamard matrices are obtained. In the second part of this study, the connection between nonlinear Boolean cryptographic functions and \(\gamma \) near Butson-Hadamard matrices having small \(|\gamma |\) is established. In addition, a computer search is done for checking the cases which are excluded by our results and for obtaining new examples of existence parameters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system I: the user language. J. Symbolic Comput. 24(3–4), 235–265 (1997). https://doi.org/10.1006/jsco.1996.0125. Computational Algebra and Number Theory (London, 1993)
Brock, B.W.: Hermitian congruence and the existence and completion of generalized Hadamard matrices. J. Comb. Theory Ser. A 49(2), 233–261 (1988)
Butson, A.: Generalized Hadamard matrices. Proc. Am. Math. Soc. 13(6), 894–898 (1962)
Colbourn, C.J., Dinitz, J.H.: Handbook of Combinatorial Designs. CRC Press, Boca Raton (2006)
Horadam, K.J.: Hadamard Matrices and Their Applications. Princeton University Press, Princeton (2007)
Kumar, P.V., Scholtz, R.A., Welch, L.R.: Generalized bent functions and their properties. J. Comb. Theory Ser. A 40(1), 90–107 (1985)
Kurt, S., Yayla, O.: Nearly perfect sequences and cryptographic functions. In: Workshop on Practical and Theoretical Aspects of Cryptography and Information Security, Tbilisi (2017)
de Launey, W.: On the nonexistence of generalised weighing matrices. Ars Comb. 17(A), 117–132 (1984)
Meier, W., Staffelbach, O.: Nonlinearity criteria for cryptographic functions. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 549–562. Springer, Heidelberg (1990). https://doi.org/10.1007/3-540-46885-4_53
Shannon, C.E.: A mathematical theory of cryptography. Memorandum MM 45–110–02 (1945)
Stewart, I., Tall, D.: Algebraic Number Theory and Fermat’s Last Theorem. CRC Press, Boca Raton (2015)
Washington, L.C.: Introduction to Cyclotomic Fields. Springer Science & Business Media, Heidelberg (1997). https://doi.org/10.1007/978-1-4612-1934-7
Winterhof, A., Yayla, O., Ziegler, V.: Non-existence of some nearly perfect sequences, near Butson-Hadamard matrices, and near conference matrices. arXiv preprint arXiv:1407.6548 (2014)
Acknowledgement
The authors are supported by the Scientific and Technological Research Council of Turkey (TÜBİTAK) under Project No: 116R026.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Kurt, S., Yayla, O. (2018). Near Butson-Hadamard Matrices and Nonlinear Boolean Functions. In: Kaczorowski, J., Pieprzyk, J., Pomykała, J. (eds) Number-Theoretic Methods in Cryptology. NuTMiC 2017. Lecture Notes in Computer Science(), vol 10737. Springer, Cham. https://doi.org/10.1007/978-3-319-76620-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-76620-1_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76619-5
Online ISBN: 978-3-319-76620-1
eBook Packages: Computer ScienceComputer Science (R0)