Recently, Saheed and Gbolagade (2017a) proposed an improved
RSA algorithm based on RNS.
The gateway sends the cipher-text to the tokenization server for decryption using
RSA algorithm with Extended Euclidean Algorithm (EEA)-based private key.
Blowfish algorithm was also said to be the best-suited algorithm for applications were time and memory usage is the primary consideration as compared to DES, T-DES, AES or
RSA algorithms [15].
For
RSA algorithm and Diffie-Hellman key exchange support the architecture should be able to handle precisions up to 4096 bit moduli, for elliptic curve cryptography support precisions up to 512 bits for prime finite fields and precisions up to 571 bits for binary finite fields should be possible.
Just how much more difficult this method is can be seen by noting that the
RSA algorithm would need a 2,380-bit key to be as secure as a 228-bit ECC key.
Take advantage of the
RSA algorithm to calculate the original message summary [2].
In the
RSA algorithm, select two different large prime numbers p and q, and so n= p .q, then the Euler function of n is [phi](n) = (p- 1) (q- 1).
The public key encryption and digital signatures are based on the
RSA algorithm. To maintain the credibility of voters, electronic voting uses blind signatures.
The idea is to study the protection techniques like DES algorithm, AES cipher(Symmetric Algorithm) and
RSA algorithm (Asymmetric Algorithm) to protect the data.
For the invention of the
RSA algorithm for public-key cryptography