Linear complexity of binary sequences derived from Euler quotients with prime-power modulus

DOI10.1016/J.IPL.2012.04.011MaRDI QIDQ436622zbMATHOpenAlexFDO

Authors Xiaoni Du, Zhixiong Chen, Lei Hu

Publication date 25 July 2012

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

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

zbMATH Keywords

cryptographylinear complexityEuler quotientsFermat quotientspseudorandom binary sequences

Mathematics Subject Classification ID

Cryptography (94A60) Bernoulli and Euler numbers and polynomials (11B68) Pseudo-random numbers; Monte Carlo methods (11K45)

Recommendations

• An extension of binary threshold sequences from Fermat quotients
• Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
• On the linear complexity of binary threshold sequences derived from Fermat quotients
• On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
• Linear complexity of binary sequences derived from polynomial quotients

Cites work

• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 4150268 (Why is no real title available?)
• Bounds of multiplicative character sums with Fermat quotients of primes
• Character sums with Fermat quotients
• Fermat quotients for composite moduli
• Fermat quotients: exponential sums, value set and primitive roots
• Linear complexity and related complexity measures
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
• Multiplicative character sums of Fermat quotients and pseudorandom sequences
• On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
• On the value set of Fermat quotients
• On the 𝑝-divisibility of Fermat quotients
• Pseudorandomness and dynamics of Fermat quotients
• Shift-register synthesis and BCH decoding
• Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
• Structure of Pseudorandom Numbers Derived from Fermat Quotients

Cited in

(14)

• Polynomial quotients: Interpolation, value sets and Waring's problem
• Additive character sums of polynomial quotients
• On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
• Trace representation of binary sequences derived from Euler quotients
• Linear complexity of binary sequences derived from polynomial quotients
• On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
• Trace representation of pseudorandom binary sequences derived from Euler quotients
• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• Trace representation of \(r\)-ary sequences derived from Euler quotients with prime-power modulus
• Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
• On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
• Trace Representation and Linear Complexity of Binary $e$th Power Residue Sequences of Period $p$
• An extension of binary threshold sequences from Fermat quotients
• On the k-error linear complexity of binary sequences derived from polynomial quotients

This page was built for publication: Linear complexity of binary sequences derived from Euler quotients with prime-power modulus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436622)