Location:
Search - millerrabin
Search list
Description: 密码学中的Miller Rabin素性检测算法。人工编写，用这个来学习或者是交作业，绝对是过关利器。-Cryptography Miller Rabin primality testing algorithm. Artificial preparation, use this to learn or交作业is definitely a sharp object boundary.
Platform: |
Size: 109568 |
Author: maowu |
Hits:
Description: Miller rabin素性检测算法源代码-Miller R
Platform: |
Size: 2048 |
Author: anybodys |
Hits:
Description: 该源代码通过使用Eratosthenes和MillerRabin实现素性检测，是实现数据加密，数字签名等功能的有机成分-The source code is achieved by using the Eratosthenes and MillerRabin primality testing is to achieve data encryption, digital signature and other features of organic compounds
Platform: |
Size: 4924416 |
Author: nick |
Hits:
Description: Miller Rabin素数测试，可以在O（1）时间复杂度内测试大素数，使用随机化思想-Miller Rabin prime test
Platform: |
Size: 535552 |
Author: liuyulei |
Hits:
Description: 一种大素数测试源码，对于加密算法中大素数的生成与检测有很大应用。-A large prime number test source code, encryption algorithm for the generation of large prime numbers is very application and detection
Platform: |
Size: 8192 |
Author: 王晓 |
Hits:
Description: java实现的检测大素数 已经测试可用，请放心下载-java implementation of the detection test can have a large prime number, please be assured Download
Platform: |
Size: 1024 |
Author: dff |
Hits:
Description: 素性检测的miller-rabin算法-Primality testing
Platform: |
Size: 27648 |
Author: weidong |
Hits:
Description: 使用c++编写的kmp算法来判断字符串匹配问题，字符串中素数判定使用millerrabin算法，经试验匹配准确率为100 -Use c++ to write the kmp algorithm to determine the string matching problem, string primes decision millerrabin algorithm, the test match accuracy was 100
Platform: |
Size: 3072 |
Author: 冒佳明 |
Hits:
Description: 使用c++编写的lasVegas算法来判断字符串匹配问题，字符串中素数判定使用millerrabin算法-Use c++ written lasVegas algorithm to determine the string matching, string in primality use the millerrabin algorithm
Platform: |
Size: 3072 |
Author: 冒佳明 |
Hits:
Description: 使用c++编写的monteCarlo算法来判断字符串匹配问题，字符串中素数判定使用millerrabin算法-Use c++ written monteCarlo algorithm to determine the string matching, string in primality use the millerrabin algorithm
Platform: |
Size: 3072 |
Author: 冒佳明 |
Hits:
Description: 实现大素数判断，通过传统的MillerRabin算法-Achieve large prime number judgment through traditional MillerRabin algorithm
Platform: |
Size: 570368 |
Author: Kevin Zhnag |
Hits:
Description: 实验目的
许多密码算法和协议都需要“随机”的大素数，特别是在共享密钥的密码协议中。对于大素数的生成，一个最自然的方法是先生成一个大整数，然后对其进行素性检测。
实验内容与要求
随机选择一个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.
Platform: |
Size: 1024 |
Author: lei |
Hits: