New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
Authors:
- A. V. OurivskiAOA. V. Ourivski
- T. JohanssonTJT. Johansson
- 1 July 2002
- journal article
- Published by Springer Nature in Problems of Information Transmission
- Vol. 38 (3) , 237-246
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A new family of rank codes and applications to cryptography2002
- Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank2001
- Ideals over a Non-Commutative Ring and their Application in Cryptology2001
- Modified GPT PKC with Right ScramblerElectronic Notes in Discrete Mathematics, 2001
- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations2000
- The cryptographic security of the syndrome decoding problem for rank distance codes1996
- The Security of the Gabidulin Public Key Cryptosystem1996
- A new identification algorithm1996
- Severely denting the Gabidulin version of the McEliece Public Key CryptosystemDesigns, Codes and Cryptography, 1995