Public key cryptography and error correcting codes as Ising models


Autoria(s): Saad, David; Kabashima, Yoshiyuki; Murayama, Tatsuto
Contribuinte(s)

P. Sollich, L.P. Hughston

Streater, R.F.

Data(s)

09/02/2001

Resumo

We employ the methods of statistical physics to study the performance of Gallager type error-correcting codes. In this approach, the transmitted codeword comprises Boolean sums of the original message bits selected by two randomly-constructed sparse matrices. We show that a broad range of these codes potentially saturate Shannon's bound but are limited due to the decoding dynamics used. Other codes show sub-optimal performance but are not restricted by the decoding dynamics. We show how these codes may also be employed as a practical public-key cryptosystem and are of competitive performance to modern cyptographical methods.

Formato

application/pdf

Identificador

http://eprints.aston.ac.uk/1300/1/NCRG_2001_008.pdf

Saad, David; Kabashima, Yoshiyuki and Murayama, Tatsuto (2001). Public key cryptography and error correcting codes as Ising models. IN: Disordered and complex systems. P. Sollich, L.P. Hughston and Streater, R.F. (eds) New york: American Institute of Physics.

Publicador

American Institute of Physics

Relação

http://eprints.aston.ac.uk/1300/

Tipo

Book Section

NonPeerReviewed