Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations

DOI10.1016/j.ipl.2011.11.017zbMath1242.94023OpenAlexW2089294177MaRDI QIDQ437681

J. Herrera, H. S. Yoon

Publication date: 18 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.017

zbMATH Keywords

finite fieldscryptographylinear complexitypseudorandom sequencesFermat quotientspolynomial quotients

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (13)

Trace representation and linear complexity of binary sequences derived from Fermat quotients ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\) ⋮ An extension of binary threshold sequences from Fermat quotients ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients ⋮ On the linear complexity of binary threshold sequences derived from Fermat quotients ⋮ Linear complexity of binary sequences derived from Euler quotients with prime-power modulus ⋮ Unnamed Item ⋮ On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\) ⋮ Polynomial quotients: Interpolation, value sets and Waring's problem ⋮ Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus ⋮ Additive character sums of polynomial quotients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicative character sums of Fermat quotients and pseudorandom sequences
• A remark on Artin's conjecture
• On primes in arithmetic progression having a prescribed primitive root
• Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
• 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
• Structure of Pseudorandom Numbers Derived from Fermat Quotients
• ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
• On the 𝑝-divisibility of Fermat quotients
• Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
• On the value set of Fermat quotients

This page was built for publication: Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations