|[AKr]||P. Ackermann and M. Kreuzer, Gröbner basis cryptosystems, AAECC 17 (2006), 173–194.|
|[ARR]||G. S. G. N. Anjaneyulu, P. Vasudeva Reddy, and U. M. Reddy, Secured digital signature scheme using polynomials over non-commutative division semirings, Int. J. Comput. Sci. and Network Security 8 (2008), 278–284.|
|[Aj1]||M. Ajtai, Generating hard instances of lattice problems, in: Proc. 28th ACM Symposium on the Theory of Computing, Philadelphia, 1996, 99–108.|
|[Aj2]||M. Ajtai, The shortest vector problem in L2 is NP-hard for randomized reductions, in: Proc. 30th ACM Symposium on the Theory of Computing, Dallas, 1998,10–19.|
|[AD]||M. Ajtai and C. Dwork, A public key cryptosystem with worst-case /average-case equivalence, in: Proc. ...|
Get A Course in Mathematical Cryptography now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.