Domingo Gómez-Pérez

CoRR, 2024

A New Family of Binary Sequences Based on the Generalized ERC Construction.

[BibT_eX]

[DOI]

Francisco-Javier Soto

Ana I Gómez

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Still More Structural Properties of Algebraic Costas Arrays.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, November, 2023

2022

Correlation measure, linear complexity and maximum order complexity for families of binary sequences.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2022

Correlation Measure of Binary Sequence Families With Trace Representation.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022

2021

Secure pseudorandom bit generators and point sets with low star-discrepancy.

[BibT_eX]

[DOI]

Friedrich Pillichshammer

J. Comput. Appl. Math., 2021

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

[BibT_eX]

[DOI]

CoRR, 2021

Generalised GMW Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

A Note on the Cross-Correlation of Costas Permutations.

[BibT_eX]

[DOI]

Arne Winterhof

IEEE Trans. Inf. Theory, 2020

On the complexity of exact counting of dynamically irreducible polynomials.

[BibT_eX]

[DOI]

László Mérai

J. Symb. Comput., 2020

Closed-Set-Based Discovery of Representative Association Rules.

[BibT_eX]

[DOI]

Cristina Tîrnauca

José L. Balcázar

Int. J. Found. Comput. Sci., 2020

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

[BibT_eX]

[DOI]

Cryptogr. Commun., 2020

Algebraic dependence in generating functions and expansion complexity.

[BibT_eX]

[DOI]

László Mérai

Adv. Math. Commun., 2020

Multidimensional linear complexity analysis of periodic arrays.

[BibT_eX]

[DOI]

Rafael A. Arce-Nazario

Appl. Algebra Eng. Commun. Comput., 2020

Recursion Polynomials of Unfolded Sequences.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019

A probabilistic analysis on a lattice attack against DSA.

[BibT_eX]

[DOI]

Guénaël Renault

Des. Codes Cryptogr., 2019

2018

On the Expansion Complexity of Sequences Over Finite Fields.

[BibT_eX]

[DOI]

László Mérai

Harald Niederreiter

IEEE Trans. Inf. Theory, 2018

On the linear complexity for multidimensional sequences.

[BibT_eX]

[DOI]

Min Sha

J. Complex., 2018

Global optimality in k-means clustering.

[BibT_eX]

[DOI]

Inf. Sci., 2018

The arithmetic of consecutive polynomial sequences over finite fields.

[BibT_eX]

[DOI]

Min Sha

Finite Fields Their Appl., 2018

Arithmetic Properties of Integers in Chains and Reflections of g-ary Expansions.

[BibT_eX]

[DOI]

Exp. Math., 2018

k-Error linear complexity for multidimensional arrays.

[BibT_eX]

[DOI]

Min Sha

CoRR, 2018

2017

A Probabilistic Analysis on a Lattice Attack against DSA.

[BibT_eX]

[DOI]

Guénaël Renault

CoRR, 2017

Arrays composed from the extended rational cycle.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2017

Editorial.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2017

2016

Common composites of triangular polynomial systems and hash functions.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

Attacks and parameter choices in HIMMO.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

2015

Analyzing collaboration and interaction in learning environments to form learner groups.

[BibT_eX]

[DOI]

Comput. Hum. Behav., 2015

HIMMO: a collusion-resistant identity-based scheme for symmetric key generation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

Multidimensional arrays with maximal linear complexity.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

Linear complexity for multidimensional arrays - a numerical invariant.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

On lattice profile of the elliptic curve linear congruential generators.

[BibT_eX]

[DOI]

Zhixiong Chen

Gottlieb Pirsic

Period. Math. Hung., 2014

Recovering zeros of polynomials modulo a prime.

[BibT_eX]

[DOI]

Math. Comput., 2014

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

[BibT_eX]

[DOI]

Math. Comput., 2014

Mathematical and computer algebra techniques in cryptology.

[BibT_eX]

[DOI]

J. Symb. Comput., 2014

On the Carlitz rank of permutations of Fq and pseudorandom sequences.

[BibT_eX]

[DOI]

Alev Topuzoglu

J. Complex., 2014

HIMMO - A Lightweight, Fully Collusion Resistant Key Pre-Distribution Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Generalized explicit inversive generators of small p-weight degree.

[BibT_eX]

[DOI]

Sara D. Cardell

Finite Fields Their Appl., 2014

The MMO problem.

[BibT_eX]

[DOI]

CoRR, 2014

On the Lattice Structure of Inversive PRNG via the Additive Order.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications - SETA 2014, 2014

The MMO problem.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

On the linear complexity and lattice test of nonlinear pseudorandom number generators.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra and Number Theory, 2014

2013

Predicting masked linear pseudorandom number generators over finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

A method to form learners groups in computer-supported collaborative learning systems.

[BibT_eX]

[DOI]

Rafael Duque Medina

Alicia Nieto-Reyes

Crescencio Bravo Santos

Proceedings of the Technological Ecosystems for Enhancing Multiculturality Conference, 2013

2012

Multiplicative character sums of Fermat quotients and pseudorandom sequences.

[BibT_eX]

[DOI]

Arne Winterhof

Period. Math. Hung., 2012

Connectedness of finite distance graphs.

[BibT_eX]

[DOI]

Networks, 2012

Linear Complexity of Binary Sequences Derived from Polynomial Quotients.

[BibT_eX]

[DOI]

Zhixiong Chen

Proceedings of the Sequences and Their Applications - SETA 2012, 2012

2011

On the linear complexity of the Naor-Reingold sequence.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

2010

An estimate on the number of stable quadratic polynomials.

[BibT_eX]

[DOI]

Alejandro Piñera-Nicolás

Finite Fields Their Appl., 2010

On the linear complexity of the Naor-Reingold sequence with elliptic curves.

[BibT_eX]

[DOI]

Marcos Cruz

Daniel Sadornil

Finite Fields Their Appl., 2010

Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2009

A strategy for recovering roots of bivariate polynomials modulo a prime.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings.

[BibT_eX]

[DOI]

Edwin D. El-Mahassni

Proceedings of the Applied Algebra, 2009

2008

Prediciendo el generador cuadratico (in Spanish)

[BibT_eX]

[DOI]

CoRR, 2008

Multiplicative Character Sums of Recurring Sequences with Rédei Functions.

[BibT_eX]

[DOI]

Arne Winterhof

Proceedings of the Sequences and Their Applications, 2008

2007

Optimal routing in double loop networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Cayley Digraphs of Finite Abelian Groups and Monomial Ideals.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

2006

Attacking the Pollard Generator.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Reconstructing noisy polynomial evaluation in residue rings.

[BibT_eX]

[DOI]

J. Algorithms, 2006

Exponential sums with Dickson polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2006

2005

Predicting nonlinear pseudorandom number generators.

[BibT_eX]

[DOI]

Math. Comput., 2005

Cryptanalysis of the Quadratic Generator.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2005

On Finding a Shortest Path in Circulant Graphs with Two Jumps.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Circulant Digraphs and Monomial Ideals.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2003

Predicting the Inversive Generator.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2003

2001

Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers.

[BibT_eX]

[DOI]