Advertisement

Designs, Codes and Cryptography

, Volume 86, Issue 4, pp 939–953 | Cite as

Fast construction of binary ring FCSRs for hardware stream ciphers

  • Zhiqiang LinEmail author
  • Dingyi Pei
  • Dongdai Lin
  • Xiaolei Zhang
Article
  • 214 Downloads

Abstract

Stream ciphers based on linear feedback shift registers have been subject to algebraic attacks. To avoid these kinds of attacks, feedback with carry shift registers (FCSRs) have been proposed as an alternative. They are suitable for hardware implementations. FCSRs have been implemented using ring representation, in order to circumvent some weaknesses in the traditional representations. In this paper, we explore the simplest case of FCSRs, called binary FCSRs, which are common in applications. We give a fast algorithm to construct binary ring FCSRs for hardware stream ciphers.

Keywords

Stream cipher l-Sequences 2-Adic ring FCSRs Transition matrix 

Mathematics Subject Classification

14G50 94A55 

Notes

Acknowledgements

This work is supported by the National Natural Science Foundations of China under Grant Nos. 11371106, 11271003 and 61309028, the Guangdong Province Natural Science Foundation of major basic research and Cultivation project under Grant No. 2015A030308016, the Project of Ordinary University Innovation Team Construction of Guangdong Province under Grant No. 2015KCXTD014, the Basic Research Major Projects of Department of education of Guangdong Province under Grant No. 2014KZDXM044 and the Collaborative Innovation Major Projects of Bureau of Education of Guangzhou City under Grant No. 1201610005.

References

  1. 1.
    Klapper A., Goresky M.: 2-adic shift registers. In: Anderson R. (ed.) Fast Software Encryption, vol. 809, pp. 174–178. Springer, Berlin (1994).CrossRefGoogle Scholar
  2. 2.
    Klapper A., Goresky M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10(2), 111–147 (1997).MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Klapper A.: A survey of feedback with carry shift registers. In: Helleseth T., Sarwate D., Song H.-Y., Yang K. (eds.) Sequences and Their Applications (Lecture Notes in Computer Science), vol. 3486, pp. 56–71. Springer, Berlin (2005).Google Scholar
  4. 4.
    Klapper A., Goresky M.: Large Period Nearly Debruijn FCSR Sequences, Advances in Cryptologyeurocrypt’95, pp. 263–273. Springer, Berlin (1995).zbMATHGoogle Scholar
  5. 5.
    Goresky M., Klapper A.M.: Fibonacci and Galois representations of feedback-with-carry shift registers. IEEE Trans. Inf. Theory 48(11), 2826C2836 (2002).MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Arnault F., Berger T.P.: F-FCSR: Design of a new class of stream ciphers. In: Fast Software Encryption, pp. 83–97. Springer, Berlin (2005)Google Scholar
  7. 7.
    Hell M., Johansson T.: Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time. J. Cryptol. 24(3), 427–445 (2011).MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Stankovski P., Hell M., Johansson T.: An efficient state recovery attack on the X-FCSR family of stream ciphers. J. Cryptol. 27(1), 1–22 (2014).CrossRefzbMATHGoogle Scholar
  9. 9.
    Arnault F., Berger T., Lauradoux C., Minier M., Pousse B.: A new approach for FCSRs. In: Jacobson Jr. M.J., Rijmen V., Safavi-Naini R. (eds.) Selected Areas in Cryptography (Lecture Notes in Computer Science), vol. 5867, pp. 433–448. Springer, New York, NY (2009).CrossRefGoogle Scholar
  10. 10.
    Arnault F., Berger T.P., Pousse B.: A matrix approach for FCSR automata. Cryptogr. Commun. 3(2), 109–139 (2011).MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Arnault F., Berger T., Minier M., Pousse B.: Revisiting LFSRs for cryptographic applications. IEEE Trans. Inf. Theory 57(12), 8095–8113 (2011).MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Zhiqiang L., Dingyi P.: Constructing a ternary FCSR with a given connection integer. Tech. Rep. 2011/358. http://eprint.iacr.org/2011/358/
  13. 13.
    Dingyi P., Zhiqiang L., Xiaolei Z.: Construction of transition matrices for ternary ring feedback with carry shift registers. IEEE Trans. Inf. Theory 61(5), 2042–2951 (2015).MathSciNetzbMATHGoogle Scholar
  14. 14.
    Wang H., Stankovski P., Johansson T.: A generalized birthday approach for efficiently finding linear relations in \(\ell \)-sequences. Des. Codes Cryptogr. 74(1), 41–57 (2015).MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Tian T., Qi W.-F.: Linearity properties of binary FCSR sequences. Des. Codes Cryptogr. 52(3), 249–262 (2009).MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Zhiqiang L., Lishan K., Dongdai L., Jian G.: On the LFSRization of a class of FCSR automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98(1), 434–440 (2015).Google Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  • Zhiqiang Lin
    • 1
    • 2
    Email author
  • Dingyi Pei
    • 1
    • 2
  • Dongdai Lin
    • 3
  • Xiaolei Zhang
    • 1
    • 2
  1. 1.College of Mathematics and Information ScienceGuangzhou UniversityGuangzhouChina
  2. 2.Key Laboratory of Mathematics and Interdisciplinary Sciences of Guangdong Higher Education InstitutesGuangzhou UniversityGuangzhouChina
  3. 3.The State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of SciencesBeijingChina

Personalised recommendations