Cryptology ePrint Archive: Report 2020/065

A Performant, Misuse-Resistant API for Primality Testing

Jake Massimo and Kenneth G. Paterson

Abstract: Primality testing is a basic cryptographic task. But developers today are faced with complex APIs for primality testing, along with documentation that fails to clearly state the reliability of the tests being performed. This leads to the APIs being incorrectly used in practice, with potentially disastrous consequences. In an effort to overcome this, we present a primality test having a simplest-possible API: the test accepts a number to be tested and returns a Boolean indicating whether the input was composite or probably prime. For all inputs, the output is guaranteed to be correct with probability at least $1 - 2^{128}$. The test is performant: on random, odd, 1024-bit inputs, it is faster than the default test used in OpenSSL by 17\%. We investigate the impact of our new test on the cost of random prime generation, a key use case for primality testing. The OpenSSL developers have adopted our suggestions in full; our new API and primality test are scheduled for release in OpenSSL 3.0.

Category / Keywords: applications / primality testing, API design

Date: received 21 Jan 2020

Contact author: kenny paterson at inf ethz ch,jake massimo 2015@rhul ac uk

Available format(s): PDF | BibTeX Citation

Version: 20200121:185121 (All versions of this report)

Short URL: ia.cr/2020/065


[ Cryptology ePrint archive ]