Domingo Gómez-Pérez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Domingo Gómez-Pérez has a total of 115 co-authors. Here are the top co-authors by number of shared publications:
- Jaime Gutierrez
Departamento de Matemática Aplicada y Ciencias de la Computación, Universidad de Cantabria, Santander, Spain
23 shared publications - Igor E. Shparlinski
School of Mathematics and Statistics, University of New South Wales, Sydney, Australia
14 shared publications - Ana Isabel Gomez
Universidad Rey Juan Carlos
11 shared publications - Andrew Z. Tirkel
Scientific Technology
5 shared publications - Arne Winterhof
Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Linz, Austria
5 shared publications - Min Sha
School of Mathematical Sciences South China Normal University Guangzhou, 510631, China
5 shared publications
Latest Publications
- Open Access
- 10 July 2026
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 138
On the search of binary Legendre pairs of length pq2
- 10 July 2026
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 138
Open AccessOn the search of binary Legendre pairs of length pq2
- 31 May 2026
- Published by Springer Nature
- p. 271-283
Period Counting Versus Direct Sampling in Oscillator-Based TRNGs: Architectures and Characteristics
- 31 May 2026
- Published by Springer Nature
- p. 271-283
Period Counting Versus Direct Sampling in Oscillator-Based TRNGs: Architectures and Characteristics
- Open Access
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 79-86
On properties of Legendre pairs under compression
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 79-86
Open AccessOn properties of Legendre pairs under compression
- Open Access
- 22 July 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (1) , 141-152
A computational approach for the study of linear complexity of shrunken sequences
The shrinking generator is a pseudorandom bit generator based on the combination of two linear feedback shift registers of maximum period. These registers are synchronized with a common clock and produce binary sequences with good statistical properties. Due to its simplicity and efficient implementation, the shrinking generator is particularly suitable for stream cipher cryptographic schemes and most proposed attacks rely on the properties of the generator. Furthermore, its analysis serves as the foundation for other interleave constructions. In our work, we present a new algorithm which allows to compute the linear complexity for shrunken sequences in an efficient way together with a closed formula for the linear complexity of its output in certain conditions. Additionally, we establish the first bound on its linear complexity profile and a conjecture about the values of the linear complexity of these sequences. Our techniques involve two-dimensional arrays and their interleave structure, which could prove valuable for other pseudorandom bit generators.
- 22 July 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (1) , 141-152
Open AccessA computational approach for the study of linear complexity of shrunken sequences
The shrinking generator is a pseudorandom bit generator based on the combination of two linear feedback shift registers of maximum period. These registers are synchronized with a common clock and produce binary sequences with good statistical properties. Due to its simplicity and efficient implementation, the shrinking generator is particularly suitable for stream cipher cryptographic schemes and most proposed attacks rely on the properties of the generator. Furthermore, its analysis serves as the foundation for other interleave constructions. In our work, we present a new algorithm which allows to compute the linear complexity for shrunken sequences in an efficient way together with a closed formula for the linear complexity of its output in certain conditions. Additionally, we establish the first bound on its linear complexity profile and a conjecture about the values of the linear complexity of these sequences. Our techniques involve two-dimensional arrays and their interleave structure, which could prove valuable for other pseudorandom bit generators.
- 28 February 2025
- Published by Springer Nature
- p. 117-126
Generating Gaussian Pseudorandom Noise with Binary Sequences
- 28 February 2025
- Published by Springer Nature
- p. 117-126
Generating Gaussian Pseudorandom Noise with Binary Sequences
- Open Access
Generating gaussian pseudorandom noise with binary sequences
Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the applicability of uniform pseudorandom binary generators in combination with the Central Limit Theorem to propose an easy to implement, efficient and flexible algorithm that leverages the properties of the pseudorandom binary generator used as an input, specially with respect to the correlation measure of higher order, to guarantee the quality of the generated samples. Our main result provides a relationship between the pseudorandomness of the input and the statistical moments of the output. We propose a design based on the combination of pseudonoise sequences commonly used on wireless communications with known hardware implementation, which can generate sequences with guaranteed statistical distribution properties sufficient for many real life applications and simple machinery. Initial computer simulations on this construction show promising results in the quality of the output and the computational resources in terms of required memory and complexity.
Open AccessGenerating gaussian pseudorandom noise with binary sequences
Gaussian random number generators attract a widespread interest due to their applications in several fields. Important requirements include easy implementation, tail accuracy, and, finally, a flat spectrum. In this work, we study the applicability of uniform pseudorandom binary generators in combination with the Central Limit Theorem to propose an easy to implement, efficient and flexible algorithm that leverages the properties of the pseudorandom binary generator used as an input, specially with respect to the correlation measure of higher order, to guarantee the quality of the generated samples. Our main result provides a relationship between the pseudorandomness of the input and the statistical moments of the output. We propose a design based on the combination of pseudonoise sequences commonly used on wireless communications with known hardware implementation, which can generate sequences with guaranteed statistical distribution properties sufficient for many real life applications and simple machinery. Initial computer simulations on this construction show promising results in the quality of the output and the computational resources in terms of required memory and complexity.
- 11 January 2023
- Published by Springer Nature
- p. 313-319
Correlation Measure of Binary Sequence Families With Trace Representation
- 11 January 2023
- Published by Springer Nature
- p. 313-319
Correlation Measure of Binary Sequence Families With Trace Representation
- 1 November 2021
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 396
Secure pseudorandom bit generators and point sets with low star-discrepancy
- 1 November 2021
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 396
Secure pseudorandom bit generators and point sets with low star-discrepancy
- 1 July 2020
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 99, 231-241
On the complexity of exact counting of dynamically irreducible polynomials
- 1 July 2020
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 99, 231-241
On the complexity of exact counting of dynamically irreducible polynomials