Abstract
Welch-Gong (WG) transformation sequences are binary sequences of period 2n. 1 with 2-level auto correlation. These sequences were discovered by Golomb, Gong and Gaal in 1998 and verified for 5 ≤ n ≤ 20. Later on, No, Chung and Yun found another way to construct the WG sequences and verified their result for 5 ≤ n ≤ 23. Dillon first proved this result for odd n in 1998, and finally, Dobbertin and Dillon proved it for even n in 1999. In this paper, we investigate a two-faced property of the WG transformation sequences for application in stream ciphers and pseudo-random number generators. One is to present randomness or unpredictability of the WG transformation sequences. The other is to exhibit the security property of the WG transformations regarded as Boolean functions. It is shown that the WG transformation sequences, in addition to the known 2-level auto correlation, have threelevel cross correlation with m-sequences, large linear ! span increasing exponentially with n and efficient implementation. Thus this is the first type of pseudo-random sequences with good correlation and statistic properties, large linear span and efficient implementation. When the WG transformation are regarded as Boolean functions, it is proved that they have high nonlinearity. A criterion for whether the WG transformations regarded as Boolean functions are r-resilient is derived. It is shown that the WG transformations regarded as Boolean functions have large linear span (this concept will be defined in this paper) and high degree.
Chapter PDF
Similar content being viewed by others
Key words:
References
Xingong Chang, Zongduo Dai and Guang Gong, Some cryptographic properties of exponential functions, Advances in Cryptology-AsiaCrypt’94, Lecture Notes in Computer Science, No. 917, Springer-Verlag, 1994, pp. 415–418.
John Dillon, Multiplicative difference sets via additive characters, Designs, Codes and Cryptography. 17 (1999), no. 1–3, 225–235.
H. Dobbertin, Kasami power functions, permutation polynomials and cyclic difference sets, Proceedings of the NATO-A.S.I. Workshop “Difference sets, sequences and their correlation properties”, Bad Windsheim, August 3–14, 1998, Kluwer, Dordrecht, pp. 133–158, 1999.
J. Dillon and H. Dobbertin, New cyclic difference sets with Springer parameters, preprint, August 1999.
S.W. Golomb, Shift Register Sequences, Revised Edition, Aegean Park Press, 1982, pp. 39.
G. Gong, P. Gaal and S.W. Golomb, A suspected infinity class of cyclic Hadamard difference sets, the Proceedings of 1997 IEEE Information Theory Workshop, July 6–12, 1997, Longyearbyen, Svalbard, Norway.
G. Gong and A. M. Youssef, On Welch-Gong Transformation Sequence Generators, Technical report, University of Waterloo, CORR 2000-30, May 2000, http://www.cacr.math.uwaterloo.ca/techreports/2000.
R. Gold, Maximal recursive sequences with 3-valued recursive cross-correlation functions, IEEE Trans. on Inform. Theory, January 1968, pp. 154–156.
G. Gong, Lecture notes, http://cacr.math.uwaterloo.ca/~ggong/CO739x/739xcover.html
G. Gong and S.W. Golomb, Transform domain analysis of DES, IEEE Trans. on Inform. Theory, vol. 45, No.6, September 1999, pp. 2065–2073.
R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, Volume 20, Addison-Wesley, 1983.
J.S. No, S.W. Golomb, G. Gong, H.K. Lee, and P. Gaal, New binary pseudorandom sequences of period 2n-1 with ideal autocorrelation, IEEE Trans. on Inform. Theory, vol. 44, No. 2, March 1998, pp.814–817.
F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company, 1977.
A. Maschietti, Difference sets and hyperovals, Designs, Codes and Cryptography, 14, pp. 89–98, 1998.
J. M. Massey, Shift register synthesis and BCH decoding, IEEE transactions on Information Theory. Vol. 15, no. 1, pp. 122–127, January, 1969.
Jong-Seon No, Hagong Chung and Min-Seon Yin, Binary pseudo-random sequences of period 2m-1 with ideal autocorrelation generated by the polynomial z d+(z+1)d, IEEE Trans. Inform. Theory, vol. 44, no. 3, 1998, pp.1278–1282.
R.A. Rueppel, Analysis and Design of Stream Ciphers, Springe-Verlag, 1986, pp.53.
T. Siegenthaler, Correlation-immunity of nonlinear combining functions for cryptographic applications, IEEE Trans. on Inform. Theory, vol. IT-30, No. 5, September 1984, pp.776–780.
A.F. Webster and S.E. Tavares, On the design of S-boxes, Advances in Cryptology-Crypto’85, Lecture Notes in Computer Science, No. 218, Springer-Verlag, 1985, pp. 523–534.
Guozheng Xiao and James Massey, A spectral characterization of correlation immune combining functions, IEEE Trans. on Inform. Theory, vol. 34, No. 3, May 1988, pp.569–571.
A. M. Youssef and G. Gong, On the interpolation attacks on block ciphers, Proceedings of Fast Software Encryption 2000, April 13–14, 2000, New York, Lecture Notes in computer science, to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gong, G., Youssef, A.M. (2001). On Welch-Gong Transformation Sequence Generators. In: Stinson, D.R., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2000. Lecture Notes in Computer Science, vol 2012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44983-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-44983-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42069-9
Online ISBN: 978-3-540-44983-6
eBook Packages: Springer Book Archive