laceration
发表于 2025-3-30 11:44:39
http://reply.papertrans.cn/43/4249/424849/424849_51.png
微不足道
发表于 2025-3-30 12:57:46
http://reply.papertrans.cn/43/4249/424849/424849_52.png
affluent
发表于 2025-3-30 18:08:54
R. H. Griffithhardness of the Ajtai-Dwork cryptosystem: from a recent result of Goldreich and Goldwasser, our result shows that breaking the Ajtai-Dwork cryptosystem is not NP-hard, assuming the polynomial-time hierarchy does not collapse.