IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2023i1p84-d1307796.html
   My bibliography  Save this article

A Novel Dynamic S-Box Generation Scheme Based on Quantum Random Walks Controlled by a Hyper-Chaotic Map

Author

Listed:
  • Lijun Zhang

    (School of Electronic Information and Electrical Engineering, Tianshui Normal University, Tianshui 741000, China)

  • Caochuan Ma

    (School of Mathematics and Statistics, Tianshui Normal University, Tianshui 741000, China
    College of Mathematics and Physics, Wenzhou University, Wenzhou 325035, China)

  • Yuxiang Zhao

    (School of Electronic Information and Electrical Engineering, Tianshui Normal University, Tianshui 741000, China)

  • Wenbo Zhao

    (School of Electronic Information and Electrical Engineering, Tianshui Normal University, Tianshui 741000, China)

Abstract

For many years, chaotic maps have been widely used in the design of various algorithms in cryptographic systems. In this paper, a new model (compound chaotic system) of quantum random walks controlled by a hyper-chaotic map is constructed and a novel scheme for constructing a dynamic S-Box based on the new model is proposed. Through aperiodic evaluation and statistical complexity measurement, it is shown that the compound chaotic system has features such as complex structure and stronger randomness than classical chaotic systems. Based on the chaotic sequence generated by the composite system, we design a dynamic S-Box generation mechanism. The mechanism can quickly generate high-security S-Boxes. Then, an example of randomly generating S-Boxes is given alongside an analytical evaluation of S-Box standard performance criteria such as bijection, boomerang uniformity, bit independence, nonlinearity, linear approximate probability, strict avalanche effect, differential uniformity, the and generalized majority logic criterion. The evaluation results confirm that the performance of the S-Box is excellent. Thus, the proposed dynamic S-Box construction technique can be used to generate cryptographically strong substitution-boxes in practical information security systems.

Suggested Citation

  • Lijun Zhang & Caochuan Ma & Yuxiang Zhao & Wenbo Zhao, 2023. "A Novel Dynamic S-Box Generation Scheme Based on Quantum Random Walks Controlled by a Hyper-Chaotic Map," Mathematics, MDPI, vol. 12(1), pages 1-22, December.
    • Handle: RePEc:gam:jmathe:v:12:y:2023:i:1:p:84-:d:1307796
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/1/84/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/1/84/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Larrondo, H.A. & González, C.M. & Martín, M.T. & Plastino, A. & Rosso, O.A., 2005. "Intensive statistical complexity measure of pseudorandom number generators," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 356(1), pages 133-138.
    Full references (including those not matched with items on IDEAS)

    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. Biamou, Arsene Loic Mbanda & Tamba, Victor Kamdoum & Tagne, François Kapche & Takougang, Armand Cyrille Nzeukou, 2024. "Fractional-order-induced symmetric multi-scroll chaotic attractors and double bubble bifurcations in a memristive coupled Hopfield neural networks," Chaos, Solitons & Fractals, Elsevier, vol. 178(C).
    2. Avaroğlu, Erdinç, 2020. "The implementation of ring oscillator based PUF designs in Field Programmable Gate Arrays using of different challenge," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 546(C).
    3. Zunino, L. & Pérez, D.G. & Kowalski, A. & Martín, M.T. & Garavaglia, M. & Plastino, A. & Rosso, O.A., 2008. "Fractional Brownian motion, fractional Gaussian noise, and Tsallis permutation entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6057-6068.
    4. Zunino, Luciano & Zanin, Massimiliano & Tabak, Benjamin M. & Pérez, Darío G. & Rosso, Osvaldo A., 2009. "Forbidden patterns, permutation entropy and stock market inefficiency," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(14), pages 2854-2864.
    5. Wang, Mengjiao & Liao, Xiaohan & Deng, Yong & Li, Zhijun & Su, Yongxin & Zeng, Yicheng, 2020. "Dynamics, synchronization and circuit implementation of a simple fractional-order chaotic system with hidden attractors," Chaos, Solitons & Fractals, Elsevier, vol. 130(C).
    6. Pastor, Marissa & Song, Juyong & Hoang, Danh-Tai & Jo, Junghyo, 2016. "Minimal perceptrons for memorizing complex patterns," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 31-37.
    7. Wang, Shaojie & He, Shaobo & Yousefpour, Amin & Jahanshahi, Hadi & Repnik, Robert & Perc, Matjaž, 2020. "Chaos and complexity in a fractional-order financial system with time delays," Chaos, Solitons & Fractals, Elsevier, vol. 131(C).
    8. Etem, Taha & Kaya, Turgay, 2020. "A novel True Random Bit Generator design for image encryption," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    9. Valle, João & Machicao, Jeaneth & Bruno, Odemir M., 2022. "Chaotical PRNG based on composition of logistic and tent maps using deep-zoom," Chaos, Solitons & Fractals, Elsevier, vol. 161(C).
    10. De Micco, Luciana & Fernández, Juana Graciela & Larrondo, Hilda A. & Plastino, Angelo & Rosso, Osvaldo A., 2012. "Sampling period, statistical complexity, and chaotic attractors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2564-2575.
    11. Eduarda T. C. Chagas & Marcelo Queiroz‐Oliveira & Osvaldo A. Rosso & Heitor S. Ramos & Cristopher G. S. Freitas & Alejandro C. Frery, 2022. "White Noise Test from Ordinal Patterns in the Entropy–Complexity Plane," International Statistical Review, International Statistical Institute, vol. 90(2), pages 374-396, August.

    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:gam:jmathe:v:12:y:2023:i:1:p:84-:d:1307796. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.