A new identification algorithm
Theory of codes with rank distance was introduced in 1985, which can be applied to crisscross error correction and also used to build some cryptographical schemes. In this paper, we propose a new identification algorithm based on rank distance codes. This algorithm is simple to describe, it has also advantages in both communications and memory bits.
Unable to display preview. Download preview PDF.
- E. R. Berlekamp, R. J. McEliece and H. C. A. Van Tilborg, On the Inherent Intractability of Certain Coding Problems, IEEE Trans. Inform. Theory, IT-24(3) pp. 384–386, 1978.Google Scholar
- K. Chen, Improved Girault Identification Scheme, IEE Electronics Letters, Vol. 30, No.19, pp. 1590–1591, 1994.Google Scholar
- E. M. Gabidulin, Theory of Code with Maximum Rank Distance, Problems of Information Transmission, Vol. 21, pp. 1–12, 1985.Google Scholar
- M. Girault, A (non-practical) three-pass identification protocol using coding theory, Proceedings of Auscrypt'90, LNCS Vol. 453, pp. 204–211, 1990.Google Scholar
- S. Harari, A New Authentication Algorithm, Coding Theory and Applications, LNCS Vol. 388, pp. 204–211, 1989.Google Scholar
- A. Shamir, An Efficient identification Scheme Based on Permuted Kernels, Proceedings of Crypto'89, Lecture Notes in Computer Science Vol. 435, pp. 606–609, 1990.Google Scholar
- J. Stern, A New Identification Scheme Based on Syndrome Decoding, Proceedings of Crypto'93, Lecture Notes in Computer Science Vol. 773, pp. 13–21, 1994.Google Scholar