On the GF(p) Linear Complexity of Hall's Sextic Sequences and Some Cyclotomic-Set-Based

Klapper (1994) showed that there exists a class of geometric sequences with the maximal possible linear complexity when considered as sequences over $GF(2)$, but these sequences have very low linear complexities when considered as sequences over $GF(p)(p$ is an odd prime). This linear complexity of a binary sequence when considered as a sequence over $GF(p)$ is called $GF(p)$ complexity. This indicates that the binary sequences with high $GF(2)$ linear complexities are inadequate for security in the practical application, while, their $GF(p)$ linear complexities are also equally important, even when the only concern is with attacks using the Berlekamp-Massey algorithm [Massey, J. L., Shift-register synthesis and bch decoding, {\it IEEE Transactions on Information Theory}, {\bf 15}(1), 1969, 122--127]. From this perspective, in this paper the authors study the $GF(p)$ linear complexity of Hall''s sextic residue sequences and some known cyclotomic-set-based sequences.     

Extension of Henrici's method to matrix sequences

In this paper we generalize the definition of linear convergence to matrix sequences. This new definition is used to establish some new results useful to study the new extension of Henrici's method. A convergence theorem, an algorithm for implementation of this method and some numerical examples are given.     

On the Applications of the Linear Recurrence Relationships to Pseudoprimes

We present here some results on the applications of linear recursive sequences of order $2$ to the Fermat pseudoprimes, Fibonacci pseudoprimes, and Dickson pseudoprimes.     

On statistical convergence of difference sequences of fractional order and related Korovkin type approximation theorems

Abstract

Prior to investigating on sequence spaces and their convergence, we study the notion of statistical convergence of difference sequences of fractional order α ∈ ?. As generalizations of previous works, this study includes several special cases under different limiting conditions of α, such as the notion of statistical convergence of difference sequences of zeroth and mth (integer) order. In fact, we study certain new results on statistical convergence via the difference operator Δ^α and interpret them to those of previous works. Also, by using the convergence of Δ^α-summable sequences which is stronger than statistical convergence of difference sequences, we apply classical Bernstein operator and a generalized form of Meyer-Konig and Zeller operator to construct an example in support of our result. Also, we study the rates of Δ^α-statistical convergence of positive linear operators.     

Kronecker Product of Two-dimensional Arrays

Kronecker sequences constructed from short sequences are good sequences for spread spectrum communication systems. In this paper we study a similar problem for two-dimensional arrays, and we determine the linear complexity of the Kronecker product of two arrays, Our result shows that similar good property on linear complexity holds for Kronecker product of arrays.     

The concept of spectral dichotomy for linear difference equations II

This paper is a continuation of a previous one (J. Math. Anal. Appl. 185 (1994), 275–287) in which the concept of spectral dichotomy has been introduced. This new notion of dichotomy has proved to be useful since it allows to apply the well known theory of linear operators to study dynamic properties of nonautonomous linear difference equations. In the present paper we extend our result on the equivalence of the spectral dichotomy and the well known exponential dichotomy to the class of linear differenc equations whose right-hand sides are not necessarily invertible. We furthermore investigate equations on the set of positive integers for which we establish necessary and sufficient conditions for exponential and unifrom stability.     

Linear complexity profile of binary sequences with small correlation measure

Summary A high linear complexity profile is a desirable feature of sequences used for cryptographical purposes. For a given binary sequence we estimate its linear complexity profile in terms of the correlation measure, which was introduced by Mauduit and Sárk?zy. We apply this result to certain periodic sequences including Legendre sequences, Sidelnikov sequences and other sequences related to the discrete logarithm.     

Characterization of 2<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>-periodic binary sequences with fixed 2-error or 3-error linear complexity

The linear complexity of sequences is an important measure of the cryptographic strength of key streams used in stream ciphers. The instability of linear complexity caused by changing a few symbols of sequences can be measured using k-error linear complexity. In their SETA 2006 paper, Fu et al. (SETA, pp. 88–103, 2006) studied the linear complexity and the 1-error linear complexity of 2 ⁿ -periodic binary sequences to characterize such sequences with fixed 1-error linear complexity. In this paper we study the linear complexity and the k-error linear complexity of 2 ⁿ -periodic binary sequences in a more general setting using a combination of algebraic, combinatorial, and algorithmic methods. This approach allows us to characterize 2 ⁿ -periodic binary sequences with fixed 2- or 3-error linear complexity. Using this characterization we obtain the counting function for the number of 2 ⁿ -periodic binary sequences with fixed k-error linear complexity for k = 2 and 3.     

