Algebraic dependence in generating functions and expansion complexity
DOI10.3934/amc.2020022zbMath1453.94052arXiv1905.01079OpenAlexW2971669121WikidataQ127243066 ScholiaQ127243066MaRDI QIDQ2176295
László Mérai, Domingo Gómez-Pérez
Publication date: 4 May 2020
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.01079
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Expansion complexity and linear complexity of sequences over finite fields
- An average bound for character sums with some counter-dependent recurrence sequences
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Guaranteeing the diversity of number generators
- The distribution of irreducible polynomials in several indeterminates
- On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences
- Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators
- Algebraic Functions and Projective Curves
- On the use of expansion series for stream ciphers
- On the Expansion Complexity of Sequences Over Finite Fields
This page was built for publication: Algebraic dependence in generating functions and expansion complexity
