A new identification algorithm-Reference-Cited by-同舟云学术

A new identification algorithm

Published:1996 Issue: Volume: Page:244-249
ISSN:0302-9743
Container-title:Cryptography: Policy and Algorithms
language:
Short-container-title:

Author:

Chen Kefei

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0032363

Reference7 articles.

1. 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.

2. K. Chen, Improved Girault Identification Scheme, IEE Electronics Letters, Vol. 30, No.19, pp. 1590–1591, 1994.

3. E. M. Gabidulin, Theory of Code with Maximum Rank Distance, Problems of Information Transmission, Vol. 21, pp. 1–12, 1985.

4. M. Girault, A (non-practical) three-pass identification protocol using coding theory, Proceedings of Auscrypt'90, LNCS Vol. 453, pp. 204–211, 1990.

5. S. Harari, A New Authentication Algorithm, Coding Theory and Applications, LNCS Vol. 388, pp. 204–211, 1989.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Code-based signatures from new proofs of knowledge for the syndrome decoding problem;Designs, Codes and Cryptography;2022-10-13

2. A gapless code-based hash proof system based on RQC and its applications;Designs, Codes and Cryptography;2022-08-12

3. Cryptanalysis of a Code-Based Identification Scheme Presented in CANS 2018;Cryptography, Codes and Cyber Security;2022

4. An Efficient Identification Scheme Based on Rank Metric;Foundations and Practice of Security;2020

5. On the Complexity of the Rank Syndrome Decoding Problem;IEEE Transactions on Information Theory;2016-02