[Resource Topic] 2020/1564: Prime Proof Protocol

Welcome to the resource topic for 2020/1564

Title:
Prime Proof Protocol

Authors: 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.

ePrint: https://eprint.iacr.org/2020/1564

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .