Application of public key cryptosystems to data security

Jozef P. Pieprzyk*, Dominik A. Rutkowski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)891-905
Number of pages15
JournalRozprawy Elektrotechniczne
Issue number3
Publication statusPublished - 1984
Externally publishedYes


Dive into the research topics of 'Application of public key cryptosystems to data security'. Together they form a unique fingerprint.

Cite this