Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus (Q5859634): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Fermat quotients for composite moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear complexity of binary threshold sequences derived from Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity of Binary Sequences Derived from Polynomial Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of Pseudorandom Numbers Derived from Fermat Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive character sums of polynomial quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity of binary sequences derived from Euler quotients with prime-power modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 𝑝-divisibility of Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative character sums of Fermat quotients and pseudorandom sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3480124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟}) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness and Dynamics of Fermat Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The arithmetic of Carmichael quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHARACTER SUMS WITH FERMAT QUOTIENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value set of Fermat quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fermat quotients: exponential sums, value set and primitive roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3062108 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054120500264 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3082410105 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:54, 30 July 2024

scientific article; zbMATH DE number 7334813
Language Label Description Also known as
English
Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
scientific article; zbMATH DE number 7334813

    Statements

    Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus (English)
    0 references
    0 references
    0 references
    19 April 2021
    0 references
    Euler quotient
    0 references
    Legendre function
    0 references
    pseudorandom binary sequences
    0 references
    linear complexity
    0 references
    cryptography
    0 references

    Identifiers