Distinguishing attack on SOBER-128 with linear masking
Cho, Joo Yeon & Pieprzyk, Josef (2006) Distinguishing attack on SOBER-128 with linear masking. Information Security and Privacy : Information Security and Privacy, 4058, pp. 29-39.
We present a distinguishing attack against SOBER-128 with linear masking. We found a linear approximation which has a bias of 2^− − 8.8 for the non-linear filter. The attack applies the observation made by Ekdahl and Johansson that there is a sequence of clocks for which the linear combination of some states vanishes. This linear dependency allows that the linear masking method can be applied. We also show that the bias of the distinguisher can be improved (or estimated more precisely) by considering quadratic terms of the approximation. The probability bias of the quadratic approximation used in the distinguisher is estimated to be equal to O(2^− − 51.8), so that we claim that SOBER-128 is distinguishable from truly random cipher by observing O(2^103.6) keystream words.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||Paper presented in the 11th Australasian Conference, ACISP 2006, Melbourne, Australia, July 3-5, 2006.|
|Divisions:||Current > QUT Faculties and Divisions > Science & Engineering Faculty|
|Deposited On:||07 Jul 2014 01:07|
|Last Modified:||07 Jul 2014 23:36|
Repository Staff Only: item control page