Description: Based on 256 hex Tarsus, the current 10-digit code is a random selection of large prime numbers, Euler n is 20, can also be higher, and the large prime numbers are randomly generated, and efficient testing. Principles and repeatedly squared Euclidean modulo realization of RSA encryption function implementation using lib package. Source consult my qq 752602563. Individuals to achieve, do not imitate commercial
To Search:
File list (Check if you may need any files):
rsa
...\BigInt.h
...\Debug
...\.....\rsa.exe
...\.....\rsa.ilk
...\.....\rsa.obj
...\.....\rsa.pch
...\.....\rsa.pdb
...\.....\vc60.idb
...\.....\vc60.pdb
...\SeqList.h
...\bigInt.lib
...\file.h
...\mingwen.txt
...\miwen.txt
...\public.h
...\rsa.cpp
...\rsa.dsp
...\rsa.dsw
...\rsa.ncb
...\rsa.opt
...\rsa.plg
...\rsa_alg.h
...\xiaoxiao.txt
...\使用说明.txt
Download