Author:
Gilchrist Valerie,Marco Laurane,Petit Christophe,Tang Gang
Publisher
Springer Nature Switzerland
Reference48 articles.
1. Lecture Notes in Computer Science;N Alamati,2020
2. Albrecht, M.R., Fenzi, G., Lapiha, O., Nguyen, N.K.: SLAP: succinct lattice-based polynomial commitments from standard assumptions. Cryptology ePrint Archive, Paper 2023/1469 (2023). https://eprint.iacr.org/2023/1469
3. Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.: A new algorithm for solving the rank syndrome decoding problem. In: 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17–22, 2018, pp. 2421–2425. IEEE (2018). https://doi.org/10.1109/ISIT.2018.8437464
4. Lecture Notes in Computer Science;M Bardet,2020
5. Barenghi, A., Biasse, J., Persichetti, E., Santini, P.: On the computational hardness of the code equivalence problem in cryptography. Adv. Math. Commun. 17(1), 23–55 (2023). https://doi.org/10.3934/AMC.2022064