\`x^2+y_1+z_12^34\`
Advanced Search
Advanced Search
Advanced Search
This issue Previous Article Next Article
Article Contents
Article Contents
2010, Volume 4, Issue 3: 369-379. Doi: 10.3934/amc.2010.4.369
This issue Previous Article New linear codes from matrix-product codes with polynomial units Next Article Attribute-based group key establishment

On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences

  • 1.

    Institut für Mathematik, Universität Zürich, Winterthurerstrasse 190 CH-8057, Zürich

  • 2.

    Department of Computing, Macquarie University, NSW 2109

  • 3.

    Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenberger Straße 69, A-4040 Linz

Received:  October 31, 2009
Revised:  January 31, 2010
Published:  July 2010
Abstract Related Papers Cited by
    Abstract
  • Recently, multisequences have gained increasing interest for applications in cryptography and quasi-Monte Carlo methods. We study the (generalized) joint linear complexity of a class of nonlinear pseudorandom multisequences introduced by the first two authors as well as the linear complexity of its coordinate sequences. We prove lower bounds which are much stronger than in the case of single sequences since the multidimensional case brings in new and favourable effects.
    Mathematics Subject Classification: Primary: 65C10; Secondary: 11K45, 94A60.

    Citation:
    shu

    \begin{equation} \\ \end{equation}
    • Related Papers
  • Cited by
  • Access History
  • 加载中
PDF
XML
Export Citation
SHARE
Email to a Friend

Article Metrics

HTML views() PDF downloads(87) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    Site map Copyright © 2023 American Institute of Mathematical Sciences