Factorization of determinants over finite fields and application in stream ciphers

DOI10.1007/s12095-008-0005-8zbMath1178.94178OpenAlexW2145060516WikidataQ122751058 ScholiaQ122751058MaRDI QIDQ1032496

Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis

Publication date: 26 October 2009

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-008-0005-8

zbMATH Keywords

sequences normal bases shift register linear complexity filter function linearized polynomials Vandermonde determinants

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06)

Related Items (2)

Almost involutory recursive MDS diffusion layers ⋮ Recursive MDS matrices over finite commutative rings

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the linear complexity of the sequences generated by nonlinear filterings
A wide family of nonlinear filter functions with a large linear span
Analysis and design of stream ciphers
Numerical treatment of a generalized Vandermonde system of equations
Spectral analysis of families of operator polynomials and a generalized Vandermonde matrix II: The infinite dimensional case
Root counting, the DFT and the linear complexity of nonlinear filtering
Explicit inverse of a generalized Vandermonde matrix.
The factorization of block matrices with generalized geometric progression rows
On the singularity of generalised Vandermonde matrices over finite fields
A partial order on partitions and the generalized Vandermonde determinant
On the minimal polynomial of the product of linear recurring sequences
The companion matrix and Liapunov function for linear multivariable timeinvariant systems
Products of linear recurring sequences with maximum complexity
Linear Complexity of Periodic Sequences: A General Theory
Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
On the linear complexity of nonlinearly filtered pn-sequences
On the linear complexity of functions of periodic GF(q) sequences
An analysis of the structure and complexity of nonlinear binary sequence generators
MDS array codes with independent parity symbols
Shift-register synthesis and BCH decoding
Generation of binary sequences with controllable complexity

This page was built for publication: Factorization of determinants over finite fields and application in stream ciphers