Abstract
The linear complexity (Li) of PRS is the shortest shift register, which generates a given periodic sequence, provided that the first L values of the sequence are the initial filling of the register.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mao, W.: Modern cryptography. Theory and practice /Per. with English—M.: Izd, p. 768. Williams House (2005)
Yesin, V.I., Kuznetsov, O.O., Soroka, L.S.: Security of Information Systems and Technologies, p. 632. H.: KhNU. V.N. Karazina (2013)
Zadiraka, V., Oleksyk, O.: Computer Cryptology. Textbook, p. 502 (2002)
Anin, B.Yu.: Protection of Computer Information, c. 384. SPb, BKhV St. Petersburg (2000)
Alferov, A.P., Zubov A.Yu., Kuzmin A.S., Cheremushkin A.V.: Fundamentals of Cryptography, p. 480. Helios ARV (2005)
Gorbenko, I.D., Gorbenko, Y.I.: Applied Cryptology: Monograph, 1st and 2nd edn, p. 868. KNURE, Fort, Kharkiv (2012)
Gorbenko, I.D., Gorbenko, Y.I.: Applied Cryptology: Textbook, 1st and 2nd edn., p. 878. Kharkiv, KNURE, Fort (2012)
Orlova, S.Yu.: Methodology for evaluating the effectiveness of stream ciphers. In: Legal, Regulatory and Metrological Security Systems and Information Protection in Ukraine, vol. 9, pp. 141–152. Science and Technology Zbirnik (2004)
Berlekamp, E.R.: Algebraic Coding Theory, p. 447. McGrawHill, NY (1968)
McWilliams, F.J.: The Theory of ErrorCorrecting Codes, p. 762. F.J. McWilliams, N.J. Sloane, NorthHolland (1978)
Zakharov, I.D., Zhiganov, A.A.: The use of generating polynomials of m-sequences in the construction of pseudo-random code scales. Izv. Univ. Instrum. Making 54(6), 49–55 (2011)
Karazin, V.N., Kuznetsov, O.O., Malakhov, S.V.: Research of flow symmetric ciphers and flow modes of block symmetric ciphers: report on GDR (intermediate), code “Stream”. Analysis and comparative studies of modern algorithms for streaming cryptocurrency, p. 233. V.N. Karazina, KhNU (2015)
NIST Special Publication 80022. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. [Electronic resourse]. Access mode: http://csrc.nist.gov/publications/nistpubs/80022rev1a/SP80022rev1a.pdf
Morozov, V.V., Murashko, I.A.: Calculation of phase shifts of the M sequence. [Electronic resource] (2011). http://libeldoc.bsuir.by/bitstream/123456789/3338/1/CalculationofphaseshiftoftheMsequence.PDF. Date of beast 10 Jul 2016
Borisenko, N.P., Gusarov, A.V., Krivonos, A.P.: On the possibility of generating primitive polynomials of a given degree and quick calculation of the shift of the output RSLOS sequence by a given number of ticks. In: Proceedings of the XII Internal and Scientific Conference on Informatization and Information Security of Law Enforcement Systems, pp. 334–339 (2003).
Kuznetsov, A.A., Mordvinov, R.I., Kolovanova, E.P., Samoilova, A.V.: Methods of statistical testing of cryptographic algorithms. In: Special Telecommunication Systems and Information Security, vol. 1, no. 25, pp. 54–61. Kyiv (2014)
Karazin, V.N., Kuznetsov, O.O., Malakhov, S.V.: Research of flow symmetric ciphers and flow modes of block symmetric ciphers: GDR report (final), stream code “Stream”, vol. 2. Development of proposals for the project of the algorithm of stream symmetric encryption and substantiation of its properties, p. 73. V.N. Karazina, KhNU (2015)
Kuznetsov, O.O., Lutsenko, M.S., Andrushkevich, A.V., Melkozerova, O.M., Novikova, D.V., Loban, A.V.: Statistical research of modern streaming ciphers. In: Applied Radio Electronics, vol. 15, no. 3, pp. 167–178. KhNURE, Kharkiv (2016)
Koopman, P.: Maximal Length LFSR Feedback Terms. [Electronic resource]. Access mode: https://users.ece.cmu.edu/~koopman/lfsr/
Pseudo Random Number Generation Using Linear Feedback Shift Registers. [Electronic resource] (2010). https://www.maximintegrated.com/en/appnotes/index.mvp/id/4400. Access date 07 Oct 2016
Mukhachev, V.A., Khoroshko, V.A.: Methods of Practical Cryptography, p. 215. Polygraph Consulting LLC (2005)
Gorodilova, A.A.: From cryptoanalysis of a cipher to a cryptographic property of a Boolean function. Appl. Discrete Math. 3(33), 16–44 (2016)
Pankratova, I.A.: Boolean Functions in Cryptography: Textbook Allowance, p. 88. Publishing House of Tomsk State University, Tomsk (2014)
Tokareva, N.N.: Generalizations of bent functions. Work review. Discrete Anal. Oper. Res. 17(1), 33–62 (2010)
Tokareva, N.N.: Nonlinear Boolean Functions: Bent Functions and Their Generalizations, 180 s. LAP LAMBERT Academic Publishing, Saarbrucken, Germany (2011). ISBN: 9783843309042
Agafonova, I.V.: Cryptographic properties of nonlinear Boolean functions. In: Discrete Seminar, Harmonious, Analysis and Geometer Modeling, pp. 1–24. DHA & CAGD, St. Petersburg (2007)
Shevelev, Yu.P.: Discrete Math. Part 1: Set Theory. In: Boolean Algebra (Automated Learning Technology “Symbol”): Textbook, p. 118. Tomsk state CNT of Control Systems and Radio Electronics (2003)
Moldovyan, A.A.: Cryptography. Speed Ciphers, p. 496. BHV Peterburg (2002)
Logachev, O.A., Salnikov, A.A., Smyshlyaev, S.V., Yashchenko, V.V.: Boolean Functions in Coding Theory and Cryptology, 2nd edn, p. 584. MCCNMO (2012)
Smyshlyaev, S.V.: On cryptographic weaknesses of some classes of binary sequence transformations. Appl. Discrete Math. 1, 5–15 (2010)
Tarannikov, Yu.V.: On correlation-immune and stable Boolean functions. Math. Problems Cybernet. Fizmatlit 11, 91–148 (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Kuznetsov, A.A., Potii, O.V., Poluyanenko, N.A., Gorbenko, Y.I., Kryvinska, N. (2022). Research of Second-Order Properties of NLFSR. Comparative Analysis of M-NLFSR and M-LFSR. In: Stream Ciphers in Modern Real-time IT Systems. Studies in Systems, Decision and Control, vol 375. Springer, Cham. https://doi.org/10.1007/978-3-030-79770-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-79770-6_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-79769-0
Online ISBN: 978-3-030-79770-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)