Enhancement of Security of Diffie-Hellman Key Exchange Protocol using RSA Cryptography.

Cryptography is related and referred to as the secured transmission of messages amongst the sender and the intended receiver by ensuring confidentiality, integrity, and authentication. Diffie – Hellman (DH) key exchange protocol is a well-known algorithm that would generate a shared secret key among the sender and the intended receiver, and the basis of cryptosystems for using public and private key for encryption and decryption process. But it is severely affected by the Man in the Middle (MITM) attack that would intercept and manipulate thus eavesdropping the shared secret key. This paper proposes a model of integrating the public-key RSA cryptography system with the DH key exchange to prevent the MITM attack. The performance of the proposed work has been compared to the DH Key Exchange algorithm as well as RSA Cryptosystem to conclude for effectiveness of the proposed model.

E-Voting with Hybrid Encryption RSA Algorithm

E-voting system based on and improved from our previous work .E-voting system, referred to as Enhanced note is enhanced with a new protocol design and watchdog hardware device to ensure voter confidentiality and voting accuracy. The watchdog device records all voting transactions to prevent voter frauds.The RSA cryptography algorithm ensures that votes casted are secured, thus maintaining the privacy of votes.The system is such that when the votes are cast on the nodes, the RSA technique encrypts the vote that is sent to the server system using both node and vote identity number.

Message Security Using a Combination of Hill Cipher and RSA Algorithms

The process of exchanging digital messages is increasingly being used due to its easy and practical use. But the process of exchanging digital messages is vulnerable to being tapped by unauthorized people. Cryptography is the study of mathematical techniques related to aspects of information security, such as data confidentiality, data validity, data integrity, and data authentication. With cryptography, the process of exchanging messages between two people can be done securely. Thus, cryptographic techniques are used to overcome security issues when exchanging messages. The methods used in this study are hybrid hill cipher and RSA cryptography. In this study it was shown that hybrid hill cipher cryptography with a 3x3 matrix key and RSA with a 512 bit key can overcome security issues when exchanging data so that messages sent cannot be read by unauthorized people.

High-Performance RNS Modular Exponentiation by Sum-Residue Reduction

Modular exponentiation is fundamental in computer arithmetic and is widely applied in cryptography such as ElGamal cryptography, Diffie-Hellman key exchange protocol, and RSA cryptography. Implementation of modular exponentiation in residue number system leads to high parallelism in computation, and has been applied in many hardware architectures. While most RNS based architectures utilizes RNS Montgomery algorithm with two residue number systems, the recent modular multiplication algorithm with sum-residues performs modular reduction in only one residue number system with about the same parallelism. In this work, it is shown that high-performance modular exponentiation and RSA cryptography can be implemented in RNS. Both the algorithm and architecture are improved to achieve high performance with extra area overheads, where a 1024-bit modular exponentiation can be completed in 0.567 ms in Xilinx XC6VLX195t-3 platform, costing 26,489 slices, 87,357 LUTs, 363 dedicated multipilers of $18\times 18$ bits, and 65 Block RAMs.

Analysis Aryabhata Remainder Theorem On Rivest Shamir Adleman (RSA) Cryptography

Security of RSA cryptography lied in the difficulty of factoring the number p and q bacame the prime factor. The greater the value of p and q used, the better the security level was. However, this could result in a very slow decryption process. The most commonly used and discussed method of speeding up the encryption and decryption process in RSA was the Chinese Remainder Theorem (CRT). Beside that method, there was another method with the same concept with CRT namely Aryabhata Remainder Theorem which was also relevant used in public key cryptography such as RSA. The purpose of this study was to obtain an effective method to RSA especially in the decryption process based on the calculation of the time complexity of computing.