New application methods for word-oriented cryptographic primitives (Q362307): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6199728 / rank
 
Normal rank
Property / zbMATH Keywords
 
stream cipher
Property / zbMATH Keywords: stream cipher / rank
 
Normal rank
Property / zbMATH Keywords
 
single cycle T-function
Property / zbMATH Keywords: single cycle T-function / rank
 
Normal rank
Property / zbMATH Keywords
 
linear complexity
Property / zbMATH Keywords: linear complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-error linear complexity
Property / zbMATH Keywords: \(k\)-error linear complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986065561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting LFSRs for Cryptographic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Software Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Software Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Equation on Polynomial Single Cycle T-Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Properties in T-Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic properties of nonlinear pseudorandom number generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between linear complexity and k-error linear complexity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:21, 6 July 2024

scientific article
Language Label Description Also known as
English
New application methods for word-oriented cryptographic primitives
scientific article

    Statements

    New application methods for word-oriented cryptographic primitives (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2013
    0 references
    stream cipher
    0 references
    single cycle T-function
    0 references
    linear complexity
    0 references
    \(k\)-error linear complexity
    0 references

    Identifiers