Cryptography Reference
In-Depth Information
References
[1] | (no editor): 39th annual symposium on foundations of computer science, FOCS
'98, November 8-11, 1998, Palo Alto, California, USA. IEEE Computer Society
(1998); See [ 35 ]
[2] | (no editor): Proceedings of the 32nd annual ACM symposium on theory of
computing. Association for Computing Machinery, New York (2000); See [ 14 ]
[3] Alekhnovich, M.: Linear diophantine equations over polynomials and soft de-
coding of Reed-Solomon codes. IEEE Transactions on Information Theory 51,
2257{2265 (2005); Cited from x 1 , x 2 , x 2
[4] Augot, D., Barbier, M., Couvreur, A.: List-decoding of binary Goppa codes up
to the binary Johnson bound (2010); Cited from x 1 , x 1 , x 3 , x 3 , x 3 , x 3 , x 3 , x 3 , x 6
[5] Barreto, P.S.L.M., Lindner, R., Misoczki, R.: Decoding square-free Goppa codes
overF p (2010); Cited from x 6
[6] Beelen, P., Brander, K.: Key equations for list decoding of Reed{Solomon codes
and how to solve them. Journal of Symbolic Computation 45, 773{786 (2010);
Cited from x 1
[7] Berlekamp, E.R.: Algebraic coding theory. McGraw-Hill, New York (1968); Cited
from x 1
[8] Bernstein, D.J.: Fast multiplication and its applications. In: [ 19 ], pp. 325{384
(2008); Cited from x 2 , x 2 , x 2 , x 2
[9] Bernstein, D.J.: Reducing lattice bases to find small-height values of univariate
polynomials. In: [ 19 ], pp. 421{446 (2008); Cited from x 1 , x 3 , x 3 , x 3
[10] Bernstein, D.J.: List decoding for binary Goppa codes. In: IWCC 2011 [ 21 ], pp.
62{80 (2011); Cited from x 3 , x 3
[11] Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece
cryptosystem. In: PQCrypto 2008 [ 17 ], pp. 31{46 (2008); Cited from x 1
[12] Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: SAC 2010 [ 13 ], pp.
143{158 (2011); Cited from x 6
[13] 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 (2011); See [ 12 ]
[14] Boneh, D.: Finding smooth integers in short intervals using CRT decoding. In:
STOC 2000 [ 2 ], pp. 265{272 (2000); see also newer version [ 15 ]; Cited from x 3 ,
x 3 , x 3
[15] Boneh, D.: Finding smooth integers in short intervals using CRT decoding. Jour-
nal of Computer and System Sciences 64, 768{784 (2002); see also older version
[ 14 ]
[16] Bose, R.C., Ray-Chaudhuri, D.K.: On a class of error correcting binary group
codes. Information and Control 3, 68{79 (1960); Cited from x 1
[17] Buchmann, J., Ding, J. (eds.): Post-quantum cryptography, second international
workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17-19, 2008, proceed-
ings. Lecture Notes in Computer Science, vol. 5299. Springer (2008); See [ 11 ]
[18] Burgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory.
Springer, Berlin (1997); Cited from x 2
[19] Buhler, J.P., Stevenhagen, P. (eds.): Surveys in algorithmic number theory. Math-
ematical Sciences Research Institute Publications, vol. 44. Cambridge University
Press, New York (2008); See [ 8 ], [ 9 ]
Search WWH ::




Custom Search