Cryptography Reference
In-Depth Information
shield against polynomial-searching attacks does not require dropping the wild-
ness percentage from 100% all the way down to 50%; the parameters suggested
in Table 5.1 typically have very small extra factors f, profiting from the higher
error-correction capability induced by g
q1
.
References
[1] Augot, D., Barbier, M., Couvreur, A.: List-decoding of binary Goppa codes up to
the binary Johnson bound (2010),
http://arxiv.org/abs/1012.3439
; Citations
in this document:x
2
[2] Berger, T.P., Loidreau, P.: How to mask the structure of codes for a crypto-
graphic use. Designs, Codes and Cryptography 35, 63{79 (2005), MR 2006d:94038,
http://www.springerlink.com/index/JR001118R1567U13.pdf
; Citations in this
document:x
1
,x
3
,x
3
[3] Berlekamp, E.R.: Algebraic coding theory. Aegean Park Press (1984) ISBN
0894120638; Citations in this document:x
2
[4] Bernstein, D.J.: List decoding for binary Goppa codes. In: IWCC [10], pp. 62{80
(2011),
http://cr.yp.to/papers.html#goppalist
; Citations in this document:x
2
[5] Bernstein, D.J.: Simplified high-speed high-distance list decoding for alternant codes.
In: PQCrypto [27], pp. 200{216 (2011),
http://cr.yp.to/papers.html#simplelist
;
Citations in this document:x
2
,x
2
[6] Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: SAC 2010 [7], pp. 143{
158 (2011),
http://eprint.iacr.org/2010/410
; Citations in this document:x
1
,
x
1
,x
1
,x
1
,x
1
,x
1
,x
2
,x
2
,x
2
,x
3
,x
4
,x
4
[7] Biryukov, A., Gong, G., Stinson, D.R. (eds.): Selected areas in cryptography | 17th
international workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13,
2010, revised selected papers. Lecture Notes in Computer Science, vol. 6544.
Springer, Heidelberg (2011); See [
6
]
[8] Certicom: Certicom ECC Challenge (1997),
http://www.certicom.com/images/
pdfs/cert_ecc_challenge.pdf
; Citations in this document:x
4
,x
4
[9] Charpin, P. (ed.): Livre des resumes | EUROCODE 94, Abbaye de la Bussiere sur
Ouche, France (October 1994); See [
20
]
[10] Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.): Cod-
ing and cryptology | third international workshop, IWCC 2011, Qingdao, China,
May 30-June 3, 2011, proceedings. Lecture Notes in Computer Science, vol. 6639.
Springer, Heidelberg (2011); See [
4
]
[11] Goppa, V.D.: A new class of linear error correcting codes. Problemy Peredachi
Informatsii 6, 24{30 (1970); Citations in this document:x
2
,x
2
[12] Goppa, V.D.: Rational representation of codes and (L;g)-codes. Problemy Peredachi
Informatsii 7, 41{49 (1971); Citations in this document:x
2
[13] Kim, K. (ed.): Public key cryptography: proceedings of the 4th international work-
shop on practice and theory in public key cryptosystems (PKC 2001) held on
Cheju Island, February 13-15, 2001. Lecture Notes in Computer Science, vol. 1992.
Springer, Heidelberg (2001); See [
14
]
[14] Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems | con-
versions for McEliece PKC. In: PKC 2001 [13], pp. 19{35 (2001), MR 2003c:94027;
Citations in this document:x
4
[15] McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL
DSN Progress Report, 114{116 (1978),
http://ipnpr.jpl.nasa.gov/progress_
report2/42-44/44N.PDF
; Citations in this document:x
1