New application methods for word-oriented cryptographic primitives
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1979303 (Why is no real title available?)
- scientific article; zbMATH DE number 2095529 (Why is no real title available?)
- A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.)
- A relationship between linear complexity and k-error linear complexity
- Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator
- Cryptographic properties of nonlinear pseudorandom number generators
- Fast Software Encryption
- Fast Software Encryption
- Linear Equation on Polynomial Single Cycle T-Functions
- Linear Properties in T-Functions
- On minimal polynomials over \(\mathbb F_{q^m}\) and over \(\mathbb F_q\) of a finite-length sequence over \(\mathbb F_{q^m}\)
- Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers
- Revisiting LFSRs for Cryptographic Applications
- The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
This page was built for publication: New application methods for word-oriented cryptographic primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q362307)