On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-012-9608-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981001466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fermat quotients for composite moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the k-error linear complexity of cyclotomic sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many bits have to be changed to decrease the linear complexity? / 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: A search for Wieferich and Wilson primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autocorrelation values of generalized cyclotomic sequences of order two / 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: 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: Q3216750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness and Dynamics of Fermat Quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180420 / 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: Fermat quotients: exponential sums, value set and primitive roots / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:40, 6 July 2024

scientific article
Language Label Description Also known as
English
On the linear complexity of binary threshold sequences derived from Fermat quotients
scientific article

    Statements

    On the linear complexity of binary threshold sequences derived from Fermat quotients (English)
    0 references
    0 references
    6 May 2013
    0 references
    Fermat quotients
    0 references
    finite fields
    0 references
    binary sequences
    0 references
    linear complexity
    0 references
    cryptography
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references