2 Hits in 1.9 sec

Algebraic Attacks on SOBER-t32 and SOBER-t16 without Stuttering [chapter]

Joo Yeon Cho, Josef Pieprzyk
2004 Lecture Notes in Computer Science  
This paper presents algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. For unstuttered SOBER-t32, two different attacks are implemented.  ...  The complexity of attack is around O(2 100 ) with 2 92 keystream observations. The second algebraic attack is applicable to SOBER-t16 without stuttering.  ...  Acknowledgment We are grateful to Greg Rose, Frederik Armknecht and unknown referees for their very helpful comments.  ... 
doi:10.1007/978-3-540-25937-4_4 fatcat:phbyklgu6vcrjk3nypm6gslyc4

Algebraic analysis of the SSS stream cipher

Mufeed Juma ALMashrafi, Kenneth Koon-Ho Wong, Leonie Simpson, Harry Bartlett, Ed Dawson
2011 Proceedings of the 4th international conference on Security of information and networks - SIN '11  
In this paper we show that the algebraic attack method previously applied to SOBER-t32 is prevented from succeeding on SSS by the use of the keydependent substitution box (SBox) in the nonlinear filter  ...  Both the SSS and SOBER-t32 stream cipher designs use a single word-based shift register and a nonlinear filter function to produce keystream.  ...  As the algebraic attack on SOBER-t32 without stuttering [3] was successful, and the two ciphers have similar designs (and SSS does not employ stuttering), we have attempted to modify the SOBER-t32 attack  ... 
doi:10.1145/2070425.2070457 dblp:conf/sin/ALMashrafiWSBD11 fatcat:bgxfyenqq5esrgqhpsdhgsv3qm