• DocumentCode
    1393729
  • Title

    Bound for linear complexity of BBS sequences [comment]

  • Author

    Murphy, S.

  • Author_Institution
    Inf. Security Group, London Univ., UK
  • Volume
    34
  • Issue
    11
  • fYear
    1998
  • fDate
    5/28/1998 12:00:00 AM
  • Firstpage
    1057
  • Lastpage
    1058
  • Abstract
    For original paper see ibid., vol. 34, p. 450-51 (1998). A lower bound was given for the linear complexity of Blum-Blum-Shubb sequences. This result is shown to be incorrect
  • Keywords
    binary sequences; computational complexity; polynomials; BBS sequences; Blum-Blum-Shubb sequences; linear complexity bound; polynomials;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19980770
  • Filename
    683788
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1393729