On Some Properties of the Shrinking Generator
Designs, Codes and Cryptography
Improved Cryptanalysis of the Self-Shrinking Generator
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
An efficient cryptosystem Delta for stream cipher applications
Computers and Electrical Engineering
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Modified self-shrinking generator
Computers and Electrical Engineering
Generalization of the self-shrinking generator in the galois field GF(pn)
Advances in Artificial Intelligence
New guess-and-determine attack on the self-shrinking generator
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
New variant of the self-shrinking generator and its cryptographic properties
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
An automatic, time-based, secure pairing protocol for passive RFID
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
| Hi-index | 754.84 |
The self-shrinking generator, a stream cipher due to Meier and Staffelbach (see Advances in Cryptology-EUROCRYPT'94, Berlin, Germany, p.205-14, 1995 and Lecture Notes in Computer Science, vol.950), uses the output of a primitive binary linear-feedback shift register (LFSR) of length n to generate a keystream sequence of period dividing 2n-1 . The article proves that the linear complexity of the keystream is at most 2n-1-(n-2). This confirms the surprising experimental observations of Meier and Staffelbach