Divide-and-conquer Attack on LZ Chaotic Sequence Cipher Algorithm
Chenhui Jin
Abstract
Chenhui Jin
Abstract
This paper analyzes the security of a chaos-based stream cipher,it is found that the first several key stream bits of this chaotic cipher are not sensitive to the least significant bits of key,the parameter of chaotic mapping is not suitable as a key.Based on this information leaking,a divide-and-conquer attack is presented to decrease the entropy of key,and its effectiveness is confirmed by theoretic analysis and trials.
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.
This paper analyzes the security of a chaos-based stream cipher,it is found that the first several key stream bits of this chaotic cipher are not sensitive to the least significant bits of key,the parameter of chaotic mapping is not suitable as a key.Based on this information leaking,a divide-and-conquer attack is presented to decrease the entropy of key,and its effectiveness is confirmed by theoretic analysis and trials.
Key concepts: Stream cipher, Computer science, Cipher, Key (lock), Divide and conquer algorithms, Chaotic, Running key cipher, Algorithm