Publisher
Springer Nature Switzerland
Reference23 articles.
1. Babai, L.: Graph isomorphism in quasipolynomial time (2015). https://arxiv.org/abs/1512.03547
2. Bardet, M., Otmani, A., Saeed-Taha, M.: Permutation code equivalence is not harder than graph isomorphism when hulls are trivial. In: 2019 IEEE International Symposium on Information Theory (ISIT). IEEE (2019). https://doi.org/10.1109/isit.2019.8849855
3. Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 1, pp. 10–24 (2016). https://doi.org/10.1137/1.9781611974331.ch2
4. Bennett, H., Ganju, A., Peetathawatchai, P., Stephens-Davidowitz, N.: Just how hard are rotations of $$\mathbb{Z} ^n$$? Algorithms and cryptography with the simplest lattice. Cryptology ePrint Archive, Paper 2021/1548 (2021). https://eprint.iacr.org/2021/1548
5. Lecture Notes in Computer Science;W Beullens,2021
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献