Lattice-based PKEs/KEMs  

作　　者：Xianhui Lu Jiang Zhang 

机构地区：[1]nstitute of Information Engineering,Chinese Academy of Sciences,China [2]State Key Laboratory of Cryptology,China

出　　处：《National Science Review》2021年第9期2-3,共2页国家科学评论（英文版）

基　　金：supported by the National Natural Science Foundation of China(6197239 to X.L.;62022018 and 61932019 to J.Z.);the National Key Research and Development Program of China(2018YFB0804105 to J.Z.)。

摘　　要：The invention of public-key cryptography(PKC)by Diffie and Hellman in 1976 is one of two milestones marking the beginning of modern cryptography.The security of a PKC system requires that it should be infeasible to compute the private key from a given public key,which in turn is typically guaranteed by the difficulty in solving some cryptographicfriendly mathematical problems.Among those problems,the integer factorization and discrete logarithm problems play pivotal roles in the development of public-key cryptography.

关 键 词：INTEGER LOGARITHM typically 

分 类 号：TN918.1[电子电信—通信与信息系统]