encryption is becoming a vital process to ensure security over the wireless channel. However, using well-known encryption algorithms to encrypt data in wireless communication results in a catastrophic error because of...
详细信息
encryption is becoming a vital process to ensure security over the wireless channel. However, using well-known encryption algorithms to encrypt data in wireless communication results in a catastrophic error because of the avalanche effect, which is an inherited criterion to ensure security. Although this criterion is desirable, these algorithms do not take into account the error characteristics of the wireless channel. Therefore, if an error occurs in the encrypted data over the channel, the decryption process at the receiver results in half the original bits to be in error because of this criterion. Hence, the need for a new secure encryption algorithm that takes into account the error characteristics of the wireless channel becomes necessary. In this paper, we propose a modification to the data encryption standard (DES) to make it secure and immune to errors caused by the wireless channel. We observe that using the modified algorithm in wireless channels improves the bit error rate performance as well as security compared with DES. We consider an additive white Gaussian noise with fading and evaluate the performance of the proposed algorithm in terms of bit error rate. We also show that the proposed algorithm is secure as compared with DES. Copyright (c) 2014 John Wiley & Sons, Ltd.
A secure cryptosystem could be very complicated, time consuming and hard to implement. Therefore, the complexity of the cryptosystem should be taken into account during design and implementation. In this work, the aut...
详细信息
A secure cryptosystem could be very complicated, time consuming and hard to implement. Therefore, the complexity of the cryptosystem should be taken into account during design and implementation. In this work, the authors introduce a comprehensive and platform independent complexity analysis for a class of symmetric block cryptosystems, by which it will be easier to evaluate the performance of some used cryptosystems. Previous works lacked the comprehensiveness in their analysis, due to the fact that the memory access time was completely ignored, which greatly degrades the accuracy of the analysis and limits it to one data block only. In this paper the authors analytically compute the complexity for a class of symmetric cryptosystems in terms of the number of the clock cycles required and in terms of the required time for encryption/decryption, independently of the hardware or software used in the encryption/decryption process. Moreover, this is the first complexity analysis that considers the required time to access and retrieve information from memory, which makes the analysis more comprehensive and accurate than previous work as well as being general for any number of encryption data blocks. In addition, computer simulations are used to truly evaluate the accuracy of the analysis and to show how the analytical results match the simulation results.
Many image encryption schemes based on chaotic iterative maps are very expensive in terms of processing speed. This inconvenient feature causes the inapplicability in real-time processes. Hence, encryption scheme must...
详细信息
ISBN:
(纸本)9781424433391
Many image encryption schemes based on chaotic iterative maps are very expensive in terms of processing speed. This inconvenient feature causes the inapplicability in real-time processes. Hence, encryption scheme must be projected at low-level. This paper proposes hardware solution of image encryption with keeping the high security of encrypted image and speeding up the encryption process.
暂无评论