Secure and linear cryptosystems using error-correcting codes

Details Secure and linear cryptosystems using error-correcting codes Secure and linear cryptosystems using error-correcting codes

2000-08-27

arxiv.org/abs/cond-mat/0008392v1

Europhys. Lett. 51 (15 July), 244 (2000)

Physics

Condensed Matter

Disordered Systems and Neural Networks

Scientific paper

10.1209/epl/i2000-00537-2

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.

Affiliated with

Also associated with

No associations

Rating

Secure and linear cryptosystems using error-correcting codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure and linear cryptosystems using error-correcting codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure and linear cryptosystems using error-correcting codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100587