• DocumentCode
    3846547
  • Title

    Computation of low-weight parity-check polynomials

  • Author

    J.D. Golic

  • Volume
    32
  • Issue
    21
  • fYear
    1996
  • Firstpage
    1981
  • Lastpage
    1982
  • Abstract
    It is shown that a method for computing low-weight polynomial multiples based on the birthday paradox cannot work as originally suggested. A probabilistic model is introduced and a modified method is proposed and analysed. The results are important for fast correlation attacks on stream ciphers based on linear feedback shift registers.
  • Keywords
    "Polynomials","Cryptography","Shift registers","Correlation"
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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