Publisher
Springer Nature Switzerland
Reference18 articles.
1. Avanzi, R., et al.: Crystals-Kyber algorithm specifications and supporting documentation. NIST PQC Round 2, 4 (2017)
2. Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Info. Theory 24(3), 384–386 (1978)
3. Bourgain, J., Konyagin, S.V., Shparlinski, I.E.: Character sums and deterministic polynomial root finding in finite fields. Math. Comput. 84(296), 2969–2977 (2015)
4. Ding, J., Yang, B.Y.: Multivariate Public Key Cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 193–241. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-88702-7_6
5. Garey, M.R., Johnson, D.S.: Computers and intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., USA (1990)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献