Design And Implementation Of A Computing Tool In RSA Public-key Crypto System

RSA can be used for the encryption of the information and also the first encryptionsystem which can be used as digital signature and authentication. The RSA can withstandmost of the attacks toward it, and the safety and resistibility of RSA is affirmed throughthe extensively using. It became a classical one of the encryption/decryption technology.Considering of security, RSA cryptosystem require at least a1024bits key size.RSA cryptogram technology focused on generation of large prime numbers, RSA keypairs, RSA encryption, RSA decryption and analysis on RSA, which includes modulusdecomposition problem. These require large numbers (1024bits or more) basic computingpower. Considering security of RSA, Miller-Rabin filtering method is need to beselectable to a high probability of the probability of primes.To adapt the RSA cryptographic implementation and security analysis needs, takingdeep analysis in RSA-related computing technologies, design and implement a RSAcryptosystem basic computing tool, which has functions of a variety of basic large integerarithmetic, generation of large primes, RSA key-pairs, RSA encryption, RSA decryptionand modular decomposition. The operation data is up to2048bits RSA cryptosystem toachieve the basic requirements of current application, making RSA cryptosystem has ahigher security. Using random incremental search method, prime generation improves thequality of primes by setting times of Miller-Rabin detection. Implement a decryptionalgorithm based on the Chinese remainder theorem, which improve RSA decryption toolefficiency and practicality by reducing the index of mold. RSA basic computing toolachieves the desired function after system test, with makes a great contribution to thefurther research and depth development of the RSA computing tool.