1. Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. Cryptology ePrint Archive (2003),
http://eprint.iacr.org/2003/230/
2. Barg, A.: Complexity issues in coding theory. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding theory, ch. 7, vol. I, pp. 649–754. North-Holland, Amsterdam (1998)
3. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24(3) (May 1978)
4. Coron, J.-S., Joux, A.: Cryptanalysis of a provably secure cryptographic hash function. Cryptology ePrint Archive (2004),
http://eprint.iacr.org/2004/013/
5. Dai, W.: Crypto++ library,
http://www.eskimo.com/~weidai/