Divide-and-conquer attack on chaotic stream cipher
Zhen Song
Abstract
Zhen Song
Abstract
A chaotic stream cipher,presented by reference [2],is studied.It is found that the firstly several key stream bits are not sensitive to the least significant bits of the key.A divide-and-conquer attack on the stream cipher which could decrease entropy of the key efficiently is proposed.When the length of key is 128,the success rate of the divide-and-conquer attack is 0.9498 and the average complexity is less than 279.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A chaotic stream cipher,presented by reference [2],is studied.It is found that the firstly several key stream bits are not sensitive to the least significant bits of the key.A divide-and-conquer attack on the stream cipher which could decrease entropy of the key efficiently is proposed.When the length of key is 128,the success rate of the divide-and-conquer attack is 0.9498 and the average complexity is less than 279.
Key concepts: Stream cipher, Computer science, Divide and conquer algorithms, Stream cipher attack, Key (lock), Cipher, Chaotic, Running key cipher