Skip to main content

Pseudorandom Bit Generator with Parallel Implementation

  • Conference paper
  • First Online:
Large-Scale Scientific Computing (LSSC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8353))

Included in the following conference series:

  • 1294 Accesses

Abstract

In this work we present a new filtering variant of pseudorandom bit generation which combines a 2-adic Feedback with Carry Shift Register and the Editing bit-search generator, based on I. Erguler and E. Anarim research. The generated algorithm uses dynamic blocks for data encryption. Shrinking the block is necessary if low memory is available. The algorithm divides the data block among the cores (the processors) and every core encrypts part of the data file. We show the advantage of using parallel implementation. The experimental statistical results establish the time difference of performance on serial and parallel encryption.

The security of the generated bit streams are proven by using NIST, DIEHARD and ENT testing systems.

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

Access this chapter

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

Institutional subscriptions

References

  1. Al Jabri, A.: Shrinking generators and statistical leakage. Comput. Math. Appl. 32(4), 33–39 (1996)

    Article  MATH  Google Scholar 

  2. Arnault, F., Berger, T.P.: F-FCSR: design of a new class of stream ciphers. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 83–97. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Arnault, F., Berger, T.P., Lauradoux, C., Minier, M.: X-FCSR – a new software oriented stream cipher based upon FCSRs. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 341–350. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Erguler, I., Anarim, E.: The editing bit-search generator. In: National Cryptology Symposium II, pp. 154–165, Ankara (2006)

    Google Scholar 

  5. Golomb, S.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1982)

    Google Scholar 

  6. Gouget, A., Sibert, H.: The bit-search generator. In: The State of the Art of Stream Cipher: Workshop Record, pp. 60–68 (2004)

    Google Scholar 

  7. Gouget, A., Sibert, H., Berbain, C., Courtois, N.T., Debraize, B., Mitchell, C.: Analysis of the bit-search generator and sequence compression techniques. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 196–214. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Karthikeyan, S., Sairam, N., Manikandan, G., Sivaguru, J.: A parallel approach for improving data security. J. Theor. Appl. Inf. Technol. 39(2), 119–125 (2012)

    Google Scholar 

  9. Klapper, A.: Feedback with carry shift register over finite fields. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 170–178. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  10. Klapper, A.: On the existence of secure feedback registers. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 256–267. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  11. Klapper, A., Goresky, M.: Feedback Shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10(2), 111–147 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lauradoux, C., Röck, A.: Parallel generation of \(\ell \)-sequences. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds.) SETA 2008. LNCS, vol. 5203, pp. 299–312. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Liu, J., Song, D., Xu, Y.: A parallel encryption algorithm for dual-core processor based on chaotic map. In: Zeng, Z., Li, Y. (eds.) ICMV 2011. Proceedings of SPIE 8350, pp. 83500B-1–83500B-7 (2012)

    Google Scholar 

  14. Marsaglia, G.: DIEHARD: a Battery of Tests of Randomness. http://www.stat.fsu.edu/pub/diehard/

  15. Meier, W., Staffelbach, O.: The self-shrinking generator. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 205–214. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  16. Message Passing Interface Forum: MPI: A Message-Passing Interface Standard, Version 3.0. High Performance Computing Center, Stuttgart (2012)

    Google Scholar 

  17. Pachori, V., Ansari, G., Chaudhary, N.: Improved performance of advance encryption standard using parallel computing. Int. J. Eng. Res. Appl. 2(1), 967–971 (2012)

    Google Scholar 

  18. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A statistical test suite for random and pseudorandom number generators for cryptographic application. Natl. Inst. Stand. Technol. Spec. Publ. 800–22rev1a (2010)

    Google Scholar 

  19. Stoyanov, B., Kolev, M., Nachev, A.: Design of a new self-shrinking 2-adic cryptographic system with application to image encryption. Eur. J. Sci. Res. 78(3), 362–374 (2012)

    Google Scholar 

  20. Suwais, K., Samsudin, A.: High performance multithreaded model for stream cipher. Int. J. Comput. Sci. Netw. Secur. 8(3), 228–233 (2008)

    Google Scholar 

  21. Tasheva, Z., Bedzhev, B., Stoyanov, B.: Self-shrinking p-adic cryptographic generator. In: Milovanović, B. (ed.) XL International Scientific Conference on Information, Communication and Energy Systems and Technologies, pp. 7–10. Niš (2005)

    Google Scholar 

  22. Walker, J.: ENT: A Pseudorandom Number Sequence Test Program. http://www.fourmilab.ch/random/

  23. Wang, W., Wang, X., Song, D.: A parallel chaotic cryptosystem for dual-core processor. In: 2nd International Conference on Information and Engineering, pp. 920–923. IEEE Press, New York (2010)

    Google Scholar 

Download references

Acknowledgements

This paper is supported by the Project BG051PO00l-3.3.06-0003 “Building and steady development of PhD students, post-PhD and young scientists in the areas of the natural, technical and mathematical sciences”. The Project is realized by the financial support of the Operative Program “Development of the human resources” of the European social fund of the European Union.

The authors would like to thank Miroslav Kolev, Delian Sarmov, Nikolay Yankov, and Georgi Dimitrov for their comments and suggestion on earlier drafts of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Borislav Stoyanov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stoyanov, B., Kordov, K. (2014). Pseudorandom Bit Generator with Parallel Implementation. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2013. Lecture Notes in Computer Science(), vol 8353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43880-0_64

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43880-0_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43879-4

  • Online ISBN: 978-3-662-43880-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics