Secure and linear cryptosystems using error-correcting codes
Disordered Systems and Neural Networks
2009-10-31 v1
Abstract
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.
Cite
@article{arxiv.cond-mat/0008392,
title = {Secure and linear cryptosystems using error-correcting codes},
author = {I. Kanter and E. Kanter and L. Ein-Dor},
journal= {arXiv preprint arXiv:cond-mat/0008392},
year = {2009}
}