Table of Contents

Foreword
Introduction
1 Scope
2 Normative references
3 Terms and definitions
4 Symbols and abbreviated terms
5 Prime Generation Methods
6 Candidate Prime Testing Methods
7 Tables of Parameters
Annex A (normative)
Annex B (informative)
Annex C - Summary of Changes from ANS X9.80-2001 (informative)
Bibliography

Abstract

Describes methods for generating large prime numbers as needed by public key cryptographic algorithms. It also provides testing methods for testing candidate primes presented by a third party. It allows primes to be generated either deterministically or probabilistically, where: - A number shall be accepted as prime when a probabilistic algorithm that declares it to be prime is in error with probability less than 2[-100]. - A deterministic prime shall be generated using a method that guarantees that it is prime.

General Product Information

Published
Document Type	Standard
Status	Current
Publisher	American Bankers Association
Pages
ISBN
Committee	X9