1. Ajtai M (1996) Generating hard instances of lattice problems. In: Proceedings of 28th annual ACM symposium on theory of computing, pp 99–108
2. Ajtai (1998) Worst-case complexity, worst-case complexity and lattice problems. Doc Math J DMV III ICM:421–428
3. Ajtai M, Dwork C (1997) A public-key cryptosystem with worst-case/average-case equivalence In: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (STOC ’97).Association for Computing Machinery. New York, pp 284–293. https://doi.org/10.1145/258533.258604
4. Alkim E, Bindel N, Buchmann JA, Dagdelen Ö, Schwabe P (2015) Tesla: tightly-secure efficient signatures from standard lattices. IACR Cryptology ePrint Archive, vol 2015, p 755
5. Aydin A, Cameron P, Patrick S (2013) Low-cost and area-efficient FPGA implementations of lattice-based cryptography. In: 2013 IEEE international symposium on hardware-oriented security and trust (HOST), pp 81–86