This paper proposes a new involutive light-weight block cipher for resource-constraint environments called I-PRESENTTM. The design is based on the Present block cipher which is included in the ISO/IEC 29192 standard o...This paper proposes a new involutive light-weight block cipher for resource-constraint environments called I-PRESENTTM. The design is based on the Present block cipher which is included in the ISO/IEC 29192 standard on lightweight cryptography. The advantage of I-PRESENTTM is that the cipher is involutive such that the encryption circuit is identical to decryption. This is an advantage for environments which require the implementation of both circuits. The area requirement of I-PRESENTTM compares reasonably well with other similar ciphers such as PRINCE.展开更多
Securing digital data from unauthorized access throughout its entire lifecycle has been always a critical concern.A robust data security system should protect the information assets of any organization against cybercr...Securing digital data from unauthorized access throughout its entire lifecycle has been always a critical concern.A robust data security system should protect the information assets of any organization against cybercriminal activities.The Twofish algorithm is one of the well-known symmetric key block cipher cryptographic algorithms and has been known for its rapid convergence.But when it comes to security,it is not the preferred cryptographic algorithm to use compared to other algorithms that have shown better security.Many applications and social platforms have adopted other symmetric key block cipher cryptographic algorithms such as the Advanced Encryption Standard(AES)algorithm to construct their main security wall.In this paper,a new modification for the original Twofish algorithm is proposed to strengthen its security and to take advantage of its fast convergence.The new algorithm has been named Split-n-Swap(SnS).Performance analysis of the new modification algorithm has been performed using different measurement metrics.The experimental results show that the complexity of the SnS algorithm exceeds that of the original Twofish algorithm while maintaining reasonable values for encryption and decryption times as well as memory utilization.A detailed analysis is given with the strength and limitation aspects of the proposed algorithm.展开更多
This paper introduces an Improved RC6(IRC6)cipher for data encryption based on data-dependent rotations.The proposed scheme is designed with the potential of meeting the needs of the Advanced Encryption Standard(AES)....This paper introduces an Improved RC6(IRC6)cipher for data encryption based on data-dependent rotations.The proposed scheme is designed with the potential of meeting the needs of the Advanced Encryption Standard(AES).Four parameters are used to characterize the proposed scheme.These parameters are the size of the word(w)in bits,the number of rounds(r),the length of the secret key(b)in bytes,and the size of the block(L)in bits.The main feature of IRC6 is the variable number of working registers instead of just four registers as in RC6,resulting in a variable block size for plaintext and ciphertext.The IRC6 cipher is designed to improve the robustness against attacks by increasing the diffusion for each round and providing greater security with fewer rounds.The effectiveness of the proposed IRC6 scheme is verified against theoretical attacks.The proposed IRC6 scheme depends on full diffusion and confusion mechanisms regardless of the utilized block size.The proposed IRC6 scheme saves 70%of the encryption time and 64%of the decryption time of RC6.The simulation results prove that the IRC6 achieves a better encryption/decryption time compared to the traditionalRC6.Therefore,the proposed IRC6 is anticipated to fulfill the market needs and system security requirements.展开更多
Asymmetric cryptographic schemes, represe nted by RSA, have bee n show n to be in secure un der quantum computing conditions. Correspondingly, there is a need to study whether the symmetric cryptosystem can still guar...Asymmetric cryptographic schemes, represe nted by RSA, have bee n show n to be in secure un der quantum computing conditions. Correspondingly, there is a need to study whether the symmetric cryptosystem can still guarantee high security with the advent of quantum computers. In this paper, based on the basic principles of classical slide attacks and Simon's algorithm, we take LED-like lightweight block ciphers as research objects to present a security analysis under both classical and quantum attacks, fully considering the influence on the security of the ciphers of adding the round constants. By analyzing the information leakage of round constants, we can introduce the differential of the round constants to propose a classical slide attack on full-round LED-64 with a probability of 1. The analysis result shows that LED-64 is unable to resist this kind of classical slide attack, but that attack method is not applicable to LED-128. As for quantum attacks, by improving on existing quantum attack methods we dem on strate a qua ntum single-key slide attack on LED-64 and a quantum related-key attack on LED- 128, and indicators of the two attack algorithms are analyzed in detail. The attack results show that adding round consta nts does not completely improve the security of the ciphers, and quantum attacks can provide an exp on ential speed-up over the same attacks in the classical model. It further illustrates that the block cipher that is proved to be safe under classical settings is not necessarily secure under quantum conditions.展开更多
文摘This paper proposes a new involutive light-weight block cipher for resource-constraint environments called I-PRESENTTM. The design is based on the Present block cipher which is included in the ISO/IEC 29192 standard on lightweight cryptography. The advantage of I-PRESENTTM is that the cipher is involutive such that the encryption circuit is identical to decryption. This is an advantage for environments which require the implementation of both circuits. The area requirement of I-PRESENTTM compares reasonably well with other similar ciphers such as PRINCE.
文摘Securing digital data from unauthorized access throughout its entire lifecycle has been always a critical concern.A robust data security system should protect the information assets of any organization against cybercriminal activities.The Twofish algorithm is one of the well-known symmetric key block cipher cryptographic algorithms and has been known for its rapid convergence.But when it comes to security,it is not the preferred cryptographic algorithm to use compared to other algorithms that have shown better security.Many applications and social platforms have adopted other symmetric key block cipher cryptographic algorithms such as the Advanced Encryption Standard(AES)algorithm to construct their main security wall.In this paper,a new modification for the original Twofish algorithm is proposed to strengthen its security and to take advantage of its fast convergence.The new algorithm has been named Split-n-Swap(SnS).Performance analysis of the new modification algorithm has been performed using different measurement metrics.The experimental results show that the complexity of the SnS algorithm exceeds that of the original Twofish algorithm while maintaining reasonable values for encryption and decryption times as well as memory utilization.A detailed analysis is given with the strength and limitation aspects of the proposed algorithm.
基金This study was funded by the Deanship of Scientific Research,Taif University Researchers Supporting Project number(TURSP-2020/08),Taif University,Taif,Saudi Arabia.
文摘This paper introduces an Improved RC6(IRC6)cipher for data encryption based on data-dependent rotations.The proposed scheme is designed with the potential of meeting the needs of the Advanced Encryption Standard(AES).Four parameters are used to characterize the proposed scheme.These parameters are the size of the word(w)in bits,the number of rounds(r),the length of the secret key(b)in bytes,and the size of the block(L)in bits.The main feature of IRC6 is the variable number of working registers instead of just four registers as in RC6,resulting in a variable block size for plaintext and ciphertext.The IRC6 cipher is designed to improve the robustness against attacks by increasing the diffusion for each round and providing greater security with fewer rounds.The effectiveness of the proposed IRC6 scheme is verified against theoretical attacks.The proposed IRC6 scheme depends on full diffusion and confusion mechanisms regardless of the utilized block size.The proposed IRC6 scheme saves 70%of the encryption time and 64%of the decryption time of RC6.The simulation results prove that the IRC6 achieves a better encryption/decryption time compared to the traditionalRC6.Therefore,the proposed IRC6 is anticipated to fulfill the market needs and system security requirements.
基金supported by the Foundation of Science and Technology on Information Assurance Laboratory(No.KJ-17-003)
文摘Asymmetric cryptographic schemes, represe nted by RSA, have bee n show n to be in secure un der quantum computing conditions. Correspondingly, there is a need to study whether the symmetric cryptosystem can still guarantee high security with the advent of quantum computers. In this paper, based on the basic principles of classical slide attacks and Simon's algorithm, we take LED-like lightweight block ciphers as research objects to present a security analysis under both classical and quantum attacks, fully considering the influence on the security of the ciphers of adding the round constants. By analyzing the information leakage of round constants, we can introduce the differential of the round constants to propose a classical slide attack on full-round LED-64 with a probability of 1. The analysis result shows that LED-64 is unable to resist this kind of classical slide attack, but that attack method is not applicable to LED-128. As for quantum attacks, by improving on existing quantum attack methods we dem on strate a qua ntum single-key slide attack on LED-64 and a quantum related-key attack on LED- 128, and indicators of the two attack algorithms are analyzed in detail. The attack results show that adding round consta nts does not completely improve the security of the ciphers, and quantum attacks can provide an exp on ential speed-up over the same attacks in the classical model. It further illustrates that the block cipher that is proved to be safe under classical settings is not necessarily secure under quantum conditions.
