On the Randomness of the Editing Generator
Summary :
In their paper, G. Gong and S.Q. Jiang construct a new pseudo-random sequence generator by using two ternary linear feedback shift registers (LFSR). The new generator is called an editing generator which a combined model of the clock-controlled generator and the shrinking generator. For a special case (Both the base sequence and the control sequence are mm-sequence of degree n), the period, linear complexity, symbol distribution and security analysis are discussed in the same article. In this paper, we expand the randomness results of the edited sequence for general cases, we do not restrict the base sequence and the control sequence has the same length. For four special cases of this generator, the randomness of the edited sequence is discussed in detail. It is shown that for all four cases the editing generator has good properties, such as large periods, high linear complexities, large ratio of linear complexity per symbol, and small un-bias of occurrences of symbol. All these properties make it necessary to resist to the attack from the application of Berlekamp-Massey algorithm.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.6 pp.1570-1575
- Publication Date
- 2004/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Enjian BAI, Zhihua NIU, Guozhen XIAO, "On the Randomness of the Editing Generator" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 6, pp. 1570-1575, June 2004, doi: .
Abstract: In their paper, G. Gong and S.Q. Jiang construct a new pseudo-random sequence generator by using two ternary linear feedback shift registers (LFSR). The new generator is called an editing generator which a combined model of the clock-controlled generator and the shrinking generator. For a special case (Both the base sequence and the control sequence are mm-sequence of degree n), the period, linear complexity, symbol distribution and security analysis are discussed in the same article. In this paper, we expand the randomness results of the edited sequence for general cases, we do not restrict the base sequence and the control sequence has the same length. For four special cases of this generator, the randomness of the edited sequence is discussed in detail. It is shown that for all four cases the editing generator has good properties, such as large periods, high linear complexities, large ratio of linear complexity per symbol, and small un-bias of occurrences of symbol. All these properties make it necessary to resist to the attack from the application of Berlekamp-Massey algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_6_1570/_p
Copy
@ARTICLE{e87-a_6_1570,
author={Enjian BAI, Zhihua NIU, Guozhen XIAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Randomness of the Editing Generator},
year={2004},
volume={E87-A},
number={6},
pages={1570-1575},
abstract={In their paper, G. Gong and S.Q. Jiang construct a new pseudo-random sequence generator by using two ternary linear feedback shift registers (LFSR). The new generator is called an editing generator which a combined model of the clock-controlled generator and the shrinking generator. For a special case (Both the base sequence and the control sequence are mm-sequence of degree n), the period, linear complexity, symbol distribution and security analysis are discussed in the same article. In this paper, we expand the randomness results of the edited sequence for general cases, we do not restrict the base sequence and the control sequence has the same length. For four special cases of this generator, the randomness of the edited sequence is discussed in detail. It is shown that for all four cases the editing generator has good properties, such as large periods, high linear complexities, large ratio of linear complexity per symbol, and small un-bias of occurrences of symbol. All these properties make it necessary to resist to the attack from the application of Berlekamp-Massey algorithm.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - On the Randomness of the Editing Generator
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1570
EP - 1575
AU - Enjian BAI
AU - Zhihua NIU
AU - Guozhen XIAO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2004
AB - In their paper, G. Gong and S.Q. Jiang construct a new pseudo-random sequence generator by using two ternary linear feedback shift registers (LFSR). The new generator is called an editing generator which a combined model of the clock-controlled generator and the shrinking generator. For a special case (Both the base sequence and the control sequence are mm-sequence of degree n), the period, linear complexity, symbol distribution and security analysis are discussed in the same article. In this paper, we expand the randomness results of the edited sequence for general cases, we do not restrict the base sequence and the control sequence has the same length. For four special cases of this generator, the randomness of the edited sequence is discussed in detail. It is shown that for all four cases the editing generator has good properties, such as large periods, high linear complexities, large ratio of linear complexity per symbol, and small un-bias of occurrences of symbol. All these properties make it necessary to resist to the attack from the application of Berlekamp-Massey algorithm.
ER -
English
