The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1979 vol.28)
pp: 483-487
F. Rubin , Data Systems Division, IBM Corporation
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 ? 10<sup>51</sup>initial states (keys), and generates a presumably pseudorandom stream whose period is 1.52 ? 10<sup>29</sup>bits. Despite these impressive statistics, it is computation
INDEX TERMS
stream cipher, Boolean equations, code breaking, cryptography, J?K flip-flop, linear shift register
CITATION
F. Rubin, "Decrypting a Stream Cipher Based on J?K Flip-Flops", IEEE Transactions on Computers, vol.28, no. 7, pp. 483-487, July 1979, doi:10.1109/TC.1979.1675392
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool