文件名称:MillerRabin
介绍说明－－下载内容均来自于网络，请自行研究使用
实验目的
许多密码算法和协议都需要“随机”的大素数，特别是在共享密钥的密码协议中。对于大素数的生成，一个最自然的方法是先生成一个大整数，然后对其进行素性检测。
实验内容与要求
随机选择一个12位的整数n，用Miller-Rabin素性检测算法，测试n是否为素数。
-Purpose of many cryptographic algorithms and protocols need to " random" large prime numbers, particularly in shared secret cryptographic protocols. For the generation of large prime numbers, one of the most natural way is the President into a large integer, then its primality testing. Test content and requirements a 12 randomly selected integer n, with Miller-Rabin primality testing algorithms, test n is prime.
许多密码算法和协议都需要“随机”的大素数，特别是在共享密钥的密码协议中。对于大素数的生成，一个最自然的方法是先生成一个大整数，然后对其进行素性检测。
实验内容与要求
随机选择一个12位的整数n，用Miller-Rabin素性检测算法，测试n是否为素数。
-Purpose of many cryptographic algorithms and protocols need to " random" large prime numbers, particularly in shared secret cryptographic protocols. For the generation of large prime numbers, one of the most natural way is the President into a large integer, then its primality testing. Test content and requirements a 12 randomly selected integer n, with Miller-Rabin primality testing algorithms, test n is prime.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
MR.cpp
Miller-Rabin.cpp