基本的MILLER-RABIN算法,是密码学学生的基本知识！-Basic Miller-Rabin algorithm is the basic knowledge of cryptography students!

Elliptic curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitzand Victor S. Mi

素数的判定，miller-rabin，sol-str,leman,fermat等。都可以运行，下完自后自己稍微改改就可以用。-Primes judgment, miller-rabin, sol-str, leman, fermat so on. Can run is finished after their own little changed since it can be used.

Miller-Rabin源代码，自己写的密码学作业-Miller-Rabin sources

Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to