Author:
Canteaut Anne,Sendrier Nicolas
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. A. Canteaut and F. Chabaud. A new algorithm for finding minimum-weight words in a linear code: application to McEliece’s cryptosystem and to narrowsense BCH codes of length 511. IEEE Transactions on Information Theory, IT-44(1):367–378, 1998.
2. J.G. Kemeny and J.L. Snell. Finite Markov chains. Springer-Verlag, 1960.
3. Lect Notes Comput Sci;P.J. Lee,1988
4. Y.X. Li, R.H. Deng, and X.M. Wang. On the equivalence of McEliece’s and Niederreiter’s public-key cryptosystems. IEEE Transactions on Information Theory, IT-40(1):271–273, 1994.
5. J.S. Leon. A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory, 34(5):1354–1359, 1988.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Understanding binary-Goppa decoding;IACR Communications in Cryptology;2024-04-09
2. CryptAttackTester: high-assurance attack analysis;Lecture Notes in Computer Science;2024
3. A novel attack on McEliece's cryptosystem;International Journal of Computer Mathematics: Computer Systems Theory;2023-07-03
4. Estimation of the Power of Algebraic Geometric Codes Designed to Construct a Post-Quantum Algorithm for Ensuring Information Security of On-board Systems;2023 Systems of Signals Generating and Processing in the Field of on Board Communications;2023-03-14
5. Two modifications for Loidreau’s code-based cryptosystem;Applicable Algebra in Engineering, Communication and Computing;2022-08-16