A family of keystream generators with large linear complexity (Q5938956): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of binary sequences with controllable complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the structure and complexity of nonlinear binary sequence generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the linear span of bent sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity and Random Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Complexity of Periodic Sequences: A General Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Root counting, the DFT and the linear complexity of nonlinear filtering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of shift register based keystream generators / rank
 
Normal rank

Latest revision as of 19:12, 3 June 2024

scientific article; zbMATH DE number 1631172
Language Label Description Also known as
English
A family of keystream generators with large linear complexity
scientific article; zbMATH DE number 1631172

    Statements

    A family of keystream generators with large linear complexity (English)
    0 references
    7 August 2001
    0 references
    0 references
    cryptography
    0 references
    pseudorandom sequence generators
    0 references
    shift register
    0 references
    keystream generators
    0 references
    large linear complexity
    0 references
    correlation attacks
    0 references