Domingo Gómez-Pérez

Orcid: 0000-0002-5780-2165

According to our database1, Domingo Gómez-Pérez authored at least 65 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Still More Structural Properties of Algebraic Costas Arrays.
IEEE Trans. Inf. Theory, November, 2023

2022
Correlation measure, linear complexity and maximum order complexity for families of binary sequences.
Finite Fields Their Appl., 2022

Correlation Measure of Binary Sequence Families With Trace Representation.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2021
Secure pseudorandom bit generators and point sets with low star-discrepancy.
J. Comput. Appl. Math., 2021

Correlation, Linear Complexity, Maximum order Complexity on Families of binary Sequences.
CoRR, 2021

Generalised GMW Sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
A Note on the Cross-Correlation of Costas Permutations.
IEEE Trans. Inf. Theory, 2020

On the complexity of exact counting of dynamically irreducible polynomials.
J. Symb. Comput., 2020

Closed-Set-Based Discovery of Representative Association Rules.
Int. J. Found. Comput. Sci., 2020

Large families of sequences for CDMA, frequency hopping, and UWB.
Cryptogr. Commun., 2020

Algebraic dependence in generating functions and expansion complexity.
Adv. Math. Commun., 2020

Multidimensional linear complexity analysis of periodic arrays.
Appl. Algebra Eng. Commun. Comput., 2020

Recursion Polynomials of Unfolded Sequences.
Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019
A probabilistic analysis on a lattice attack against DSA.
Des. Codes Cryptogr., 2019

2018
On the Expansion Complexity of Sequences Over Finite Fields.
IEEE Trans. Inf. Theory, 2018

On the linear complexity for multidimensional sequences.
J. Complex., 2018

Global optimality in <i>k</i>-means clustering.
Inf. Sci., 2018

The arithmetic of consecutive polynomial sequences over finite fields.
Finite Fields Their Appl., 2018

Arithmetic Properties of Integers in Chains and Reflections of g-ary Expansions.
Exp. Math., 2018

k-Error linear complexity for multidimensional arrays.
CoRR, 2018

2017
A Probabilistic Analysis on a Lattice Attack against DSA.
CoRR, 2017

Arrays composed from the extended rational cycle.
Adv. Math. Commun., 2017

Editorial.
Adv. Math. Commun., 2017

2016
Common composites of triangular polynomial systems and hash functions.
J. Symb. Comput., 2016

Attacks and parameter choices in HIMMO.
IACR Cryptol. ePrint Arch., 2016

2015
Analyzing collaboration and interaction in learning environments to form learner groups.
Comput. Hum. Behav., 2015

HIMMO: a collusion-resistant identity-based scheme for symmetric key generation.
ACM Commun. Comput. Algebra, 2015

Multidimensional arrays with maximal linear complexity.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

Linear complexity for multidimensional arrays - a numerical invariant.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
On lattice profile of the elliptic curve linear congruential generators.
Period. Math. Hung., 2014

Recovering zeros of polynomials modulo a prime.
Math. Comput., 2014

Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators.
Math. Comput., 2014

Mathematical and computer algebra techniques in cryptology.
J. Symb. Comput., 2014

On the Carlitz rank of permutations of F<sub>q</sub> and pseudorandom sequences.
J. Complex., 2014

HIMMO - A Lightweight, Fully Collusion Resistant Key Pre-Distribution Scheme.
IACR Cryptol. ePrint Arch., 2014

Generalized explicit inversive generators of small p-weight degree.
Finite Fields Their Appl., 2014

The MMO problem.
CoRR, 2014

On the Lattice Structure of Inversive PRNG via the Additive Order.
Proceedings of the Sequences and Their Applications - SETA 2014, 2014

The <i>MMO</i> problem.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

On the linear complexity and lattice test of nonlinear pseudorandom number generators.
Proceedings of the Applied Algebra and Number Theory, 2014

2013
Predicting masked linear pseudorandom number generators over finite fields.
Des. Codes Cryptogr., 2013

A method to form learners groups in computer-supported collaborative learning systems.
Proceedings of the Technological Ecosystems for Enhancing Multiculturality Conference, 2013

2012
Multiplicative character sums of Fermat quotients and pseudorandom sequences.
Period. Math. Hung., 2012

Connectedness of finite distance graphs.
Networks, 2012

Linear Complexity of Binary Sequences Derived from Polynomial Quotients.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

2011
On the linear complexity of the Naor-Reingold sequence.
Inf. Process. Lett., 2011

2010
An estimate on the number of stable quadratic polynomials.
Finite Fields Their Appl., 2010

On the linear complexity of the Naor-Reingold sequence with elliptic curves.
Finite Fields Their Appl., 2010

Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators.
Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2009
A strategy for recovering roots of bivariate polynomials modulo a prime.
IACR Cryptol. ePrint Arch., 2009

On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings.
Proceedings of the Applied Algebra, 2009

2008
Prediciendo el generador cuadratico (in Spanish)
CoRR, 2008

Multiplicative Character Sums of Recurring Sequences with Rédei Functions.
Proceedings of the Sequences and Their Applications, 2008

2007
Optimal routing in double loop networks.
Theor. Comput. Sci., 2007

Cayley Digraphs of Finite Abelian Groups and Monomial Ideals.
SIAM J. Discret. Math., 2007

An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers.
IACR Cryptol. ePrint Arch., 2007

2006
Attacking the Pollard Generator.
IEEE Trans. Inf. Theory, 2006

Reconstructing noisy polynomial evaluation in residue rings.
J. Algorithms, 2006

Exponential sums with Dickson polynomials.
Finite Fields Their Appl., 2006

2005
Predicting nonlinear pseudorandom number generators.
Math. Comput., 2005

Cryptanalysis of the Quadratic Generator.
Proceedings of the Progress in Cryptology, 2005

On Finding a Shortest Path in Circulant Graphs with Two Jumps.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Circulant Digraphs and Monomial Ideals.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2003
Predicting the Inversive Generator.
Proceedings of the Cryptography and Coding, 2003

2001
Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers.
Proceedings of the Applied Algebra, 2001


  Loading...