Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method

References

[1] Alferov A.P., Zubov A.Yu., Kuz’min A.S., Cheremushkin A.S.Foundations of Cryptography, M.: Gelios ARV, 2001 (in Russian), 480 pp.Search in Google Scholar

[2] Rueppel R.A., Analysis and design of stream ciphers, Springer-Verlag, Belrin, 1986, 244 pp.10.1007/978-3-642-82865-2Search in Google Scholar

[3] Korobov N.M., “Distribution of nonresidues and primitive roots in recursive series”, Dokl. Akad. Nauk SSSR, 88:4 (1953), 603-606 (in Russian).Search in Google Scholar

[4] Nechaev V. I., “Distribution of signs in a sequence of rectangular matrices over a finite field”, Proc. Steklov Inst. Math., 218 (1997), 332-339.Search in Google Scholar

[5] Niederreiter H., “Distribution properties of feedback shift register sequences”, Probl. Control and Inform. Theory, 15:1 (1986), 19-34.Search in Google Scholar

[6] Shparlinskiy I.E., “On distribution of values of recurrence sequences”, Problems Inform. Transmission, 25:2 (1989), 120-125.Search in Google Scholar

[7] Sidel’nikov V.M., “Estimates for the number of appearances of elements on an interval of a recurrent sequence over a finite field”, Discrete Math. Appl., 2:5 (1992), 473-481.10.1515/dma.1992.2.5.473Search in Google Scholar

[8] Kamlovskiy O. V., “The number of appearences of elements in output sequences of filter generators”, Prikladnaya diskr. matematika, 2013, №(21), 11-25 (in Russian).10.17223/20710410/21/2Search in Google Scholar

[9] Kumar P.V., Helleseth T., Calderbank A.R., “An upper bound for Weil exponential sums over Galois rings and applications”, IEEE Trans. Inform. Theory, 41:2 (1995), 456-468.10.1109/18.370147Search in Google Scholar

[10] Shanbhag A.G., Kumar P.V., Helleseth T., “Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences”, IEEE Trans. Inform. Theory, 42:1 (1996), 250-254.10.1109/18.481796Search in Google Scholar

[11] Kamlovskiy O. V., Kuzmin A. S., “Bounds for the number of appearances of elements in linear reccurrent sequences over Galois rings”, Fundam. i prikl. matematika, 6:4 (2000), 1083-1094 (in Russian).Search in Google Scholar

[12] Kamlovskiy O. V., “Frequency characteristics of linear recurrence sequences over Galois rings”, Sb. Math., 200:4 (2009), 499-519.10.1070/SM2009v200n04ABEH004006Search in Google Scholar

[13] Fan S., Han W., “Random properties of the highest level sequences of primitive sequences over ℤ_2^l”, IEEE Trans. Inf. Theory, 49:6 (2003), 1553-1557.10.1109/TIT.2003.811916Search in Google Scholar

[14] Lahtonen J., Ling S., Sole P., Zinoviev D., “ℤ₈-Kerdock codes and pseudorandom binary sequences”, J. Complexity, 20:8 (2004), 318-330.10.1016/j.jco.2003.08.014Search in Google Scholar

[15] Sole P., Zinoviev D., “Distribution of r-patterns in the most significant bit of a maximum length sequence over ℤ_2^l”, Lect. Notes Comput. Sci., 3486 (2005), 275-281.10.1007/11423461_20Search in Google Scholar

[16] Hu H., Feng D., Wu W., “Incomplete exponential sums over Galois rings with applications to some binary sequences derived from ℤ_2^l”, IEEE Trans. Inf. Theory, 52:5 (2006), 2260-2265.10.1109/TIT.2006.872850Search in Google Scholar

[17] Sole P., Zinoviev D. The most significant bit of maximum-length sequences over ℤ_2^l: autocorrelation and imbalance. IEEE Trans. Inf. Theory. V. 50. № 8. 2006. P. 1844-184610.1109/TIT.2004.831858Search in Google Scholar

[18] Kamlovskiy O. V., “The method of trigonometric sums for investigating the frequencies of r-grams in higher coordinate sequences of linear recurrences over ring ℤ_2ⁿ”, Matematicheskie Voprosy Kriptografii, 1:4 (2010), 33-62 (in Russian).Search in Google Scholar

[19] Lidl R., Niederreiter H., “Finite fields”, Encyclopedia of Mathematics and its Applications, 20, Addison-Wesley, 1987, 755 pp.10.1017/CBO9780511525926Search in Google Scholar

[20] Solodovnikov V. I., “Bent functions from a finite abelian group into a finite abelian group”, Discrete Math. Appl., 12:2 (2002), 111-126.10.1515/dma-2002-0203Search in Google Scholar

[21] Glukhov M.M., Elizarov V.P., Nechaev A.A., Algebra: Textbook. Vol. 2, M.: Gelios ARV, 2003 (in Russian), 416 pp.Search in Google Scholar

[22] Logachev O.A., Sal’nikov A.A., Yashchenko V.V., Boolean functions in the coding theory and cryptology, M.: MCCME, 2004 (in Russian), 470 pp.Search in Google Scholar

[23] Golomb S.W., Gong G., Signal design for good correlation, New York, 2005, 438 pp.10.1017/CBO9780511546907Search in Google Scholar

[24] Nechaev A. A., “Kerdock code in a cyclic form”, Discrete Math. Appl., 1:4 (1991), 365-384.10.1515/dma.1991.1.4.365Search in Google Scholar

[25] McDonald B.R., Finite rings with identity, Dekker, New York, 1974, 429 pp.Search in Google Scholar

[26] Nechaev A. A., “Cycle types of linear substitutions over finite commutative rings”, Russian Acad. Sci. Sb. Math., 78:2 (1994), 283-311.10.1070/SM1994v078n02ABEH003470Search in Google Scholar

[27] Kamlovskiy O. V., “Frequency characteristics of coordinate sequences of linear recurrences over Galois rings”, Izv. Math., 77:6 (2013), 1130-1154.10.1070/IM2013v077n06ABEH002672Search in Google Scholar