Skip to main content

Conditions for Feedback Shift Registers to Generate Permutations

  • Conference paper
  • First Online:
Proceedings of the Fifth International Conference on Mathematics and Computing

Abstract

The paper explores conditions to be satisfied by feedback shift registers (FSRs) to generate a permutation (alternatively a nonsingular map) of the state space over various fields. Such a condition is well known over the binary field \(\mathbb {F}_{2}\). This is extended to small finite fields and a simple sufficient condition is stated for larger fields. Permutations with cycles or periodic sequences generated by their action of lengths which are of exponential order of the register length are attractive for construction of pseudorandom sequences which have many applications.

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 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

Institutional subscriptions

References

  1. Berlekamp, E.: Algebraic Coding Theory. McGraw-Hill Series in Systems Science. McGraw-Hill, New York (1968). https://books.google.co.in/books?id=nIIpAQAAMAAJ

  2. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)

    Article  MathSciNet  Google Scholar 

  3. Golomb, S.W., et al.: Shift register sequences. Aegean Park Press, Laguna Hills (1982)

    Google Scholar 

  4. Golomb, S., Gong, G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005). https://books.google.co.in/books?id=KZamDAEACAAJ

  5. Lai, X.: Condition for the nonsingularity of a feedback shift-register over a general finite field (corresp.). IEEE Trans. Inf. Theory 33(5), 747–749 (1987)

    Google Scholar 

  6. Massey, J.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122–127 (1969)

    Article  MathSciNet  Google Scholar 

  7. Mullen, G.L.: Permutation polynomials and nonsingular feedback shift registers over finite fields. IEEE Trans. Inf. Theory 35(4), 900–902 (1989)

    Article  MathSciNet  Google Scholar 

  8. Niederreiter, H.: A public-key cryptosystem based on shift register sequences. In: Pichler, F. (ed.) Advances in Cryptology – EUROCRYPT’85, pp. 35–39. Springer, Berlin (1986)

    Google Scholar 

  9. Rueppel, R.: Analysis and Design of Stream Ciphers. Communications and Control Engineering. Springer, Berlin (2012). https://books.google.co.in/books?id=86FHnwEACAAJ

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Virendra Sule .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kammadanam, V.K., Sule, V., Hong, Y. (2021). Conditions for Feedback Shift Registers to Generate Permutations. In: Giri, D., Ho, A.T.S., Ponnusamy, S., Lo, NW. (eds) Proceedings of the Fifth International Conference on Mathematics and Computing. Advances in Intelligent Systems and Computing, vol 1170. Springer, Singapore. https://doi.org/10.1007/978-981-15-5411-7_9

Download citation

Publish with us

Policies and ethics