On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients

DOI10.3934/amc.2018047zbMath1402.94047arXiv1803.03339OpenAlexW2790019251MaRDI QIDQ1620976

Pinhui Ke, Vladimir Edemskiy, Zhixiong Chen, Chenhuang Wu

Publication date: 15 November 2018

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.03339

zbMATH Keywords

cryptographylinear complexityEuler quotients\(k\)-error linear complexitypseudorandom binary sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (2)

ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS ⋮ Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients

Cites Work

• Unnamed Item
• The arithmetic of Carmichael quotients
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
• Multiplicative character sums of Fermat quotients and pseudorandom sequences
• On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
• Trace representation of pseudorandom binary sequences derived from Euler quotients
• The stability theory of stream ciphers
• Fermat quotients for composite moduli
• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• New generalized cyclotomic binary sequences of period \(p^2\)
• Distribution of values of polynomial Fermat quotients
• On the linear complexity of binary threshold sequences derived from Fermat quotients
• On the divisibility of Fermat quotients
• The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
• Additive character sums of polynomial quotients
• BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES
• Pseudorandomness and Dynamics of Fermat Quotients
• CHARACTER SUMS WITH FERMAT QUOTIENTS
• Fermat quotients: exponential sums, value set and primitive roots
• Short character sums with Fermat quotients
• Structure of Pseudorandom Numbers Derived from Fermat Quotients
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Interpolation of Fermat Quotients
• On the k-error linear complexity of binary sequences derived from polynomial quotients
• On the value set of Fermat quotients

This page was built for publication: On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients