On the linear complexity of binary threshold sequences derived from Fermat quotients (Q1949234)

From MaRDI portal
Revision as of 16:45, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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