Journal
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS
Volume 58, Issue 3, Pages 595-606Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCSI.2010.2073852
Keywords
Chaos; convolutional code; cryptography; error correction
Categories
Funding
- Innovation and Technology Commission [GHP/048/08]
- Research Grants Council, Hong Kong Special Administrative Region, China [RPC07/08.EG22]
Ask authors/readers for more resources
This paper evaluates the security of the generalized chaotic convolutional coder, which is a recently proposed joint error-correction and encryption scheme integrating the chaotic encryption into the convolutional coding. Our results show that the probability of fully recovering the pseudorandom sequence (PRS) controlling the chaotic switches is at least 0.289 under known-plaintext attack, if the number of available plaintext/ciphertext pairs p is equal to the constraint length k of the chaotic convolutional coder. In the case that p = k + e, where e is an element of Z(+), we prove that the probability to fully deduce the PRS is lower bounded by 1 - 2(-e). Furthermore, we propose four types of chosen-plain.text attack with different decoding complexities and efficiencies to fully derive the PRS.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available