Some Notes on the Linear Complexity of Sidel’nikov-Lempel-Cohn-Eastman Sequences

We continue the study of the linear complexity of binary sequences, independently introduced by Sidel’nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all of these sequences.     

两两NQD序列线性形式的强稳定性

本文研究了两两NQD序列线性形式的强稳定性, 得到了不同分布两两NQD序列具有线性形式强稳定性的充分条件.     

The linear span of the frequency hopping sequences in optimal sets

Frequency hopping (FH) sequences are needed in FH code division multiple access (CDMA) systems. Recently some new constructions of optimal sets of FH sequences were presented. For the anti-jamming purpose, FH sequences are required to have a large linear span. The objective of this paper is to determine both the linear spans and the minimal polynomials of the FH sequences in these optimal sets. Furthermore, the linear spans of the transformed FH sequences by applying a power permutation are also investigated. If the power is chosen properly, the linear span could be very large compared to the length of the FH sequences.     

Further results on stability of normal regions for linear homogeneous functional equations

In this paper we consider the stability of normal regions on the plane, determined by continuous solutions of the linear homogeneous functional inequality in the case where continuous solutions of the corresponding linear functional equation do not depend continuously on initial conditions.     

About computation of the linear complexity of generalized cyclotomic sequences with period p n+1

We propose a computation method for linear complexity of series of generalized cyclotomic sequences with period p ⁿ⁺¹. This method is based on using the polynomial of the classic cyclotomic sequences of period p. We found the linear complexity of generalized cyclotomic sequences corresponding to the classes of biquadratic residues and Hall sequences.     

The Asymptotic Behavior of the Joint Linear Complexity Profile of Multisequences

We prove a conjecture on the asymptotic behavior of the joint linear complexity profile of random multisequences over a finite field. This conjecture was previously shown only in the special cases of single sequences and pairs of sequences. We also establish an asymptotic formula for the expected value of the nth joint linear complexity of random multisequences over a finite field. Some more precise results are shown for triples of sequences.     

Linear recurrence sequences and periodicity of multidimensional continued fractions

Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. We provide a characterization for periodicity of Jacobi–Perron algorithm by means of linear recurrence sequences. In particular, we prove that partial quotients of a multidimensional continued fraction are periodic if and only if numerators and denominators of convergents are linear recurrence sequences, generalizing similar results that hold for classical continued fractions.     

p元扩展序列的线性复杂度

给出了由周期为p~m-1的p元序列导出的周期为p~(em)-1的p元扩展序列的线性复杂度.作为一个实例,计算了扩展Legendre序列的线性复杂度.     

Positivity of linear transformations of mean-starshaped sequences

In this paper, we give the necessary and sufficient conditions for a linear transformation of a mean-starshaped sequence to be positive. Using this result, we obtain the necessary and sufficient conditions for a lower triangular matrix to preserve the mean-starshape of a sequence and we discuss some special cases of linear transformations. Our next result deals with the convergence of a sequence of mean-starshaped sequences to any given mean-starshaped sequence and the positivity of a linear operator on the set of mean-starshaped sequences.     

Synthesis of cryptographic interleaved sequences by means of linear cellular automata

This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular nonlinear sequence generators with cryptographic application can be linearized in terms of simple cellular automata.     

Orthonormal bases associated with multi-knot piecewise linear function sequences on [0, 1)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We investigate two classes of orthonormal bases for L^2（[0, 1）^n）. The exponential parts of those bases are multi-knot piecewise linear functions which are called spectral sequences. We characterize the multi-knot piecewise linear spectral sequences and give an application of the first class of piecewise linear spectral sequences.     

On the boundedness of Lagrange multipliers of the Kuhn-Tucker theorem applied to the problem of Tikhonov function minimization

In the proof of the convergence of sequences of approximations derived by the regularized method of linearization, the Kuhn-Tucker theorem with bounded sequences of Lagrange multipliers is applied to sequences of Tikhonov functions. This paper demonstrates that in the case of three existing forms of constrains: (i) functional inequalities strict at some point, (ii) linear functional inequalities, and (iii) a linear operator equality, there exist bounded sequences of Lagrange multipliers of the Kuhn-Thucker theorem applied to the sequences of Tikhonov functions.