Abstract
ISO/IEC 18032:2005 specifies methods for generating and testing prime numbers. Prime numbers are used in various cryptographic algorithms, mainly in asymmetric encryption algorithms and digital signature algorithms.
Firstly, ISO/IEC 18032:2005 specifies methods for testing whether a given number is prime. The testing methods included in ISO/IEC 18032:2005 can be divided into two groups:
- Probabilistic primality tests, which have a small error probability. All probabilistic tests described here may declare a composite to be a prime. One test described here may declare a prime to be composite.
- Deterministic methods, which are guaranteed to give the right verdict. These methods use so-called primality certificates.
Secondly, ISO/IEC 18032:2005 specifies methods to generate prime numbers. Again, both probabilistic and deterministic methods are presented.
General information
-
Status: WithdrawnPublication date: 2005-01Stage: Withdrawal of International Standard [95.99]
-
Edition: 1Number of pages: 18
-
Technical Committee :ISO/IEC JTC 1/SC 27ICS :35.030
- RSS updates
Life cycle
-
Now
-
Revised by
PublishedISO/IEC 18032:2020
Got a question?
Check out our FAQs
Customer care
+41 22 749 08 88
Opening hours:
Monday to Friday - 09:00-12:00, 14:00-17:00 (UTC+1)