A randomness conserved exponential mapping of a GF(q) m-sequence

Author

Chiu, Jung-Hui ; Huang, Yung-Ho

Author_Institution

Dept. of Electron Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan

fYear

1991

fDate

1-3 Oct 1991

Firstpage

55

Lastpage

58

Abstract

Proposes an exponential nonlinear mapping of the maximum length sequence (M-sequence) over GF(q) which not only increases the linear complexity but also conserves the randomness and period length of the input sequence. For the properly chosen exponent of the exponential operation one-to-one mapping can be obtained to keep the balance, run, and long period properties of the input sequence. Calculations of the linear complexity provided by the exponential nonlinear mapping with the q-ary m-sequence are discussed by the trace representation method and the combinatorial theorem over GF(q)

Keywords

computational complexity; cryptography; random processes; GF(q) m-sequence; combinatorial theorem; input sequence period length; linear complexity; long period properties; maximum length sequence; nonlinear mapping; one-to-one mapping; randomness conserved exponential mapping; trace representation method; Autocorrelation; Character generation; Degradation; Inverters; Linear feedback shift registers; Periodic structures; Polynomials; Random sequences; Sufficient conditions;

fLanguage

English

Publisher

ieee

Conference_Titel

Security Technology, 1991. Proceedings. 25th Annual 1991 IEEE International Carnahan Conference on

Conference_Location

Taipei

Print_ISBN

0-7803-0120-X

Type

conf

DOI

10.1109/CCST.1991.202190

Filename

202190