Secure and linear cryptosystems using error-correcting codes

I. Kanter, E. Kanter, L. Ein-Dor

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


A public-key cryptosystem, digital signature and authentication procedures based on a Gallager-type parity-check error-correcting code are presented. The complexity of the encryption and the decryption processes scale linearly with the size of the plaintext Alice sends to Bob. The public-key is pre-corrupted by Bob, whereas a private-noise added by Alice to a given fraction of the ciphertext of each encrypted plaintext serves to increase the secure channel and is the cornerstone for digital signatures and authentication. Various scenarios are discussed including the possible actions of the opponent Oscar as an eavesdropper or as a disruptor.

Original languageEnglish
Pages (from-to)244-250
Number of pages7
Issue number2
StatePublished - 11 Jul 2000


Dive into the research topics of 'Secure and linear cryptosystems using error-correcting codes'. Together they form a unique fingerprint.

Cite this