In this paper, we study the effects of channel errors on security and decoding error probability of three encryption systems where encrypted message is sent and eavesdropped over binary symmetric channels (BSC). The three systems are all based on Data Encryption Standard (DES) in cipher feedback (CFB) mode. They are DES only (DC), DES concatenated with Reed Solomon encoding (DCRS), and DES concatenated with RS coding and S-box diffusion (DCRSS). We adopt linear cryptanalysis to quantitatively measure the effects of channel errors on the security of these systems. We have found the required known cipher-plain text pairs in each system for linear attack launched by Eve, an eavesdropper. In addition, performance analysis in terms of decoded information bit error probability (IBER) for Bob, the legitimate receiver, has been conducted for each system, whose accuracy is later verified by simulation results. Our results suggest there exists tradeoff between communication reliability and security. More security level can be attained by sacrificing the accuracy at the legitimate receiver end, which can be captured by the relationship between IBER and our proposed novel metric, security improvement factor (SIF).

No abstract

No abstract

No abstract

Weak key analysis is a key issue in the design of chaotic ciphers. While most of the existing research focusing on the degradation of the chaotic sequences which causes weak keys, we point out that the parameters for which the chaotic sequences do not degrade are still possible to be weak keys. In this paper, we propose a new approach based on the rigorous statistical test to improve the weak key analysis. The weak keys of a specific chaotic cipher are investigated by using our method and a large number of new weak keys are detected. These results verify that our method is more effective. On the other hand, although statistical tests are now widely adopted to test the chaos-based bit sequences, there are few reports of analysis results on the weak keys or weak sequences of chaotic cipher. Thus our work may be helpful for current research on statistical tests of chaotic cipher.