• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.77-85
• /
• 2002

A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.2
• /
• pp.3-12
• /
• 1999

We introduce feedback registers and definitions of complexity of a register or a sequence generated by it. In the view point of cryptography the linear complexity of an ultimately periodic sequence is important because large one gives an enemy infeasible jobs. We state some results about the linear complexity of sum and product of two LFSRs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.915-920
• /
• 2004

In this paper, we propose the new polyphase sequence with the best nonperiodic autocorrelation property in the viewpoint of the merit factors, which are important criteria for a nonperiodic autocorrelation property. We propose the general implementation of a polyphase sequence generator over an integer residue ring by using a linear feedback shift register(LFSR), in addition, we analyze the linear complexities of polyphase sequences based on the proposed implementation method.

• Communications of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.977-988
• /
• 2022

The Padovan sequence is the third-order linear recurrence (𝓟_n)_n≥0 defined by 𝓟_n = 𝓟_n-2 + 𝓟_n-3 for all n ≥ 3 with initial conditions 𝓟₀ = 0 and 𝓟₁ = 𝓟₂ = 1. In this paper, we investigate a generalization of the Padovan sequence called the k-generalized Padovan sequence which is generated by a linear recurrence sequence of order k ≥ 3. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.2
• /
• pp.391-399
• /
• 2010

In this paper, we introduce the notions of the fuzzy statistical convergence of sequences, the fuzzy statistical Cauchy sequence on a fuzzy normed linear space. And we investigate some properties of the related completeness.

• Journal of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.463-471
• /
• 2000

A central limit theorem is obtained for stationary linear process Xt = aj$\varepsilon$t-j, where {$\varepsilon$t} a strictly stationary associated sequence with Et < and {aj} is a sequence of real numbers with <. A functional central limit theorem is also derived.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.2
• /
• pp.281-286
• /
• 2009

In this paper, we introduce the notion of the complete fuzzy norm on a linear space. And we consider some relations between the fuzzy completeness and ordinary completeness on a linear space.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.268-271
• /
• 2008

In this paper, we introduce the notions of a fuzzy convergence of sequences, fuzzy Cauchy sequence and the related fuzzy completeness on a fuzzy normed linear space. And we investigate some properties relative to fuzzy normed linear spaces. In particular, we prove an equivalent conditions that a fuzzy norm defined on a ordinary normed linear space is fuzzy complete.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.93-101
• /
• 2010

In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.1
• /
• pp.97-103
• /
• 2012

In this paper, we introduce the notion of the statist-cally fuzzy convergent sequence and the statistical fuzzy ${\alpha}$-Cauchy sequence of fuzzy points in a fuzzy normed linear space. And investigate some related properties.