1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Symposium on the Theory of Computing - STOC 1996, pp. 99–108. ACM (1996)
2. Alamélou, Q., Blazy, O., Cauchie, S., Gaborit, P.: A code-based group signature scheme. Des. Codes Cryptogr. 82(1–2), 469–493 (2017)
3. Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: Innovations in Theoretical Computer Science Conference - ITCS 2017, vol. 67 of LIPIcs, pp. 7:1–7:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
4. Lecture Notes in Computer Science;N Aragon,2019
5. Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. IACR Cryptol. ePrint Arch. 2003/230 (2003)