### Designer Primes

Anna M. Johnston

##### Abstract

Prime integers are the backbone of most public key cryptosystems. Attacks often go after the primes themselves, as in the case of all factoring and index calculus algorithms. Primes are time sensitive cryptographic material and should be periodically changed. Unfortunately many systems use fixed primes for a variety of reasons, including the difficulty of generating trusted, random, cryptographically secure primes. This is particularly concerning in the case of discrete log based cryptosystems. This paper describes a variant of provable prime generation, intended for discrete logarithm based cryptography, based off Pocklington's theorem with improved efficiency, flexibility and security.

Available format(s)
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
prime generationfinite field cryptosystems
Contact author(s)
amj @ juniper net
History
Short URL
https://ia.cr/2020/1535

CC BY

BibTeX

@misc{cryptoeprint:2020/1535,
author = {Anna M.  Johnston},
title = {Designer Primes},
howpublished = {Cryptology ePrint Archive, Paper 2020/1535},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/1535}},
url = {https://eprint.iacr.org/2020/1535}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.