Abstract
We study a class of quadratic p-ary functions \({{\mathcal{F}}_{p,n}}\) from \({\mathbb{F}_{p^n}}\) to \({\mathbb{F}_p, p \geq 2}\), which are well-known to have plateaued Walsh spectrum; i.e., for each \({b \in \mathbb{F}_{p^n}}\) the Walsh transform \({\hat{f}(b)}\) satisfies \({|\hat{f}(b)|^2 \in \{ 0, p^{(n+s)}\}}\) for some integer 0 ≤ s ≤ n − 1. For various types of integers n, we determine possible values of s, construct \({{\mathcal{F}}_{p,n}}\) with prescribed spectrum, and present enumeration results. Our work generalizes some of the earlier results, in characteristic two, of Khoo et. al. (Des Codes Cryptogr, 38, 279–295, 2006) and Charpin et al. (IEEE Trans Inf Theory 51, 4286–4298, 2005) on semi-bent functions, and of Fitzgerald (Finite Fields Appl 15, 69–81, 2009) on quadratic forms.
Similar content being viewed by others
References
Aly H., Marzouk R., Meidl W.: On the calculation of the linear complexity of periodic sequences, finite fields: theory and applications. Contemp. Math. 518, 11–22 (2010)
Carlet C., Mesnager S.: A note on Semi-bent Boolean functions. Cryptology ePrint Archive, Report no. 486 http://eprint.iacr.org/2010/486.
Çeşmelioğlu A., McGuire G., Meidl W.: A construction of weakly and non-weakly regular bent functions. J. Comb. Theory. Ser. A 119, 420–429 (2012)
Çeşmelioğlu A., Meidl W.: Bent functions of maximal degree. IEEE Trans. Inf. Theory 58, 1186–1190 (2012)
Charpin P., Pasalic E., Tavernier C.: On bent and semi-bent quadratic Boolean functions. IEEE Trans. Inf. Theory 51, 4286–4298 (2005)
Chen H.: A fast algorithm for determining the linear complexity of sequences over GF(p m) with period 2t n. IEEE Trans. Inf. Theory 51, 1845–1856 (2005)
Cusick T., Ding C., Renvall A.: Stream Ciphers and Number Theory. Elsevier, North Holland Mathematical Library (2004)
Ding C.: A fast algorithm for the determination of the linear complexity of sequences over GF(p m) with period p n. In: The Stability Theory of Stream Ciphers. Lecture Notes in Computer Science 651, Springer, Berlin (1991).
Fitzgerald R.W.: Highly degenerate forms over finite fields of characteristic 2. Finite Fields Appl. 11, 165–181 (2005)
Fitzgerald R.W.: Trace forms over finite fields of characteristic 2 with prescribed invariants. Finite Fields Appl. 15, 69–81 (2009)
Games R.A., Chan A.H.: A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Trans. Inf. Theory 29, 144–146 (1983)
Jungnickel D.: Finite Fields-Structure and Arithmetic. BI Wiss. Verlag Mannheim (1993).
Khoo K., Gong G., Stinson D.R.: A new family of Gold-like sequences. In: Proceedings of IEEE International Symposium of Information Theory, pp. 181 (2002).
Khoo K., Gong G., Stinson D.: A new characterization of semi-bent and bent functions on finite fields. Des. Codes Cryptogr. 38, 279–295 (2006)
Leander G., McGuire G.: Construction of bent functions from near-bent functions. J. Comb. Theory Ser. A 116, 960–970 (2009)
Lidl R., Niederreiter H.: Finite Fields, 2nd ed., Encyclopedia Math. Appl. Cambridge Univ. Press, Cambridge, vol. 20 (1997).
Massey J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15, 122–127 (1969)
Meidl W., Niederreiter H.: On the expected value of the linear complexity and the k-error linear complexity of periodic sequences. IEEE Trans. Inf. Theory 48, 2817–2825 (2002)
Meidl W.: Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games–Chan algorithm. Des. Codes Cryptogr. 45, 57–65 (2007)
Meyn H.: On the construction of irreducible self-reciprocal polynomials over finite fields. Appl. Algebra Eng. Comm. Comput. 1, 43–53 (1990)
Stichtenoth H., Topuzoğlu A.: Factorization of a class of polynomials over finite fields. Finite Fields Appl. 18, 108–122 (2011)
Xiao G., Wei S., Lam K.Y., Imamura K.: A fast algorithm for determining the linear complexity of a sequence with period p n over GF(q). IEEE Trans. Inf. Theory 46, 2203–2206 (2000)
Xiao G. Wei S.: Fast algorithms for determining the linear complexity of period sequences. In: Menezes A., Sarkar P. (eds.) Progress in Cryptology—INDOCRYPT 2002. Lecture Notes in Computer Science 2551, pp. 12–21. Springer, Berlin (2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.
This work was partially supported by TUBITAK project 111T234.
Rights and permissions
About this article
Cite this article
Meidl, W., Topuzoğlu, A. Quadratic functions with prescribed spectra. Des. Codes Cryptogr. 66, 257–273 (2013). https://doi.org/10.1007/s10623-012-9690-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-012-9690-6
Keywords
- Quadratic Boolean functions
- Quadratic p-ary functions
- Plateaued functions
- Semi-bent functions
- Self-reciprocal polynomials
- Linear complexity