High speed algorithm for implementation of large modular power multiplication
Tian Ying · Information technology newsletter · 2003
The selection of large primes is the key to construct RSA secret key. The production and test of large prime is an important research subject in RSA public key system. The paper discusses the principle of public key cryptography, RSA algorithms, DSA algorithms and the process of cipher and decipher, and analyzes their characters and different applications. Aiming at problem of huge calculation, a better method of data cipher is proposed. Theory and experiment show that the new algorithm obtains higher efficiency.