Paper 2021/522

Public-key Cryptosystems and Signature Schemes from p-adic Lattices

Yingpu Deng, Lixia Luo, Yanbin Pan, Zhaonan Wang, and Guanju Xiao


In 2018, the longest vector problem and closest vector problem in local fields were introduced, as the p-adic analogues of the shortest vector problem and closest vector problem in lattices of Euclidean spaces. They are considered to be hard and useful in constructing cryptographic primitives, but no applications in cryptography were given. In this paper, we construct the first signature scheme and public-key encryption cryptosystem based on p-adic lattice by proposing a trapdoor function with the orthogonal basis of p-adic lattice. These cryptographic schemes have reasonable key size and efficiency, which shows that p-adic lattice can be a new alternative to construct cryptographic primitives and well worth studying.

Available format(s)
Public-key cryptography
Publication info
Preprint. MINOR revision.
LatticeLocal fieldSVPCVPLVPSignature SchemePublic-key Cryptosystem
Contact author(s)
dengyp @ amss ac cn
luolixia @ amss ac cn
gjXiao @ amss ac cn
panyanbin @ amss ac cn
znwang @ amss ac cn
2022-05-19: revised
2021-04-23: received
See all versions
Short URL
Creative Commons Attribution


      author = {Yingpu Deng and Lixia Luo and Yanbin Pan and Zhaonan Wang and Guanju Xiao},
      title = {Public-key Cryptosystems and Signature Schemes from p-adic Lattices},
      howpublished = {Cryptology ePrint Archive, Paper 2021/522},
      year = {2021},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.