Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus

DOI10.1142/S0129054120500264MaRDI QIDQ5859634zbMATHOpenAlexFDO

Authors Xiaoni Du, Lianhua Wang

Publication date 19 April 2021

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054120500264

zbMATH Keywords

cryptographyLegendre functionlinear complexitypseudorandom binary sequencesEuler quotient

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Linear complexity of binary sequences derived from polynomial 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
• An extension of binary threshold sequences from Fermat quotients
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations

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?)
• scientific article; zbMATH DE number 192864 (Why is no real title available?)
• Additive character sums of polynomial quotients
• 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 binary sequences derived from polynomial quotients
• 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 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

(7)

• Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
• Linear complexity of binary sequences derived from polynomial quotients
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
• The Binary Expansion of 1 p
• Linear complexity of pseudorandom sequences based on summation of polynomial quotients
• On the linear complexity of binary threshold sequences derived from Fermat quotients
• An extension of binary threshold sequences from Fermat quotients

This page was built for publication: Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus

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