Abstract
Luckily we shall see that testing a number for primality can be done very fast using very simplecode, but with an algorithm that has a probability of error. By repeating this algorithm we can reduce the error probability to any value that we require.
Cite
CITATION STYLE
APA
Smart, N. P. (2016). Primality testing and factoring. In Information Security and Cryptography (Vol. 0, pp. 27–50). Springer International Publishing. https://doi.org/10.1007/978-3-319-21936-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free