IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v109y2018icp36-40.html
   My bibliography  Save this article

A novel method for reconstructing period with single input in NFSR

Author

Listed:
  • Gao, Bo
  • Liu, Xuan
  • Lan, Zhongzhou
  • Fu, Rongrong

Abstract

Non-Linear Feedback Shift Registers (NFSRs) are a generalization of Liner Feedback Shift Registers (LFSRs). The study of NFSR sequence helps to analyze the cryptographical security of NFSR-based stream cipher. Due to lack of efficient algebraic tools, the period of NFSR still remains an open crucial theoretical problem. In this paper, we view the NFSR as a Boolean network (BN), so that the study about the period of NFSR can be viewed as the study about period of BN. Furthermore, based on the mathematical tool of semi-tensor product (STP), a Boolean network can be mapped into an algebraic form. For these, we put forward a method for reconstructing the period of NFSR with single input. Especially, we propose a procedure to choose the controlled states and steer the controlled states from initial state to desirable one. At last, the general derivation is exemplified by numerical simulations for a kind of NFSR.

Suggested Citation

  • Gao, Bo & Liu, Xuan & Lan, Zhongzhou & Fu, Rongrong, 2018. "A novel method for reconstructing period with single input in NFSR," Chaos, Solitons & Fractals, Elsevier, vol. 109(C), pages 36-40.
    • Handle: RePEc:eee:chsofr:v:109:y:2018:i:c:p:36-40
    DOI: 10.1016/j.chaos.2018.01.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077918300122
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2018.01.012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gao, Bo & Deng, Zheng-hong & Zhao, Da-wei & Song, Qun, 2017. "State analysis of Boolean control networks with impulsive and uncertain disturbances," Applied Mathematics and Computation, Elsevier, vol. 301(C), pages 187-192.
    2. Li, Xianghua & Wang, Zhen & Gao, Chao & Shi, Lei, 2017. "Reasoning human emotional responses from large-scale social and public media," Applied Mathematics and Computation, Elsevier, vol. 310(C), pages 182-193.
    3. Chao Gao & Zhen Wang & Xianghua Li & Zili Zhang & Wei Zeng, 2016. "PR-Index: Using the h-Index and PageRank for Determining True Impact," PLOS ONE, Public Library of Science, vol. 11(9), pages 1-13, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gao, Bo & Liu, Xuan & Lan, Zhong-Zhou & Hong, Jie & Zhang, Wenguang, 2021. "The evolution of cooperation with preferential selection in voluntary public goods game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    2. Zhe Gao & Jun-e Feng, 2022. "Research Status of Nonlinear Feedback Shift Register Based on Semi-Tensor Product," Mathematics, MDPI, vol. 10(19), pages 1-14, September.
    3. Gao, Bo & liu, Xuan & Hou, Shuxia & Jia, Danyang & Du, Mingjing, 2019. "Resolving public goods dilemma by giving the poor more support," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Su, Zhen & Liu, Fanzhen & Gao, Chao & Gao, Shupeng & Li, Xianghua, 2018. "Inferring infection rate based on observations in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 107(C), pages 170-176.
    2. Li, Hui-Jia & Bu, Zhan & Li, Yulong & Zhang, Zhongyuan & Chu, Yanchang & Li, Guijun & Cao, Jie, 2018. "Evolving the attribute flow for dynamical clustering in signed networks," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 20-27.
    3. Shen, Dongqin & Cao, Shanshan, 2018. "An efficient immunization strategy based on transmission limit in weighted complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 114(C), pages 1-7.
    4. Li, Xianghua & Guo, Jingyi & Gao, Chao & Su, Zhen & Bao, Deng & Zhang, Zili, 2018. "Network-based transportation system analysis: A case study in a mountain city," Chaos, Solitons & Fractals, Elsevier, vol. 107(C), pages 256-265.
    5. Li, Xianghua & Guo, Jingyi & Gao, Chao & Zhang, Leyan & Zhang, Zili, 2018. "A hybrid strategy for network immunization," Chaos, Solitons & Fractals, Elsevier, vol. 106(C), pages 214-219.
    6. Zhang, Jun & Hu, Bin & Huang, Yi Jie & Deng, Zheng Hong & Wu, Tao, 2020. "The evolution of cooperation affected by aspiration-driven updating rule in multi-games with voluntary participation," Chaos, Solitons & Fractals, Elsevier, vol. 139(C).
    7. Zhao, Dawei & Wang, Lianhai & Xu, Shujiang & Liu, Guangqi & Han, Xiaohui & Li, Shudong, 2017. "Vital layer nodes of multiplex networks for immunization and attack," Chaos, Solitons & Fractals, Elsevier, vol. 105(C), pages 169-175.
    8. Massucci, Francesco Alessandro & Docampo, Domingo, 2019. "Measuring the academic reputation through citation networks via PageRank," Journal of Informetrics, Elsevier, vol. 13(1), pages 185-201.
    9. Chen, Chuan & Li, Lixiang & Peng, Haipeng & Kurths, Jürgen & Yang, Yixian, 2018. "Fixed-time synchronization of hybrid coupled networks with time-varying delays," Chaos, Solitons & Fractals, Elsevier, vol. 108(C), pages 49-56.
    10. Soriano-Sánchez, A.G. & Posadas-Castillo, C., 2018. "Smart pattern to generate small–world networks," Chaos, Solitons & Fractals, Elsevier, vol. 114(C), pages 415-422.
    11. Zheng, Mingwen & Wang, Zeming & Li, Lixiang & Peng, Haipeng & Xiao, Jinghua & Yang, Yixian & Zhang, Yanping & Feng, Cuicui, 2018. "Finite-time generalized projective lag synchronization criteria for neutral-type neural networks with delay," Chaos, Solitons & Fractals, Elsevier, vol. 107(C), pages 195-203.
    12. Liu, Jinzhuo & Li, Tong & Wang, Wei & Zhao, Na & Hang, Feilu, 2018. "Impact of strategy-neutral rewarding on the evolution of cooperative behavior," Chaos, Solitons & Fractals, Elsevier, vol. 106(C), pages 76-79.
    13. Guang Zhang & Nan He & Yanxia Dong, 2021. "A Proportional-Egalitarian Allocation Policy for Public Goods Problems with Complex Network," Mathematics, MDPI, vol. 9(17), pages 1-12, August.
    14. Tong, Liyun & Liu, Yang & Lou, Jungang & Lu, Jianquan & Alsaadi, Fuad E., 2018. "Static output feedback set stabilization for context-sensitive probabilistic Boolean control networks," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 263-275.
    15. Nadia Simoes & Nuno Crespo, 2020. "A flexible approach for measuring author-level publishing performance," Scientometrics, Springer;Akadémiai Kiadó, vol. 122(1), pages 331-355, January.
    16. Lee, O-Joun & Jeon, Hyeon-Ju & Jung, Jason J., 2021. "Learning multi-resolution representations of research patterns in bibliographic networks," Journal of Informetrics, Elsevier, vol. 15(1).
    17. Geng, Yini & Shen, Chen & Guo, Hao & Chu, Chen & Yu, Dalei & Shi, Lei, 2017. "Historical payoff promotes cooperation in voluntary prisoner's dilemma game," Chaos, Solitons & Fractals, Elsevier, vol. 105(C), pages 145-149.
    18. Gao, Bo & liu, Xuan & Hou, Shuxia & Jia, Danyang & Du, Mingjing, 2019. "Resolving public goods dilemma by giving the poor more support," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    19. Gao, Bo & Liu, Xuan & Lan, Zhong-Zhou & Hong, Jie & Zhang, Wenguang, 2021. "The evolution of cooperation with preferential selection in voluntary public goods game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    20. Nisar Ali & Zahid Halim & Syed Fawad Hussain, 2023. "An artificial intelligence-based framework for data-driven categorization of computer scientists: a case study of world’s Top 10 computing departments," Scientometrics, Springer;Akadémiai Kiadó, vol. 128(3), pages 1513-1545, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:109:y:2018:i:c:p:36-40. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.