Cryptography Reference
In-Depth Information
[Fin10]
Finiasz, M.: Parallel-CFS. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.)
SAC 2010. LNCS, vol. 6544, pp. 159-170. Springer, Heidelberg (2011)
[FOPT10a]
Faugere, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic Crypt-
analysis of McEliece Variants with Compact Keys. In: Gilbert, H. (ed.)
EUROCRYPT 2010. LNCS, vol. 6110, pp. 279-298. Springer, Heidelberg
(2010)
[FOPT10b]
Faugere, J.-C., Otmani, A., Perret, L., Tilllich, J.-P.: Algebraic cryptanal-
ysis of compact McEliece's variants - toward a complexity analysis. In:
International Conference on Symbolic Computation and Cryptography -
SCC 2010, pp. 45-56 (2010)
[FS09]
Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-Based
Cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912,
pp. 88-105. Springer, Heidelberg (2009)
[Gab05]
Gaborit, P.: Shorter keys for code based cryptography. In: International
Workshop on Coding and Cryptography - WCC 2005, pp. 81-91. ACM
Press, Bergen (2005)
[GL10]
Gauthier Umana, V., Leander, G.: Practical key recovery attacks on two
McEliece variants. In: Cid, C., Faugere, J.-C. (eds.) International Con-
ference on Symbolic Computation and Cryptography - SCC 2010, pp.
27-44 (2010)
[Lan02]
Lang, S.: Algebra, revised 3rd edn. Springer, Heidelberg (2002)
[MB09]
Misoczki, R., Barreto, P.S.L.M.: Compact McEliece Keys from Goppa
Codes. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC
2009. LNCS, vol. 5867, pp. 376-392. Springer, Heidelberg (2009)
[McE78]
McEliece, R.J.: A public-key cryptosystem based on algebraic coding the-
ory. Deep Space Network Progress Report 44, 114-116 (1978)
[MRS00]
Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check
codes in the McEliece cryptosystem. In: IEEE International Symposium
on Information Theory - ISIT 2000, p. 215. IEEE, Sorrento (2000)
[MS77]
MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes.
North-Holland Mathematical Library, vol. 16 (1977)
[Nie86]
Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding the-
ory. Problems of Control and Information Theory 15(2), 159-166 (1986)
[OTD10]
Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of two McEliece
cryptosystems based on quasi-cyclic codes. Mathematics in Computer
Science 3(2), 129-140 (2010)
[Per11]
Persichetti, E.: Compact McEliece keys based on quasi-dyadic Srivastava
codes. Cryptology ePrint Archive, Report 2011/179 (2011),
http://eprint.iacr.org/2011/179.pdf
[Pet10]
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)
[Pet11]
Peters, C.: Curves, Codes, and Cryptography. Ph.D. thesis, Technische
Universiteit Eindhoven, the Netherlands (2011),
http://alexandria.tue.nl/extra2/711052.pdf
[SS92]
Sidelnikov, V., Shestakov, S.: On the insecurity of cryptosystems based
on generalized Reed-Solomon codes. Discrete Mathematics and Applica-
tions 1(4), 439-444 (1992)
[TZ75]
Tzeng, K.K., Zimmermann, K.: On extending Goppa codes to cyclic
codes. IEEE Transactions on Information Theory 21, 712-716 (1975)
