摘要: We describe a probabilistic algorithm, which can be used to discover words of small weight in a linear binary code. The work-factor of the algorithm is asymptotically quite large but the …
springer.com
springerlink.com
acm.org 参考文章(2)
Amos Fiat, Adi Shamir, How to prove yourself: practical solutions to identification and signature problems international cryptology conference. ,vol. 263, pp. 186- 194 ,(1987) , 10.1007/3-540-47721-7_12
E. Berlekamp, R. McEliece, H. van Tilborg, On the inherent intractability of certain coding problems (Corresp.) IEEE Transactions on Information Theory. ,vol. 24, pp. 384- 386 ,(1978) , 10.1109/TIT.1978.1055873