Skip to main content
Springer Nature Link
Log in

Software implementation of parallel matrix computations for linear recurrent sequence and numerical methods for estimating its efficiency

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

This paper presents a method for increasing efficiency of evaluation of a pseudorandom sequence generated by a linear feedback shift register (LFSR). To enable parallel calculation of several values of the pseudorandom sequence, the LFSR feedback function is given by a system of linear recurrence equations. A formalized algorithm based on matrix multiplication is proposed for finding coefficients of the system of linear recurrence equations and for calculating values of the pseudorandom sequence. Depending on the bit capacity of the processor, optimal implementation conditions for the proposed method are established.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Sizonenko, A.B., Parallel schemotechnic realization of linear recurrent shift register, Proektir. Tekhnol. Elektron. Sredstv, 2012, no. 2, pp. 43–47.

    Google Scholar 

  2. Fomichev, V.M., Diskretnaya matematika i kriptologiya: Kurs lektsii, (Discrete Mathematics and Cryptology: Course of Lectures), Podufalov, N.D., Ed., Moscow: Dialog-MIFI, 2003.

  3. Shnaier, B., Prikladnaya kriptografiya. Protokoly, algoritmy, iskhodnye teksty na yazyke Si (Applied Cryptography. Protocols, Algorithms, Initial Texts on SI Language), Moscow: TRIUMF, 2003.

    Google Scholar 

  4. Sizonenko, A.B., Model of linear recurrence of the shift register for a parallel implementation on graphic processors, Inform. Sist. Tekhnol., 2013, no. 4, pp. 145–151.

    Google Scholar 

  5. Lidl, R. and Niderraiter, G., Konechnye polya. Vol. 1, 2 (Finite Fields,), 2nd. Ed., Cambridge: Cambridge Univ., 1997; Moscow: Mir, 1998, Vol. 1, 2.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krasnodar University of Ministry of Internal Affairs of Russia, ul. Yaroslavskaya 128, Krasnodar, 350005, Russia

    A. B. Sizonenko

  2. Voronezh Institute of Ministry of Internal Affairs of Russia, pr. Patriotov 53, Voronezh, 394065, Russia

    V. V. Men’shikh

Authors
  1. A. B. Sizonenko
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. V. V. Men’shikh
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to A. B. Sizonenko.

Additional information

Original Russian Text © A.B. Sizonenko, V.V. Men’shikh, 2015, published in Avtomatika i Vychislitel’naya Tekhnika, 2015, No. 2, pp. 16–24.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sizonenko, A.B., Men’shikh, V.V. Software implementation of parallel matrix computations for linear recurrent sequence and numerical methods for estimating its efficiency. Aut. Control Comp. Sci. 49, 76–81 (2015). https://doi.org/10.3103/S0146411615020066

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411615020066

Keywords