Prime Proof Protocol

Anna M.  Johnston; Rathna Ramesh

Paper 2020/1564 Original: eprint.iacr.org/2020/1564 ↗

Prime Proof Protocol

Anna M. Johnston

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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2020-12-17: last updated; 2020-12-17: published
Short URL: https://ia.cr/2020/1564
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2020/1564,
      author = {Anna M.  Johnston and Rathna Ramesh},
      title = {Prime Proof Protocol},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/1564},
      year = {2020},
      url = {https://eprint.iacr.org/2020/1564}
}