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

Enumerating Discrete Resonant Rossby/Drift Wave Triads and Their Application in Information Security

Author

Listed:
  • Umar Hayat

    (Department of Mathematics, Quaid-i-Azam University, Islamabad 45320, Pakistan)

  • Ikram Ullah

    (Department of Mathematics, Quaid-i-Azam University, Islamabad 45320, Pakistan)

  • Ghulam Murtaza

    (Department of Mathematics, Quaid-i-Azam University, Islamabad 45320, Pakistan)

  • Naveed Ahmed Azam

    (Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto 606-8503, Japan)

  • Miguel D. Bustamante

    (School of Mathematics and Statistics, University College Dublin, Belfield, Dublin 4, Ireland)

Abstract

We propose a new parametrization of the resonant Rossby/drift wave triads to develop an algorithm to enumerate all resonant triads in a given grid of wavenumbers. To arrive at such a parametrization, we have employed tools from arithmetic/algebraic geometry to project resonant triads on a certain class of conics. Further, we extend the newly developed algorithm for the enumeration of quasi-resonant triads and experimentally show that the said algorithm is robust to design the network of quasi-resonances. From the experimental results, we observed that the new algorithm enumerates all triads in low computation time when compared with the existing methods. Finally, we apply this work to information security by constructing a total order on the enumerated resonant triads to design a substitution box (S-box) generator. Via extensive analyses over several indicators (nonlinearity, algebraic complexity, linear and differential approximation probabilities, strict avalanche criteria, and bit independence criterion) we show that the newly developed S-box outperforms the S-boxes constructed by most of the existing schemes.

Suggested Citation

  • Umar Hayat & Ikram Ullah & Ghulam Murtaza & Naveed Ahmed Azam & Miguel D. Bustamante, 2022. "Enumerating Discrete Resonant Rossby/Drift Wave Triads and Their Application in Information Security," Mathematics, MDPI, vol. 10(23), pages 1-19, November.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:23:p:4395-:d:979953
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/23/4395/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/23/4395/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Elena Kartashova & Alexey Kartashov, 2006. "Laminated Wave Turbulence: Generic Algorithms I," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 17(11), pages 1579-1596.
    2. B. B. Cassal-Quiroga & E. Campos-Cantón, 2020. "Generation of Dynamical S-Boxes for Block Ciphers via Extended Logistic Map," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-12, March.
    3. Chen, Guo, 2008. "A novel heuristic method for obtaining S-boxes," Chaos, Solitons & Fractals, Elsevier, vol. 36(4), pages 1028-1036.
    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. Erendira Corona-Bermúdez & Juan Carlos Chimal-Eguía & Uriel Corona-Bermúdez & Mario Eduardo Rivero-Ángeles, 2023. "Chaos Meets Cryptography: Developing an S-Box Design with the Rössler Attractor," Mathematics, MDPI, vol. 11(22), pages 1-16, November.
    2. Yin, Ruming & Yuan, Jian & Wang, Jian & Shan, Xiuming & Wang, Xiqin, 2009. "Designing key-dependent chaotic S-box with larger key space," Chaos, Solitons & Fractals, Elsevier, vol. 42(4), pages 2582-2589.
    3. Denys Dutykh & Elena Tobisch, 2020. "Resonance Enhancement by Suitably Chosen Frequency Detuning," Mathematics, MDPI, vol. 8(3), pages 1-12, March.
    4. Lambić, Dragan, 2014. "A novel method of S-box design based on chaotic map and composition method," Chaos, Solitons & Fractals, Elsevier, vol. 58(C), pages 16-21.
    5. Arslan Shafique & Kashif Hesham Khan & Mohammad Mazyad Hazzazi & Ismail Bahkali & Zaid Bassfar & Mujeeb Ur Rehman, 2023. "Chaos and Cellular Automata-Based Substitution Box and Its Application in Cryptography," Mathematics, MDPI, vol. 11(10), pages 1-25, May.
    6. Dania Saleem Malik & Tariq Shah & Sara Tehsin & Inzamam Mashood Nasir & Norma Latif Fitriyani & Muhammad Syafrudin, 2024. "Block Cipher Nonlinear Component Generation via Hybrid Pseudo-Random Binary Sequence for Image Encryption," Mathematics, MDPI, vol. 12(15), pages 1-25, July.

    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:10:y:2022:i:23:p:4395-:d:979953. 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.