RSA is Encrypted Being Hit by Big Prime Numbers's Generating Method and Their Improvement
YE Jian-lon · Journal of Langfang Teachers College · 2010
That RSA encrypts algorithmic security is that very big prime numbers product uses owing to two at present big unable computer level decomposition this one premise's,coming into being two satisfied length call for prime numbers are able to ensure that the encrypted RSA data safety is reliable.And the method the main body of a book being in to algorithmic basal principle of RSA and analysing the parallel various detecting prime number on adding,untying the basis that dense process go along introduces,carries out improvement on individual algorithm.Excellent synthetical various method shortcoming realizes the algorithmic corresponding step having brought forward one kind of new the method generating big safe prime numbers and computer.