Cryptanalysis of Loiss Stream Cipher-Revisited

Lin Ding, Chenhui Jin, Jie Guan and Qiuyan Wang

Journal of Applied Mathematics, 2014, vol. 2014, 1-7

Abstract:

Loiss is a novel byte-oriented stream cipher proposed in 2011. In this paper, based on solving systems of linear equations, we propose an improved Guess and Determine attack on Loiss with a time complexity of 2 231 and a data complexity of 2 68 , which reduces the time complexity of the Guess and Determine attack proposed by the designers by a factor of 2 16 . Furthermore, a related key chosen IV attack on a scaled-down version of Loiss is presented. The attack recovers the 128-bit secret key of the scaled-down Loiss with a time complexity of 2 80 , requiring 2 64 chosen IV s. The related key attack is minimal in the sense that it only requires one related key. The result shows that our key recovery attack on the scaled-down Loiss is much better than an exhaustive key search in the related key setting.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2014/457275.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2014/457275.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:457275

DOI: 10.1155/2014/457275

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().