Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Alexander Barg: Handbook of coding theory, Chapter 7: Complexity Issues in Coding Theory; North Holland, 1999.
2. E.R. Berlekamp, R.J. McEliece, H.C.A. van Tilborg: On the inherent intractability of certain coding problems; IEE Trans. Inf. Th., IT-24(3), pp. 384–386, May 1978.
3. Anne Canteaut, Florent Chabaud: A newalgorithm for finding minimum-weight words in a linear code: application to McEliece’s cryptosystem and to BCH Codes of length 511
4. Lect Notes Comput Sci;K. Chen,1996
5. Amos Fiat, Adi. Shamir: Howto prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology, Crypto’ 86, pp. 186–194, Springer-Verlag, 1987.
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Generalized Low-Rank Parity-Check Codes;IEEE Transactions on Information Theory;2024-08
2. Solving systems of algebraic equations over finite commutative rings and applications;Applicable Algebra in Engineering, Communication and Computing;2024-04-24
3. Building MPCitH-Based Signatures from MQ, MinRank, and Rank SD;Lecture Notes in Computer Science;2024
4. Practical and Theoretical Cryptanalysis of VOX;Lecture Notes in Computer Science;2024
5. Refined F5 Algorithms for Ideals of Minors of Square Matrices;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24