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

Review of the Lineal Complexity Calculation through Binomial Decomposition-Based Algorithms

Author

Listed:
  • Jose Luis Martin-Navarro

    (Department of Computer Science, School of Science, Aalto University, 02150 Espoo, Finland)

  • Amparo Fúster-Sabater

    (Instituto de Tecnologías Físicas y de la Información, C.S.I.C., 28006 Madrid, Spain
    Current address: Serrano 144, 28006 Madrid, Spain.)

Abstract

The ubiquity of smart devices and IoT are the main forces behind the development of cryptographic primitives that preserve the security of this devices, with the resources constraints they face. In this sense, the development of lightweight cryptographic algorithms, where PRNGs are an essential part of them, provides security to all these interconnected devices. In this work, a family of sequence generators with hard characteristics to be analyzed by standard methods is described. Moreover, we introduce an innovative technique for sequence decomposition that allows one to extract useful information on the sequences under study. In addition, diverse algorithms to evaluate the strength of such binary sequences have been introduced and analyzed to show which performs better.

Suggested Citation

  • Jose Luis Martin-Navarro & Amparo Fúster-Sabater, 2021. "Review of the Lineal Complexity Calculation through Binomial Decomposition-Based Algorithms," Mathematics, MDPI, vol. 9(5), pages 1-22, February.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:5:p:478-:d:506272
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/5/478/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/5/478/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sara D. Cardell & Amparo Fúster-Sabater, 2019. "Binomial Representation of Cryptographic Binary Sequences and Its Relation to Cellular Automata," Complexity, Hindawi, vol. 2019, pages 1-13, March.
    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. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2020. "Coexistence of Periods in Parallel and Sequential Boolean Graph Dynamical Systems over Directed Graphs," Mathematics, MDPI, vol. 8(10), pages 1-14, October.
    2. Amparo Fúster-Sabater & Verónica Requena & Sara D. Cardell, 2022. "An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences," Mathematics, MDPI, vol. 10(5), pages 1-23, 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:gam:jmathe:v:9:y:2021:i:5:p:478-:d:506272. 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.