New Variant of the Self-Shrinking Generator and Its Cryptographic Properties
نویسندگان
چکیده
◈ well-known keystream generator ◈ proposed by Coppersmith, Krawczyk and Mansour [Crypto 93] ◈ use two LFSRs A and S. – Let a 0 , a 1 , … denote the sequence generated by A. – Let s 0 , s 1 , … denote the sequence generated by S. ◈ The resultant sequence is a " shrunken " version of the first one. ◈ modified version of Shrinking Generator ◈ proposed by Meier and Staffelbach [Eurocrypt 94] ◈ use only one LFSR A. – Let a 0 , a 1 , … denote the sequence generated by A. ◈ Output generation rule – If a 2i = 1 then output a 2i+1 , otherwise discard a 2i+1 .
منابع مشابه
Software Implementation of P−adic Self−shrinking Generator for Aerospace Cryptographic Systems
To be suitable for use in aerospace cryptographic systems software-oriented stream ciphers must be fast, uniform, scalable, consistent and unpredictable. With regard in the paper the software implementation of a fast stream cipher, named Self−Shrinking p−adic Generator which produces 8 bits (SSPG-8) in one clock cycle, is proposed. The theoretical base of Self-Shrinking p-adic Generator is reca...
متن کاملN-adic Summation-Shrinking Generator. Basic properties and empirical evidences
The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new Pseudo Random Number Generator (PRNG), named N-adic Summation-Shrinking (NSumSG), which architecture is described in this paper. It uses N-1 parallel working slave summation generators and one N-adic summation generator, controlling the nonlinearity in the generator....
متن کاملImproved Cryptoanalysis of the Self-shrinking P-adic Cryptographic Generator
The Self-shrinking p-adic cryptographic generator (SSPCG) is a fast software stream cipher. Improved cryptoanalysis of the SSPCG is introduced. This cryptoanalysis makes more precise the length of the period of the generator. The linear complexity and the cryptography resistance against most recently used attacks are invesigated. Then we discuss how such attacks can be avoided. The results show...
متن کاملThe Bit-Search Generator
We present the construction of a pseudorandom generator, that we call the Bit-Search Generator (BSG), based on a single input sequence. The construction is related to the so-called Self-Shrinking Generator which is known for its simplicity (conception and implementation-wise) linked with some interesting properties. After presenting the general running, we give a description of the BSG by using...
متن کاملXSA-strengthening: Strengthening MD5 and Other Iterated Hash Functions Through Variable-length External Message Expansion
In recent years, it has been demonstrated that collisions can be systematically constructed for some popular cryptographic hash algorithms, such as MD5 and SHA-1. Various ways of enhancing these hash functions via message pre-processing or external message expansion have been proposed to make them resistant to known collision attacks. Message preprocessing/expansion is a way of creating a new h...
متن کامل