Paper 2003/139 Original: eprint.iacr.org/2003/139 ↗
On the Randomness of the Editing Generator
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 a suitable crypto-generator for stream cipher applications.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2003-07-20: last updated
- 2003-07-20: published
- Short URL
- https://ia.cr/2003/139
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2003/139,
author = {Enjian Bai and Guozhen Xiao},
title = {On the Randomness of the Editing Generator},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/139},
year = {2003},
url = {https://eprint.iacr.org/2003/139}
}