Publicacions en què col·labora amb Amparo Fúster Sabater (38)

2022

  1. A Hadamard Matrix-Based Algorithm to Evaluate the Strength of Binary Sequences

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences

    Mathematics, Vol. 10, Núm. 5

  3. Computational Analysis of Interleaving PN-Sequences with Different Polynomials

    Cryptography, Vol. 6, Núm. 2

  4. Erratum: Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs (Logic Journal of the IGPL DOI: 10.1093/jigpal/jzz051)

    Logic Journal of the IGPL

  5. Randomness study of the concatenation of generalized sequences

    Logic Journal of the IGPL, Vol. 30, Núm. 6, pp. 993-1004

2021

  1. An innovative linear complexity computation for cryptographic sequences

    Advances in Intelligent Systems and Computing

  2. Interleaving shifted versions of a PN-sequence

    Mathematics, Vol. 9, Núm. 6

  3. Preliminary Analysis of Interleaving PN-Sequences

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Randomness analysis for gss-sequences concatenated

    Advances in Intelligent Systems and Computing

2020

  1. Linear complexity of generalized sequences by comparison of PN-sequences

    Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales - Serie A: Matematicas, Vol. 114, Núm. 2

  2. Linearization of Cryptographic Sequences

    Advances in Intelligent Systems and Computing

  3. Recovering decimation-based cryptographic sequences by means of linear CAs

    Logic Journal of the IGPL, Vol. 28, Núm. 4, pp. 430-448

  4. Representations of generalized self-shrunken sequences

    Mathematics, Vol. 8, Núm. 6

2019

  1. Binomial Characterization of Cryptographic Sequences

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Binomial characterization of cryptographic sequences

    Computational Science and Its Applications -- ICCSA 2019, 19th International Conference, Saint Petersburg, Russia, July 1-4, 2019 : Proceedings. Part I (Springer International Publishing AG), pp. 803-816

  3. Binomial representation of cryptographic binary sequences and its relation to cellular automata

    Complexity, Vol. 2019

  4. Cryptanalysis

    SpringerBriefs in Mathematics (Springer Science and Business Media B.V.), pp. 65-93

  5. Cryptography with shrinking generators: Fundamentals and applications of keystream sequence generators based on irregular decimation

    SpringerBriefs in Mathematics (Springer Science and Business Media B.V.), pp. 1-95

  6. Introduction to stream ciphers

    SpringerBriefs in Mathematics (Springer Science and Business Media B.V.), pp. 1-24

  7. Keystream generators based on irregular decimation

    SpringerBriefs in Mathematics (Springer Science and Business Media B.V.), pp. 25-43