A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
An RSA Scheme based on Improved AKS Primality Testing Algorithm
MATEC Web of Conferences
In applied cryptography, RSA is a typical asymmetric algorithm, which is used in electronic transaction and many other security scenarios. RSA needs to generate large random primes. Currently, primality test mostly depends on probabilistic algorithms, such as the Miller-Rabin primality testing algorithm. In 2002, Agrawal et al. published the Agrawal-Kayal-Saxena (AKS) primality testing algorithm, which is the first generic, polynomial, deterministic and non-hypothetical algorithm for primalitydoi:10.1051/matecconf/20164401032 fatcat:hkjx3r5majfyhlsmzs3xtwk3lu