Chris J. Mitchell (2004) Some observations on the Bit-Search Generator .
Full text access: Open
In this short note an alternative definition of the Bit-Search Generator (BSG) is provided. This leads to a discussion of both the security of the BSG and ways in which it might be modified to either improve its rate or increase its security.
This is a Published version This version's date is: 20/10/2004 This item is peer reviewed
https://repository.royalholloway.ac.uk/items/c6925eda-2a93-ebe9-6c4f-5d3989f0ac21/1/
Deposited by () on 14-Jul-2010 in Royal Holloway Research Online.Last modified on 08-Dec-2010
[1] D. Coppersmith, H. Krawczyk, and Y. Mansour. The shrinking generator.In D. R. Stinson, editor, Advances in Cryptology — CRYPTO ’93, volume773 of Lecture Notes in Computer Science, pages 22–39. Springer-Verlag,Berlin, 1993.[2] S. Golomb. Shift Register Sequences. Aegean Park Press, revised edition,1982.[3] A. Gouget and H. Sibert. The bit-search generator. In The State ofthe Art of Stream Ciphers: Workshop Record, Brugge, Belgium, October2004, pages 60–68, 2004.[4] W. Meier and O. Staffelbach. The self-shrinking generator. In A. DeSantis, editor, Advances in Cryptology — EUROCRYPT ’94, volume 950of Lecture Notes in Computer Science, pages 205–214. Springer-Verlag,Berlin, 1994.[5] R. A. Rueppel. Analysis and design of stream ciphers. Springer-Verlag,Berlin, 1986.