GMW sequences over Galois rings and their linear complexities

doi:10.1007/s11460-009-0038-6

Front Elect Electr Eng Chin

2009, Vol. 4

Issue (2) : 141-144 https://doi.org/10.1007/s11460-009-0038-6

RESEAHCH ARTICLE

GMW sequences over Galois rings and their linear complexities

Nigang SUN^1,2(

), Lei HU²

1. Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai 200237, China; 2. State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China

Download: PDF(116 KB) HTML
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

Abstract

A new family of GMW sequences over an arbitrary Galois ring was defined by using the trace functions and permutations. This generalizes the concept of GMW sequences over finite fields. Utilizing the Fourier representation, we derived an estimate of the linear complexities of this family of GMW sequences. And the result shows that such sequences have large linear complexities.

Keywords cryptography GMW sequence linear complexity Galois ring

Corresponding Author(s): SUN Nigang,Email:nigsun@ecust.edu.cn

Issue Date: 05 June 2009

Cite this article:

Nigang SUN,Lei HU. GMW sequences over Galois rings and their linear complexities[J]. Front Elect Electr Eng Chin, 2009, 4(2): 141-144.

URL:

https://academic.hep.com.cn/fee/EN/10.1007/s11460-009-0038-6
https://academic.hep.com.cn/fee/EN/Y2009/V4/I2/141

1	Kumar P V. Frequency-hopping code sequence designs having large linear span. IEEE Transactions on Information Theory , 1988, 34(1): 146–151 doi: 10.1109/18.2616
2	Scholtz R A, Welch L R. GMW sequences. IEEE Transactions on Information Theory , 1984, 30(3): 548–553 doi: 10.1109/TIT.1984.1056910
3	Antweiler M, B?mer L. Complex sequences over GF (p^M) with a two-level autocorrelation function and a large linear span. IEEE Transactions on Information Theory , 1992, 38(1): 120–130 doi: 10.1109/18.108256
4	Klapper A, Chan A H, Goresky M. Cascaded GMW sequences. IEEE Transactions on Information Theory , 1993, 39(1): 177–183 doi: 10.1109/18.179353
5	Chung H, No J S. Linear span of extended sequences and cascaded GMW sequences. IEEE Transactions on Information Theory , 1999, 45(6): 2060–2065 doi: 10.1109/18.782136
6	Zhu J K, Li S P. P-ary GMW sequences. Journal of China University of Science and Technology , 1991, 21(4): 433–446 (in Chinese)
7	No J S. Generalization of GMW sequences and No sequences. IEEE Transactions on Information Theory , 1996, 42(1): 260–262 doi: 10.1109/18.481799
8	Gong G. Q-ary cascaded GMW sequences. IEEE Transactions on Information Theory , 1996, 42(1): 263–267 doi: 10.1109/18.481800
9	Udaya P, Siddiqi M U. Generalized GMW quadriphase sequences satisfying the Welch bound with equality. Applicable Algebra in Engineering, Communication and Computing , 2000, 10(3): 203–225 doi: 10.1007/s002000050125
10	McDonald B R. Finite Rings With Identity. New York: MarcelDekker, 1974
11	Wan Z X. Lectures on Finite Fields and Galois Rings. Singapore: World Scientific Publisher, 2003
12	Wan Z X. Algebra and Coding Theory. Beijing: Science Press, 1976 (in Chinese)
13	Golomb S W, Gong G. Signal Design for Good Correlation: For Wireless Communication, Cryptography and Radar. Cambridge: Cambridge University Press, 2005

[1]	Raymond W. YEUNG, . Network coding theory: An introduction[J]. Front. Electr. Electron. Eng., 2010, 5(3): 363-390.
[2]	MA Weiju, FENG Dengguo. Clock-controlled key-stream generator and its cryptographic properties[J]. Front. Electr. Electron. Eng., 2008, 3(3): 327-332.

Viewed

Full text

Abstract

Cited

Shared

Discussed