Cryptology ePrint Archive: Report 2020/1564

Prime Proof Protocol

Anna M. Johnston and Rathna Ramesh

Abstract: Prime integers form the basis for finite field and elliptic curve cryptography, as well as many other applications. Provable prime generation guarantees primality and is more efficient than probabilistic generation, and provides components for an efficient primality proof. This paper details a protocol which takes in the proof components from the generation process, proves primality, and as an added benefit, supplies the user with a subgroup generator.

Category / Keywords: cryptographic protocols / prime generation, finite field cryptosystems

Date: received 14 Dec 2020

Contact author: amj at juniper net

Available format(s): PDF | BibTeX Citation

Version: 20201217:095524 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]