Generalized Joint Linear Complexity of Linear Recurring Multisequences

Date

2008-09-18

Author

MEİDL, WİLFRİED
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

86
views

0
downloads

The joint linear complexity of multisequences is an important security measure for vectorized stream cipher systems. Extensive research has been carried out on the joint linear complexity of N-periodic multisequences using tools from Discrete Fourier transform. Each N-periodic multisequence can be identified with a single N-periodic sequence over an appropriate extension field. It has been demonstrated that the linear complexity of this sequence, the so called generalized joint linear complexity of the multisequence, may be considerably smaller than the joint linear complexity, which is not desirable for vectorized stream ciphers. Recently new methods have been developed and results of greater generality on the joint linear complexity of multisequences consisting of linear recurring sequences have been obtained. In this paper, using these new methods, we investigate the relations between the generalized joint linear complexity and the joint linear complexity of multisequences consisting of linear recurring sequences.

Subject Keywords

Discrete fourier transform , Minimal polynomial, Cipher irreducible , Polynomial stream , Linear complexity

URI

https://hdl.handle.net/11511/40462

DOI

https://doi.org/10.1007/978-3-540-85912-3_24

Collections

Department of Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Joint linear complexity of multisequences consisting of linear recurring sequences Fu, Fang-Wei; Niederreiter, Harald; Özbudak, Ferruh (Springer Science and Business Media LLC, 2009-04-01) The linear complexity of sequences is one of the important security measures for stream cipher systems. Recently, in the study of vectorized stream cipher systems, the joint linear complexity of multisequences has been investigated. In this paper, we study the joint linear complexity of multisequences consisting of linear recurring sequences. The expectation and variance of the joint linear complexity of random multisequences consisting of linear recurring sequences are determined. These results extend the ...
A nested iterative scheme for computation of incompressible flows in long domains Manguoğlu, Murat; Tezduyar, Tayfun E.; Sathe, Sunil (Springer Science and Business Media LLC, 2008-12-01) We present an effective preconditioning technique for solving the nonsymmetric linear systems encountered in computation of incompressible flows in long domains. The application category we focus on is arterial fluid mechanics. These linear systems are solved using a nested iterative scheme with an outer Richardson scheme and an inner iteration that is handled via a Krylov subspace method. Test computations that demonstrate the robustness of our nested scheme are presented.
The complexity of topological conjugacy of pointed Cantor minimal systems Kaya, Burak (2017-05-01) In this paper, we analyze the complexity of topological conjugacy of pointed Cantor minimal systems from the point of view of descriptive set theory. We prove that the topological conjugacy relation on pointed Cantor minimal systems is Borel bireducible with the Borel equivalence relation Delta(+)(R) on R-N defined by x Delta(+)(R)y double left right arrow {x(i):i is an element of N} = {y(i):i is an element of N}. Moreover, we show that Delta(+)(R) is a lower bound for the Borel complexity of topological co...
Algebraic properties of the operations used in block cipher idea Yıldırım, Hamdi Murat; Akyıldız, Ersan; Department of Mathematics (2007) In this thesis we obtain several interesting algebraic properties of the operations used in the block cipher IDEA which are important for cryptographic analyzes. We view each of these operations as a function from $\mathbb Z_{2}^n \times \mathbb Z_{2}^n \to \mathbb Z_{2}^n$. By fixing one of variables $v(z)=\mathbf Z$ in $\mathbb Z_{2}^n \times \mathbb Z_{2}^n$, we define functions $\mathbf {f}_z$ and $\mathbf {g}_z$ from $\mathbb Z_{2}^n$ to $\mathbb Z_{2}^n$ for the addition $\BIGboxplus$ and the multipli...
Conditions for Synchronizability in Arrays of Coupled Linear Systems Tuna, Sezai Emre (2009-10-01) Synchronization in arrays of coupled continuous-time linear systems is studied. Sufficiency of certain conditions for the existence of a synchronizing feedback law are analyzed. It is shown that, for neutrally stable systems that are detectable from their outputs, a linear feedback law exists under which any number of coupled systems synchronize provided that the (directed, weighted) graph describing the interconnection is fixed and connected. An algorithm generating one such feedback law as well as the tra...

Citation Formats

W. MEİDL and F. Özbudak, “Generalized Joint Linear Complexity of Linear Recurring Multisequences,” 2008, vol. 5203, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40462.