New application methods for word-oriented cryptographic primitives
From MaRDI portal
Publication:362307
DOI10.1007/s11432-012-4644-1zbMath1270.94060MaRDI QIDQ362307
Yunying Qu, Guang Zeng, Yang Yang, Chenghui Jin
Publication date: 20 August 2013
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-012-4644-1
94A60: Cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
- 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
- Cryptographic properties of nonlinear pseudorandom number generators
- The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function
- Linear Properties in T-Functions
- Linear Equation on Polynomial Single Cycle T-Functions
- 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
- Revisiting LFSRs for Cryptographic Applications
- Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator
- Fast Software Encryption
- Fast Software Encryption
