Skip to main content

Secure Generators of q-Valued Pseudo-random Sequences on Arithmetic Polynomials

  • Conference paper
  • First Online:
  • 374 Accesses

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

Abstract

A technique for controlling errors in the functioning of nodes for the formation of q-valued pseudo-random sequences (PRS) operating under both random errors and errors generated through intentional attack by an attacker is provided, in which systems of characteristic equations are realized by arithmetic polynomials that allow the calculation process to be parallelized and, in turn, allow the use of redundant modular codes device.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

References

  1. Klein, A.: Stream Ciphers. Springer (2013). http://www.springer.com

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

    MATH  Google Scholar 

  3. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1987)

    MATH  Google Scholar 

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

    Google Scholar 

  5. Finko, O.A., Dichenko, S.A.: Secure pseudo-random linear binary sequences generators based on arithmetic polynoms. In: Advances in Intelligent Systems and Computing, Soft Computing in Computer and Information Science, vol. 342, pp. 279–290. Springer, Cham (2015)

    Google Scholar 

  6. Finko, O.A., Samoylenko, D.V., Dichenko, S.A., Eliseev, N.I.: Parallel generator of \(q\)-valued pseudorandom sequences based on arithmetic polynomials. Przeglad Elektrotechniczny 3, 24–27 (2015)

    Google Scholar 

  7. MacWilliams, F., Sloane, N.: Pseudo-random sequences and arrays. Proc. IEEE 64, 1715–1729 (1976)

    Article  MathSciNet  Google Scholar 

  8. Canovas, C., Clediere, J.: What do DES S-boxes say in differential side channel attacks? Report 2005(311), 191–200 (2005)

    Google Scholar 

  9. Carlier, V., Chabanne, H., Dottax, E.: Electromagnetic side channels of an FPGA implementation of AES. Report 2004(145), 111–124 (2004)

    Google Scholar 

  10. Page, D.: Partitioned cache architecture as a side-channel defence mechanism. Report 2005(280), 213–225 (2005)

    Google Scholar 

  11. Gutmann, P.: Software generation of random numbers for cryptographic purposes. In: Usenix Security Symposium, pp. 243–25. Usenix Association, Berkeley (1998)

    Google Scholar 

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

    Book  Google Scholar 

  13. Hamming, R.: Coding and Information Theory. Prentice-Hall, Upper Saddle River (1980)

    Google Scholar 

  14. Malyugin, V.D.: Representation of boolean functions as arithmetic polynomials. Autom. Remote Control 43(4), 496–504 (1982)

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  16. Finko, O.A.: Modular forms of systems of \(k\)-valued functions of the algebra of logic. Autom. Remote Control 66(7), 1081–1100 (2005)

    Google Scholar 

  17. Kukharev, G.A., Shmerko, V.P., Zaitseva, E.N.: Algorithms and Systolic Processors of Multivalued Data. Science and Technology, Minsk (1990). (in Russian)

    Google Scholar 

  18. Aslanova, N.H., Faradzhev, R.G.: Arithmetic representation of functions of many-valued logic and parallel algorithm for finding such a representation. Autom. Remote Control 53(2), 251–261 (1992)

    MathSciNet  MATH  Google Scholar 

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

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oleg Finko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Finko, O., Dichenko, S., Samoylenko, D. (2019). Secure Generators of q-Valued Pseudo-random Sequences on Arithmetic Polynomials. In: Pejaś, J., El Fray, I., Hyla, T., Kacprzyk, J. (eds) Advances in Soft and Hard Computing. ACS 2018. Advances in Intelligent Systems and Computing, vol 889. Springer, Cham. https://doi.org/10.1007/978-3-030-03314-9_26

Download citation

Publish with us

Policies and ethics