On The Correlation Of Binary M-sequences

Authors:
John Friedlander;Michael Larsen;Daniel Lieman;Igor Shparlinski
Affiliations:
Department of Mathematics, University of Toronto, Toronto, Ontario M5S 3G3, Canada.;Department of Mathematics, University of Missouri, Columbia, MO 65211, USA.;Department of Mathematics, University of Missouri, Columbia, MO 65211, USA.;School of MPCE, Macquarie University, Sydney, NSW 2109, Australia.
Venue:
Designs, Codes and Cryptography
Year:
1999

Sparse polynomial approximation in finite fields

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the Generalised Hidden Number Problem and Bit Security of XTR

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Hidden Number Problem with the Trace and Bit Security of XTR and LUC

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On the singularity of generalised Vandermonde matrices over finite fields

Finite Fields and Their Applications
Security of polynomial transformations of the Diffie-Hellman key

Finite Fields and Their Applications

Hi-index	0.00

We obtain the upper bound O(2^{14n/15}n^{-1/5}) on the number of distinct values of all possiblecorrelation functions between M-sequences of ordern.