Cryptography Reference
In-Depth Information
2. Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing Key Length of
the McEliece Cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS,
vol. 5580, pp. 77-97. Springer, Heidelberg (2009); Cited on page 222
3. Bernstein, D.J., Lange, T., Peters, C.: Ball-collision decoding. Cryptology ePrint
Archive, Report 2010/585 (2010),
http://eprint.iacr.org/2010/585.pdf
;Cited
on page 217
4. Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Faster 2-regular information-
set decoding. Cryptology ePrint Archive, Report 2011/120 (2011),
http://eprint.
iacr.org/
; Cited on page 223
5. Cayrel, P.-L., Véron, P., El Yousfi Alaoui, S.M.: Improved code-based identification
scheme. In: SAC 2010 (2010),
http://arxiv.org/abs/1001.3017v1
;
Ci d n
page 222
6. Cheung, K.-M.: The weight distribution and randomness of linear codes. TDA
Progress Report 42-97, Communications Systems Research Section (1989);
Cited
on page 223
7. Al Jabri, A.: A Statistical Decoding Algorithm for General Linear Block Codes.
In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 1-8.
Springer, Heidelberg (2001); Cited on page 217
8. MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-
Holland Mathematical Library, vol. 16 (1977); Cited on page 223
9. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DNS
Progress Report, pp. 114-116 (1978); Cited on page 217
10. Minder, L., Sinclair, A.: The extended
k
-tree algorithm. In: SODA, pp. 586-595
(2009); Cited on page 217
11. Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for Infor-
mation Set Decoding over
F
q
. In: SCC 2010, RHUL, London, UK, pp. 143-158
(2010); Cited on pages 217 and 225
12. Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for Infor-
mation Set Decoding over
F
q
and on the effect of Partial Knowledge. Submitted
to Math in CS, SCC 2010 (2011); Cited on page 225
13. Overbeck, R.: Statistical Decoding Revisited. In: Batten, L.M., Safavi-Naini, R.
(eds.) ACISP 2006. LNCS, vol. 4058, pp. 283-294. Springer, Heidelberg (2006);
Cited on pages 217, 223, and 226
14. Peters, C.: Information-set decoding for linear codes over
F
q
. In: Sendrier, N. (ed.)
PQCrypto 2010. LNCS, vol. 6061, pp. 81-94. Springer, Heidelberg (2010);
Cited
on pages 225 and 226
15. Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions
on Information Theory, 5-9 (1962); Cited on page 225
16. Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factor-
ing, pp. 124-134. IEEE Press (1994);
Cited on page 217
