Cryptanalysis of a data security protection scheme for VoIP
Li, CQ, Li, SJ, Zhang, D and Chen, G (2006) Cryptanalysis of a data security protection scheme for VoIP IEE Proceedings-Vision, Image & Signal Processing, 153 (1). pp. 1-10.
IEEProcVISP2006.pdf - Accepted version Manuscript
Available under License : See the attached licence file.
A voice-over-Internet protocol technique with a new hierarchical data security protection (HDSP) scheme using a secret chaotic bit sequence has been recently proposed. Some insecure properties of the HDSP scheme are pointed out and then used to develop known/chosen-plaintext attacks. The main findings are: given n known plaintexts, about (100–(50/2n))% of secret chaotic bits can be uniquely determined; given only one specially-chosen plaintext, all secret chaotic bits can be uniquely derived; and the secret key can be derived with practically small computational complexity when only one plaintext is known (or chosen). These facts reveal that HDSP is very weak against known/chosen-plaintext attacks. Experiments are given to show the feasibility of the proposed attacks. It is also found that the security of HDSP against the brute-force attack is not practically strong. Some countermeasures are discussed for enhancing the security of HDSP and several basic principles are suggested for the design of a secure encryption scheme.
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Identification Number :||https://doi.org/10.1049/ip-vis:20045234|
|Related URLs :|
|Additional Information :||This paper is a postprint of a paper submitted to and accepted for publication in IEE Proceedings-Vision, Image & Signal Processing and is subject to Institution of Engineering and Technology Copyright. The copy of record is available at IET Digital Library.|
|Depositing User :||Symplectic Elements|
|Date Deposited :||11 May 2012 19:43|
|Last Modified :||23 Sep 2013 19:26|
Actions (login required)
Downloads per month over past year