什么是最快的确定性素性测试的取值范围为2 ^ 1024至2 ^ 4096号？ [英] What is the fastest deterministic primality test for numbers in the range 2^1024 to 2^4096?

问题描述

我写一个加密协议的实现。到目前为止，我一直有一个很难找到最快的确定性素性测试的1024位至4096位整数（308-到1233位数字）。我所知道的几种选择，但我一直没能找到真正的世界速度比较。

I am writing an implementation of a cryptography protocol. So far I've been having a difficult time finding the fastest deterministic primality test for 1024-bit to 4096-bit integers (308- to 1233-digit numbers). I am aware of several options but I have not been able to find real world speed comparisons.

具体而言，如何在AKS测试进行比较，拉宾 - 米勒和椭圆曲线素性的确定性版本验证测试（和其他人）一般随机数这种规模？

Specifically, how does the AKS test perform compared to the deterministic version of Rabin-Miller and the Elliptic Curve Primality Proving test (and others) for general random numbers this size ?

推荐答案

这篇文章回答你的问题：

This article is answering your question:

素性检验由Richard P.布伦特： http://cs.anu.edu.au/student/comp4600/lectures /comp4600_primality.pdf

PRIMALITY TESTING by Richard P. Brent: http://cs.anu.edu.au/student/comp4600/lectures/comp4600_primality.pdf

它比较复杂，并在现实世界速度的3算法。

It compares in complexity and in "real world speed" the 3 algorithms.

这篇关于什么是最快的确定性素性测试的取值范围为2 ^ 1024至2 ^ 4096号？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！