Abstract
The article presents the mathematical background and methods of design of public key cryptosystems. Two different classes of public key cryptosystems are described. Cryptosystems of the first class are created by means of power function over finite ring (Rivest-Shamir-Adleman cryptosystem). The second class is composed of such public key cryptosystems as are determined on the basis of the knapsack problem (Merkle-Hellman cryptosystems, and cryptosystems based on idempotent elements). McEliece cryptosystems are discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 891-905 |
| Number of pages | 15 |
| Journal | Rozprawy Elektrotechniczne |
| Volume | 30 |
| Issue number | 3 |
| Publication status | Published - 1984 |
| Externally published | Yes |