• DocumentCode
    969292
  • Title

    An algorithm for the k-error linear complexity of binary sequences with period 2n

  • Author

    Stamp, Mark ; Martin, Clyde F.

  • Author_Institution
    Dept. of Math. Sci., Worcester Polytech. Inst., MA, USA
  • Volume
    39
  • Issue
    4
  • fYear
    1993
  • fDate
    7/1/1993 12:00:00 AM
  • Firstpage
    1398
  • Lastpage
    1401
  • Abstract
    Certain applications require pseudo-random sequences which are unpredictable in the sense that recovering more of the sequence from a short segment must be computationally infeasible. It is shown that linear complexity is useful in determining such sequences. A generalized linear complexity that has application to the security of stream ciphers is proposed, and an efficient algorithm is given for the case in which the sequence is binary with period 2n. This algorithm generalizes an algorithm presented by R.A. Games and A.H. Chan (1983)
  • Keywords
    binary sequences; computational complexity; cryptography; binary sequences; k-error linear complexity; pseudo-random sequences; shift registers; stream ciphers; Binary sequences; Books; Clocks; Cryptography; Linear feedback shift registers; Mathematics; NASA; Polynomials; Random sequences; Security;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.243455
  • Filename
    243455
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=969292