Public key cryptography and error correcting codes as Ising models
无序系统与神经网络
2009-10-31 v1
摘要
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.
引用
@article{arxiv.cond-mat/0008363,
title = {Public key cryptography and error correcting codes as Ising models},
author = {David Saad and Yoshiyuki Kabashima and Tatsuto Murayama},
journal= {arXiv preprint arXiv:cond-mat/0008363},
year = {2009}
}
备注
6 pages