• DocumentCode
    1140178
  • Title

    Decrypting a Stream Cipher Based on J–K Flip-Flops

  • Author

    Rubin, Frank

  • Author_Institution
    Data Systems Division, IBM Corporation
  • Issue
    7
  • fYear
    1979
  • fDate
    7/1/1979 12:00:00 AM
  • Firstpage
    483
  • Lastpage
    487
  • Abstract
    Pless has proposed a stream cipher based on J–K flip-flops that uses 8 linear shift registers with feedback, having a combined length of 97 bits, 4 J–K flip-flops, and a 4-stage cycling counter. The cipher has 2.54 × 1051initial states (keys), and generates a presumably pseudorandom stream whose period is 1.52 × 1029bits. Despite these impressive statistics, it is computationally feasible to solve such a cipher with a known-plaintext attack, using as few as 15 characters
  • Keywords
    Boolean equations; J–K flip-flop; code breaking; cryptography; linear shift register; stream cipher; Communication channels; Computer security; Counting circuits; Cryptography; Data security; Equations; Feedback; Flip-flops; Shift registers; Statistics; Boolean equations; J–K flip-flop; code breaking; cryptography; linear shift register; stream cipher;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1979.1675392
  • Filename
    1675392
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1140178