Skip to main content

Secure Pseudo-Random Linear Binary Sequences Generators Based on Arithmetic Polynoms

Part of the Advances in Intelligent Systems and Computing book series (AISC,volume 342)


We present a new approach to construction of pseudo-random binary sequences (PRBS) generators for the purpose of cryptographic data protection, secured from the perpetrator’s attacks, caused by generation of masses of hardware errors and faults. The new method is based on the use of linear polynomial arithmetic for the realization of systems of boolean characteristic functions of pseudo-random sequences (PRS) generators. “Arithmetization” of systems of logic formulas has allowed to apply mathematical apparatus of residue systems for multisequencing of the process of PRS generation and organizing control of computing errors, caused by hardware faults. This has guaranteed high security of PRS generator’s functioning and, consequently, security of tools for cryptographic data protection based on those PRSs.


  • Cryptographic data protection
  • Pseudo-random binary sequences
  • Residue number systems

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions


  1. Forouzan, B.A.: Cryptography and Network Security. McGraw Hill (2008)

    Google Scholar 

  2. Schneier, B.: Applied Cryptography. Wiley, New York (1996)

    Google Scholar 

  3. Yang, B., Wu, K., Karri, R.: Scan based side channel attack on data encryption standard. Report 2004(324), 114–116 (2004)

    Google Scholar 

  4. Hetagurov, J.A., Prudnaya, Y.P.: Improving the reliability of digital devices redundant coding methods. Energiya, Moscow (1974)

    Google Scholar 

  5. Kelsey, J.: Protocol interactions and the chosen protocol attack. Security protocols. In: 5th International Workshop, pp. 91–104, Springer New York. (1996)

    Google Scholar 

  6. Ortega, J.M.: Introduction to Parallel & Vector Solution of Linear Systems. Plenum Press, New York (1988)

    CrossRef  MATH  Google Scholar 

  7. Shmerko, V.P.: Malyugin’s theorems: a new concept in logical control, VLSI design, and data structures for new technologies. Autom. Remote. Control. 65(6), 893–912 (2004). June

    CrossRef  MATH  MathSciNet  Google Scholar 

  8. Finko, O.A.: Large systems of boolean functions: realization by modular arithmetic methods. Autom. Remote. Control. 65(6), 871–892 (2004). June

    CrossRef  MathSciNet  Google Scholar 

  9. Garner, H.L.: Number systems and arithmetic. Adv. Comput. 6, 131–194 (1965)

    CrossRef  MATH  Google Scholar 

  10. Omondi, A., Premkumar, B.: Residue Number System: Theory and Implementation. Imperial College Press, London (2007)

    Google Scholar 

  11. Soderstrand, M.A., Jenkins, W.K., Jullien, G.A., Tailor, F.J.: Residue Number System Arithmetic: Modern Application in Digital Signal Processing. IEEE Press, New York (1986)

    Google Scholar 

  12. Jenkins, W.K.: The design of error checkers for self-checking residue number arithmetic. IEEE Trans. Comput. 4, 388–396 (1983)

    CrossRef  Google Scholar 

  13. Finko, O.A., Vishnevsky, A.K.: Parallel realization of systems of substitutions by numerical polynoms. In: Papers of the 5th International Conference Parallel Computing and Control Problems, pp. 935–943. Moscow (2010)

    Google Scholar 

  14. Finko, O.A., Vishnevsky, A.K.: Standard function hybrid cryptosystem arithmetic and logical multinomial realization. Theory and Techniques of Radio, pp. 32–38. Voronezh (2011)

    Google Scholar 

  15. Finko, O.A., Dichenko, S.A., Eliseev, N.I.: Error function generator binary PRS control implemented on arithmetic polynomials. St. Petersburg State Polytechnical University J. Comput. Sci. Telecommun. Control Syst. 176(4), 142–149 (2013)

    Google Scholar 

  16. Krasnobaev, V.A.: Reliable model in the computer residue number system. Electron. Model. 7(4), 44–46 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Oleg Finko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Finko, O., Dichenko, S. (2015). Secure Pseudo-Random Linear Binary Sequences Generators Based on Arithmetic Polynoms. In: Wiliński, A., Fray, I., Pejaś, J. (eds) Soft Computing in Computer and Information Science. Advances in Intelligent Systems and Computing, vol 342. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15146-5

  • Online ISBN: 978-3-319-15147-2

  • eBook Packages: EngineeringEngineering (R0)