Factorization of determinants over finite fields and application in stream ciphers
type: Item
instance of: scholarly article
title: Factorization of determinants over finite fields and application in stream ciphers
zbMATH Open document ID: 1178.94178
author: Nicholas Kolokotronis
author: Konstantinos Limniotis
author: N. Kalouptsidis
published in: Cryptography and Communications
publication date: 2009-10-26T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 5620537
zbMATH Keywords: sequences
zbMATH Keywords: filter function
zbMATH Keywords: linear complexity
zbMATH Keywords: shift register
zbMATH Keywords: linearized polynomials
zbMATH Keywords: normal bases
zbMATH Keywords: Vandermonde determinants
Wikidata QID: Q122751058
MaRDI profile type: Publication
full work available at URL: s12095-008-0005-8
OpenAlex ID: W2145060516
cites work: Algebraic coding theory
cites work: MDS array codes with independent parity symbols
cites work: Q4330621
cites work: A wide family of nonlinear filter functions with a large linear span
cites work: Explicit inverse of a generalized Vandermonde matrix.
cites work: On the linear complexity of the sequences generated by nonlinear filterings
cites work: Spectral analysis of families of operator polynomials and a generalized Vandermonde matrix II: The infinite dimensional case
cites work: On the linear complexity of functions of periodic GF(q) sequences
cites work: Q5684568
cites work: Q4934701
cites work: On the minimal polynomial of the product of linear recurring sequences
cites work: Generation of binary sequences with controllable complexity
cites work: An analysis of the structure and complexity of nonlinear binary sequence generators
cites work: On the linear complexity of nonlinearly filtered pn-sequences
cites work: Q5690468
cites work: Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
cites work: Q4328336
cites work: Q4146667
cites work: Shift-register synthesis and BCH decoding
cites work: Q4940707
cites work: Linear Complexity of Periodic Sequences: A General Theory
cites work: Root counting, the DFT and the linear complexity of nonlinear filtering
cites work: The companion matrix and Liapunov function for linear multivariable timeinvariant systems
cites work: Analysis and design of stream ciphers
cites work: Products of linear recurring sequences with maximum complexity
cites work: On the singularity of generalised Vandermonde matrices over finite fields
cites work: A partial order on partitions and the generalized Vandermonde determinant
cites work: Numerical treatment of a generalized Vandermonde system of equations
cites work: The factorization of block matrices with generalized geometric progression rows
DOI: 10.1007/S12095-008-0005-8
description: scientific article; zbMATH DE number 5620537