Cryptography Reference
In-Depth Information
[20] Castagnos, G., Joux, A., Laguillaumie, F., Nguyen, P.Q.: Factoringpq
2
with
quadratic forms: nice cryptanalyses. In: Asiacrypt 2009 [
43
], pp. 469{486 (2009);
Cited from x
3
[21] 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 (2011); See [
10
]
[22] Chien, R.T., Choy D.M.: Algebraic generalization of BCH-Goppa-Helgert codes.
IEEE Transactions on Information Theory 21, 70{79; Cited from x
1
[23] Cohn, H., Heninger, N.: Ideal forms of Coppersmith's theorem and Guruswami-
Sudan list decoding (2010); Cited from x
3
, x
3
, x
3
[24] Coppersmith, D.: Finding a small root of a univariate modular equation. In:
Eurocrypt 1996 [
44
], pp. 155{165 (1996); see also newer version [
26
]; Cited from
x
3
, x
3
[25] Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring
with high bits known. In: Eurocrypt 1996 [
44
], pp. 178{189 (1996); see also newer
version [
26
]; Cited from x
3
, x
3
[26] Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA
vulnerabilities. Journal of Cryptology 10, 233{260 (1997); see also older version
[
24
] and [
25
]
[27] Darnell, M. (ed.): Cryptography and coding: proceedings of the 6th IMA Interna-
tional Conference held at the Royal Agricultural College, Cirencester, December
17-19, 1997. Lecture Notes in Computer Science, vol. 1355. Springer (1997); See
[
40
]
[28] Delsarte, P.: On subfield subcodes of modified Reed-Solomon codes. IEEE Trans-
actions on Information Theory 21, 575{576 (1975); Cited from x
1
[29] von zur Gathen, J., Gerhard J.: Modern computer algebra, 2nd edn. Cambridge
University Press, Cambridge (2003); Cited from x
2
, x
2
, x
2
, x
2
, x
2
, x
2
, x
2
, x
2
[30] Giorgi, P., Jeannerod, C.-P., Villard, G.: On the complexity of polynomial matrix
computations. In: ISSAC 2003 [
49
], pp. 135{142 (2003); Cited from x
2
, x
2
, x
2
, x
2
[31] Goppa, V.D.: A new class of linear error correcting codes. Problemy Peredachi
Informatsii 6, 24{30 (1970); Cited from x
1
, x
6
[32] Goppa,
V.D.:
Rational
representation
of
codes
and
(L;g)-codes.
Problemy
Peredachi Informatsii 7, 41{49 (1971); Cited from x
1
[33] Gorenstein, D., Zierler, N.: A class of error-correcting codes inp
m
symbols. Jour-
nal of the Society for Industrial and Applied Mathematics 9, 207{214 (1961);
Cited from x
1
[34] Guruswami, V.: List decoding of error-correcting codes, Ph.D. thesis. Mas-
sachusetts Institute of Technology (2001); Cited from x
1
[35] Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-
geometry codes. In: FOCS 1998 [
1
], pp. 28{39 (1998); see also newer version [
36
];
Cited from x
1
, x
1
, x
3
, x
3
, x
3
, x
3
, x
3
[36] Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-
geometry codes. IEEE Transactions on Information Theory 45, 1757{1767 (1999);
see also older version [
36
]; Cited from x
3
, x
3
[37] H astad, J.: Solving simultaneous modular equations of low degree. SIAM Journal
on Computing 17, 336{341 (1988); Cited from x
3
[38] Helgert, H.J.: Alternant codes. Information and Control 26, 369{380 (1974); Cited
from x
1
[39] Hocquenghem, A.: Codes correcteurs d'erreurs. Chires 2, 147{156 (1959); Cited
from x
1
