New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications (original) (raw)
REFERENCES
Barg, A., Complexity issues in coding theory, Handbook of coding theory, Pless, V.S. and Huffman, W.C., Eds., Amsterdam: Elsevier, 1998, pp. 649–754. Google Scholar
Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V., Ideals over a Non-Commutative Ring and Their Application in Cryptology, Advances in Cryptology EUROCRYPT'91, Lect. Notes Comp. Sci., vol. 547, Berlin: Springer, 1991, pp. 482–489. Google Scholar
Gibson, J.K., Severely Denting the Gabidulin Version of the McEliece Public-Key Cryptosystem, Designs, Codes and Cryptography, 1995, vol. 6, no. 1, pp. 37–45. Google Scholar
Gibson, J.K., The Security of the Gabidulin Public-Key Cryptosystem, Advances in Cryptology EUROCRYPT'96, Lect. Notes Comp. Sci., vol. 1070, Berlin: Springer, 1996, pp. 212–223. Google Scholar
Gabidulin, E.M. and Ourivski, A.V., Improved GPT Public-Key Cryptosystems, Coding, Communications and Broadcasting, Honary, B., Darnell, M., and Farrel, P., Eds., London: Research Studies, 2000, pp. 73–102. Google Scholar
Gabidulin, E.M. and Ourivski, A.V., Modified GPT PKC with Right Scrambler, Proc. Int. Workshop on Coding and Cryptography WCC'01, Paris, 2001, pp. 233-242.
Chen, K., A New Identification Algorithm, Proc. Int. Conf. on Cryptography Policy and Algorithms, Lect. Notes Comp. Sci., vol. 1029, Berlin: Springer, 1996, pp. 244–249. Google Scholar
Chabaud, F. and Stern, J., The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes, Advances in Cryptology ASIACRYPT'96, Lect. Notes Comp. Sci., vol. 1163, Berlin: Springer, 1996, pp. 368–381. Google Scholar
Gabidulin, E.M., Theory of Codes with Maximal Rank Distance, Probl. Peredachi Inf., 1985, vol. 21, no. 1, pp. 3–16 [Probl. Inf. Trans. (Engl. Transl.), 1985, vol. 21, no. 1, pp. 1-12]. Google Scholar
Courtois, N., Klimov, A., Patarin, J., and Shamir, A., Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, Advances in Cryptology EUROCRYPT'2000, Lect. Notes Comp. Sci., vol. 1807, Berlin: Springer, 2000, pp. 392–407. Google Scholar
Gabidulin, E., Ourivski, A., Honary, B., and Ammar, B., A New Family of Rank Codes and Applications to Cryptography, Proc. 2002 IEEE Int. Sympos. on Information Theory ISIT'02, Lausanne, 2002, p. 268.
Canteaut, A. and Sendrier, N., Cryptanalysis of the Original McEliece Cryptosystem, Advances in Cryptology ASIACRYPT'98, Lect. Notes Comp. Sci., vol. 1514, Berlin: Springer, 1998, pp. 187–199. Google Scholar
Courtois, N., Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank, Advances in Cryptology ASIACRYPT'2001, Lect. Notes Comp. Sci., vol. 2248, Berlin: Springer, 2001, pp. 402–421. Google Scholar