Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
In this paper, we use the linear cryptanalysis method to study the bias of. Rabbit involving multiple sub-blocks of one keystream block for a distinguishing.
Rabbit is a stream cipher using a 128-bit key. It outputs one keystream block of 128 bits each time, which consists of eight sub-blocks of 16 bits.
Abstract. Rabbit is a stream cipher using a 128-bit key. It outputs one keystream block of 128 bits each time, which consists of eight sub-blocks.
Oct 25, 2010 · Assuming independence between the keystream blocks of Rabbit, we have a distinguishing attack on Rabbit requiring O(2141) keystream blocks.
Rabbit is a stream cipher using a 128-bit key. It outputs one keystream block of 128 bits each time, which consists of eight sub-blocks of 16 bits.
People also ask
For this purpose we show for a mature cube we could easily identify weak subcubes which increase the probability of distinguishing for an unknown secret key. We ...
Rabbit is a stream cipher using a 128-bit key. It outputs one keystream block of 128 bits each time, which consists of eight sub-blocks of 16 bits.
For Rabbit, the best linear attack with complexity 2141 was recently presented. Our synthetic bias analysis yields the improved attack with complexity 2136.
In case of a distinguishing attack, the attacker tries to distinguish a sequence generated by the cipher from a sequence of truly random numbers. A ...
Improved Distinguishing Attack on Rabbit · Yi LuY. Desmedt. Computer Science. ISC. 2010. TLDR. A distinguishing attack on Rabbit requiring O(2141) keystream ...