Factorization of determinants over finite fields and application in stream ciphers

DOI10.1007/S12095-008-0005-8MaRDI QIDQ1032496zbMATH OpenOpenAlexWikidataFDO

Authors Nicholas Kolokotronis, Konstantinos Limniotis, N. 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

sequenceslinear complexityfilter functionlinearized polynomialsnormal basesVandermonde determinantsshift register

Mathematics Subject Classification ID

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

Recommendations

• Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
• Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
• scientific article; zbMATH DE number 1024087
• On the linear complexity of nonlinearly filtered pn-sequences
• Global linear complexity analysis of filter keystream generators

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 1740036 (Why is no real title available?)
• scientific article; zbMATH DE number 1394288 (Why is no real title available?)
• scientific article; zbMATH DE number 1406791 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• A partial order on partitions and the generalized Vandermonde determinant
• A wide family of nonlinear filter functions with a large linear span
• Algebraic coding theory
• An analysis of the structure and complexity of nonlinear binary sequence generators
• Analysis and design of stream ciphers
• Explicit inverse of a generalized Vandermonde matrix.
• Generation of binary sequences with controllable complexity
• Linear complexity of periodic sequences: a general theory
• MDS array codes with independent parity symbols
• Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
• Numerical treatment of a generalized Vandermonde system of equations
• On the linear complexity of functions of periodic GF(q) sequences
• On the linear complexity of nonlinearly filtered pn-sequences
• On the linear complexity of the sequences generated by nonlinear filterings
• On the minimal polynomial of the product of linear recurring sequences
• On the singularity of generalised Vandermonde matrices over finite fields
• Products of linear recurring sequences with maximum complexity
• Root counting, the DFT and the linear complexity of nonlinear filtering
• Shift-register synthesis and BCH decoding
• Spectral analysis of families of operator polynomials and a generalized Vandermonde matrix II: The infinite dimensional case
• The companion matrix and Liapunov function for linear multivariable timeinvariant systems
• The factorization of block matrices with generalized geometric progression rows

Cited in

(4)

• Recursive MDS matrices over finite commutative rings
• Almost involutory recursive MDS diffusion layers
• Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants
• Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1032496)