57
Views
1
CrossRef citations to date
0
Altmetric
Research Articles

Nonsingularity of Trivium-like cascade FSRs over finite fields via semi-tensor product

ORCID Icon & ORCID Icon
Pages 589-599 | Received 10 May 2022, Accepted 14 Dec 2022, Published online: 28 Dec 2022

References

  • Aumasson, J. P., Dinur, I., Meier, W., & Shamir, A. (2009). Cube testers and key recovery attacks on reduced-round MD6 and Trivium (pp. 1–22). Springer.
  • Canniere, D. C., & Preneel, B. (2008). Trivium. In: Robshaw, M., Billet, O. (eds) New Stream Cipher Designs. Springer, Berlin, Heidelberg, 244–266. https://doi.org/10.1007/978-3-540-68351-3_18
  • Cheng, D. Z., Qi, H. S., & Li, Z. Q (2011). Analysis and control of Boolean networks: A semi-tensor product approach. Springer.
  • Cheng, D. Z., Qi, H. S., & Zhao, Y (2012). An introduction to semi-tensor product of matrices and its applications. World Scientific.
  • Choy, J., Chew, G., Khoo, K., & Yap, H. (2011). Cryptographic properties and application of a generalized unbalanced feistel network structure. Cryptography and Communications, 3(3), 141–164. https://doi.org/10.1007/s12095-011-0042-6
  • Deepthi, P. P., & Sathidevi, P. S. (2009). Design, implementation and analysis of hardware efficient stream ciphers using LFSR based hash functions. Computers & Security, 28(3–4), 229–241. https://doi.org/10.1016/j.cose.2008.11.006
  • Ding, X. Y., & Li, H. T. (2022). Stability analysis of multi-valued logical networks with Markov jump disturbances. International Journal of Control, 95(2), 554–561. https://doi.org/10.1080/00207179.2020.1803410
  • Gao, Z., Feng, J. E, & Wang, B. (2021). On reconstructibility of switched Boolean control networks. International Journal of Control, 94(12), 3339–3348. https://doi.org/10.1080/00207179.2020.1763470
  • Guo, Y. Q., Wang, P., Gui, W. H., & Wang, C. H. (2015). Set stability and set stabilization of Boolean control networks based on invariant subsets. Automatica, 61, 106–112. https://doi.org/10.1016/j.automatica.2015.08.006
  • Hellebrand, S., Rajski, J., Tarnick, S., Venkataraman, S., & Courtois, B. (1995). Built-in test for circuits with scan based on reseeding of multiple-polynomial linear feedback shift registers. IEEE Transactions on Computers, 44(2), 223–233. https://doi.org/10.1109/12.364534
  • Hu, Y. P., Gao, J. T., Liu, Q., & Zhang, Y. W. (2012). Fault analysis of Trivium. Designs Codes & Cryptography, 62(3), 289–311. https://doi.org/10.1007/s10623-011-9518-9
  • Lai, X. J. (1987). Condition for the nonsingularity of a feedback shift-register over a general finite field (corresp.). IEEE Transactions on Information Theory, 33(5), 747–749. https://doi.org/10.1109/TIT.1987.1057338
  • Li, C. (1997). The numbering of nonsingular feedback function. Communication Security, 17(3), 68–71.
  • Li, C., & Xie, D. (1995). Criterion for the nonsingularity of feedback shift registers. Journal of Electronics and Information Technology, 17(5), 500–505.
  • Liu, J. Y., Jiang, Y. P., Zheng, Q. X., & Lin, D. D. (2021). Nonsingularity of feedback shift registers of degree at most three over a finite field. Chinese Journal of Electronics, 30(2), 232–237. https://doi.org/10.1049/cje2.v30.2
  • Liu, Z. B., Wang, Y. Z., & D. Z. Cheng (2015). Nonsingularity of feedback shift registers. Automatica, 55, 247–253. https://doi.org/10.1016/j.automatica.2015.03.014
  • Lu, J. Q., Li, B. W., & Zhong, J. (2021). A novel synthesis method for reliable feedback shift registers via Boolean networks. Science China Information Sciences, 64(5), 1–14. https://doi.org/10.1007/s11432-020-2981-4
  • Lu, J. Q., Li, M. L., Huang, T. W., Liu, Y., & Cao, J. D. (2018). The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices. Automatica, 96, 393–397. https://doi.org/10.1016/j.automatica.2018.07.011
  • Lu, J. Q., Li, M. L., Liu, Y., Ho, D. W., & Kurths, J. (2018). Nonsingularity of Grain-like cascade FSRs via semi-tensor product. Science China Information Sciences, 61(1), 010204. https://doi.org/10.1007/s11432-017-9269-6
  • Massey, J. (1969). Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory, 15(1), 122–127. https://doi.org/10.1109/TIT.1969.1054260
  • Mullen, G. L. (1989). Permutation polynomials and nonsingular feedback shift registers over finite fields. IEEE Transactions on Information Theory, 35(4), 900–902. https://doi.org/10.1109/18.32171
  • Paar, C., Fleischmann, P., & Soria-Rodriguez, P. (1999). Fast arithmetic for public-key 21 algorithms in Galois fields with composite exponents. IEEE Transactions on Computers, 48(10), 1025–1034. https://doi.org/10.1109/12.805153
  • Roger, A., & Johnson, C. R (1991). Topics in matrix analysis. Cambridge University Press.
  • Solomon, G. W (1967). Shift register sequence. Holden-Day.
  • Tian, Y., Chen, G. L., & Li, J. H. (2012). Quavium—A new stream cipher inspired by Trivium. Journal of Computers, 7(5), 1278–1283. https://doi.org/10.4304/jcp.7.5.1278-1283
  • Wang, H. Y., Zhong, J. H., & Lin, D. D. (2017). Linearization of multi-valued nonlinear feedback shift registers. Journal of Systems Science & Complexity, 30(2), 494–509. https://doi.org/10.1007/s11424-016-5156-7
  • Wang, Q. Y., & Jin, C. H. (2013). Nonsingularity decision of Trivium-like cascade connection of feedback shift registers. Journal of Information Engineering University, 14(5), 519–523.
  • Wang, S., Feng, J. E, Zhao, J. L., & Xia, J. W. (2018). Controllability decomposition of dynamic-algebraic Boolean control networks. International Journal of Control, 93(7), 1684–1695. https://doi.org/10.1080/00207179.2018.1527040
  • Yu, Y. Y., Feng, J. E, Wang, B., & Wang, P. H. (2018). Sampled-data controllability and stabilizability of Boolean control networks: Nonuniform sampling. Journal of the Franklin Institute, 355(12), 5324–5335. https://doi.org/10.1016/j.jfranklin.2018.05.036
  • Zhang, K. Z., & Zhang, L. J. (2016). Observability of Boolean control networks: A unified approach based on finite automata. IEEE Transactions on Automatic Control, 61(9), 2733–2738. https://doi.org/10.1109/TAC.2015.2501365
  • Zhang, X., Yang, Z. P., & Cao, C. G. (2002). Inequalities involving Khatri–Rao products of positive semi-definite matrices. Applied Mathematics E-Notes, 2, 117–124.
  • Zhong, J. H., & Lin, D. D. (2014). On maximum length nonlinear feedback shift registers using a Boolean network approach. In Proceedings of the 33rd Chinese Control Conference (pp. 2502–2507). https://doi.org/10.1109/ChiCC.2014.6897028
  • Zhong, J. H., & Lin, D. D. (2015). A new linearization method for nonlinear feedback shift registers. Journal of Computer and System Sciences, 81(4), 783–796. https://doi.org/10.1016/j.jcss.2014.12.030
  • Zhong, J. H., & Lin, D. D. (2016a). Driven stability of nonlinear feedback shift registers with inputs. IEEE Transactions on Communications, 64(6), 2274–2284. https://doi.org/10.1109/TCOMM.2016.2557330
  • Zhong, J. H., & Lin, D. D. (2016b). Stability of nonlinear feedback shift registers. Science China Information Sciences, 59(1), 197–208. https://doi.org/10.1016/j.ins.2016.03.015
  • Zhong, J. H., & Lin, D. D. (2018). On minimum period of nonlinear feedback shift registers in Grain-like structure. IEEE Transactions on Information Theory, 64(9), 6429–6442. https://doi.org/10.1109/TIT.18
  • Zhong, J. H., & Lin, D. D. (2019a). Decomposition of nonlinear feedback shift registers based on Boolean networks. Science China Information Sciences, 62(3), 1–3. https://doi.org/10.1007/s11432-017-9460-4
  • Zhong, J. H., & Lin, D. D. (2019b). On equivalence of cascade connections of two nonlinear feedback shift registers. The Computer Journal, 62(12), 1793–1804. https://doi.org/10.1093/comjnl/bxz057

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.