Abstract
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(p k) by taking successive k-tuples of given sequences over GF(p). We are able to characterize those p-ary sequences whose k-tuple versions now over GF(p k) have the maximum possible linear complexities (LCs). Next, we consider the FH/TH sequence generators composed of a combinatorial function generator and some buffers. We are able to characterize the generators whose output FH/TH sequences over GF(p k) have the maximum possible LC for the given algebraic normal form.
This work was supported by grant No.(R01-2003-000-10330-0) from the Basic Research Program of the Korea Science and Engineering Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Golomb, S.W.: Shift Register Sequences, Revised edn. Aegean Park Press, Laguna Hills (1982)
Simon, M.K., Omura, J.K., Scholtz, R.A., Levitt, B.K.: Spread Spectrum Communications Handbook, Revised edn. McGraw-Hill, Inc., New York (1994)
Massey, J.L.: Shift-Register Synthesis and BCH decoding. IEEE Transactions on Information Theory IT-15(1), 122–127 (1969)
Lidl, R., Niederreiter, H.: Finite Fields, 2nd edn. Encyclopedia of Mathematics and Its Applications, vol. 20. Cambridge University Press, Cambridge (1997)
Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)
Chan, A.H., Games, R.A., Key, E.L.: On the Complexities of de Bruijn Sequences. Journal of Combinatorial Theory, Series A 33, 233–246 (1982)
Golomb, S.W., Gong, G.: Signal Design for Good Correlation for Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005)
Park, W.J., Komo, J.J.: Relationships Between m-Sequences over GF(q) and GF(q m). IEEE Transactions on Information Theory 35(1), 183–186 (1989)
Gong, G., Xiao, G.Z.: Synthesis and Uniqueness of m-Sequences over GF(q n) as n-Phase Sequences over GF(q). IEEE Transactions on Communications 42(8), 2501–2505 (1994)
Meidl, W.: Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 101–112. Springer, Heidelberg (2005)
Siegenthaler, T.: Correlation-Immunity of Nonlinear Combining Functions for Cryptographic Applications. IEEE Transactions on Information Theory IT-30(5), 776–780 (1984)
Meier, W., Staffelbach, O.: Nonlinearity Criteria for Cryptographic Functions. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 549–562. Springer, Heidelberg (1990)
Preneel, B., Van Leekwijck, W., Van Linden, L., Govaerts, R., Vandewalle, J.: Propagation Characteristics of Boolean Functions. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 161–173. Springer, Heidelberg (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, YP., Song, HY. (2006). Frequency/Time Hopping Sequences with Large Linear Complexities. In: Ytrehus, Ø. (eds) Coding and Cryptography. WCC 2005. Lecture Notes in Computer Science, vol 3969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779360_30
Download citation
DOI: https://doi.org/10.1007/11779360_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35481-9
Online ISBN: 978-3-540-35482-6
eBook Packages: Computer ScienceComputer Science (R0)