Design of Hybrid Encryption Algorithm using AES and RSA for key exchange

Reshma Nadaf, Satish Bhairannawar
Page No: 1-11
Download PDFAbstract:
Nowadays, security of any confidential data which is being transmitted over a communication channel has become a primary concern. Encryption and decryption techniques are used to achieve confidentiality of sensitive information which is transmitted over channel. Symmetric cryptography faces a key exchange problem between transmitter and receiver. This research paper introduces a novel approach to address the key exchange issue which is encountered in symmetric encryption. In this paper, Advanced Encryption Standard (AES) from symmetric cryptography and Rivest Shaamir Adleman (RSA) algorithms from asymmetric cryptography are analyzed and a new key exchange protocol is developed by combining above said two algorithms to obtain Hybrid cryptography. This protocol achieves 3 major cryptographic primitives: integrity, authentication and confidentiality. The proposed hybrid encryption algorithm is simulated on Xilinx ISE 14.7. The proposed technique gives better security as it overcomes the problem of key exchange.

Citations

APA: Reshma Nadaf, Satish Bhairannawar (2025). Design of Hybrid Encryption Algorithm using AES and RSA for key exchange. DOI: 10.86493/OTJ.2433401

AMA: Reshma Nadaf, Satish Bhairannawar. Design of Hybrid Encryption Algorithm using AES and RSA for key exchange. 2025. DOI: 10.86493/OTJ.2433401

Chicago: Reshma Nadaf, Satish Bhairannawar. "Design of Hybrid Encryption Algorithm using AES and RSA for key exchange." Published 2025. DOI: 10.86493/OTJ.2433401

IEEE: Reshma Nadaf, Satish Bhairannawar, "Design of Hybrid Encryption Algorithm using AES and RSA for key exchange," 2025, DOI: 10.86493/OTJ.2433401

ISNAD: Reshma Nadaf, Satish Bhairannawar. "Design of Hybrid Encryption Algorithm using AES and RSA for key exchange." DOI: 10.86493/OTJ.2433401

MLA: Reshma Nadaf, Satish Bhairannawar. "Design of Hybrid Encryption Algorithm using AES and RSA for key exchange." 2025, DOI: 10.86493/OTJ.2433401