Cryptography Reference
In-Depth Information
[40] Howgrave-Graham, N.: Finding small roots of univariate modular equations re-
visited. In: Cirencester 1997 [
27
], pp. 131{142 (1997); Cited from x
3
, x
3
[41] Howgrave-Graham, N.: Computational mathematics inspired by RSA, Ph.D. the-
sis (1998); Cited from x
3
, x
3
[42] Justesen, J.: On the complexity of decoding Reed{Solomon codes. IEEE Trans-
actions on Information Theory 22, 237{238 (1976); Cited from x
1
[43] Matsui, M. (ed.): Advances in cryptology|ASIACRYPT 2009, 15th international
conference on the theory and application of cryptology and information security,
Tokyo, Japan, December 6-10, 2009, proceedings. Lecture Notes in Computer
Science, vol. 5912. Springer (2009); See [
20
]
[44] Maurer, U.M. (ed.): Advances in cryptology|EUROCRYPT '96: proceedings of
the fifteenth international conference on the theory and application of crypto-
graphic techniques held in Saragossa, May 12-16, 1996. Lecture Notes in Com-
puter Science, vol. 1070. Springer, Berlin (1996); See [
24
], [
25
]
[45] Mora, T. (ed.): Applied algebra, algebraic algorithms and error-correcting codes:
proceedings of the sixth international conference (AAECC-6) held in Rome, July
4-8, 1988. Lecture Notes in Computer Science, vol. 357. Springer, Berlin (1989);
See [
53
]
[46] Wesley Peterson, W.: Encoding and error-correction procedures for the Bose-
Chaudhuri codes. Transactions of the Institute of Radio Engineers 6, 459{470
(1960); Cited from x
1
[47] Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of the
Society for Industrial and Applied Mathematics 8, 300{304 (1960); Cited from x
1
[48] Sarwate, D.V.: On the complexity of decoding Goppa codes. IEEE Transactions
on Information Theory 23, 515{516 (1977); Cited from x
1
[49] Rafael Sendra, J. (ed.): Symbolic and algebraic computation, international sym-
posium ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, August
3-6, 2003, proceedings. Association for Computing Machinery (2003); See [
30
]
[50] Sudan, M.: Decoding of Reed Solomon codes beyond the error-correction bound.
Journal of Complexity 13, 180{193 (1997); Cited from x
1
[51] Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T.: Further results on
Goppa codes and their applications to constructing ecient binary codes. IEEE
Transactions on Information Theory 22, 518{526 (1976); Cited from x
6
[52] Trifonov, P.: Ecient interpolation in the Guruswami{Sudan algorithm. IEEE
Transactions on Information Theory 56, 4341{4349 (2010); Cited from x
1
[53] Vallee, B., Girault, M., Ton, P.: How to guess`th roots modulonby reducing
lattice bases. In: AAECC 1989 [
45
], pp. 427{442 (1989); Cited from x
3
[54] Wu, Y.: New list decoding algorithms for Reed{Solomon and BCH codes. IEEE
Transactions On Information Theory 54 (2008); Cited from x
3
, x
3
[55] Zassenhaus, H.: On Hensel factorization. I. Journal of Number Theory 1, 291{311
(1969); Cited from x
2
