An extension of binary threshold sequences from Fermat quotients

DOI10.3934/AMC.2016038MaRDI QIDQ340165zbMATH OpenOpenAlexFDO

Authors Xiaoni Du, Chenhuang Wu, Wanyin Wei

Publication date 11 November 2016

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

Full work available at URL https://doi.org/10.3934/amc.2016038

zbMATH Keywords

cryptographylinear complexitypseudorandom sequencesEuler quotientsFermat quotients

Mathematics Subject Classification ID

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

Recommendations

• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
• On the linear complexity of binary threshold sequences derived from Fermat quotients
• Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
• Trace representation and linear complexity of binary sequences derived from Fermat quotients

Cites work

• scientific article; zbMATH DE number 4150268 (Why is no real title available?)
• A search for Wieferich and Wilson primes
• 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 binary sequences derived from Euler quotients with prime-power modulus
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
• Multiplicative character sums of Fermat quotients and pseudorandom sequences
• On Cryptosystems Based on Polynomials and Finite Fields
• On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
• On the linear complexity of binary threshold sequences derived from 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
• The arithmetic of Carmichael quotients

Cited in

(8)

• Linear complexity of new \(q\)-ary generalized cyclotomic sequences of period \(2p^n\)
• A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
• Linear complexity of binary sequences derived from polynomial quotients
• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
• On the linear complexity of binary threshold sequences derived from Fermat quotients
• Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
• Hamming correlation of higher order

This page was built for publication: An extension of binary threshold sequences from Fermat quotients

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