Prime-number algorithm for public-key systems (Q1816016)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 948643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Prime-number algorithm for public-key systems |
scientific article; zbMATH DE number 948643 |
Statements
Prime-number algorithm for public-key systems (English)
0 references
21 November 1996
0 references
The problem of generating prime numbers for use in cryptographic systems is addressed. A few of the known primality tests are reviewed, including pseudoprime, deterministic and hypothesis tests. Other techniques that have been used for generating primes are briefly noted and a new recursive technique described.
0 references
public-key systems
0 references
pseudoprime test
0 references
deterministic test
0 references
hypothesis test
0 references
generating prime numbers
0 references
cryptographic systems
0 references
0 references
0 references
0.8309612274169922
0 references
0.8206329345703125
0 references
0.8063550591468811
0 references
