Title :
Decrypting a Stream Cipher Based on J–K Flip-Flops
Author_Institution :
Data Systems Division, IBM Corporation
fDate :
7/1/1979 12:00:00 AM
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;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1979.1675392
