On using primes for public key encryption systems (Q1109750)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1109750 |
scientific article; zbMATH DE number 4070792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On using primes for public key encryption systems |
scientific article; zbMATH DE number 4070792 |
Statements
On using primes for public key encryption systems (English)
0 references
1988
0 references
It is shown that the popular RSA public key encryption scheme does not require two primes but that probable primes may be used instead. A method for finding probable primes is given and the security of systems based on probable primes is discussed.
0 references
RSA public key encryption
0 references
primes
0 references
security of systems
0 references
0.8420024514198303
0 references
0.8286559581756592
0 references
0.8206329345703125
0 references
0.8166322708129883
0 references
