Cryptology ePrint Archive: Report 2021/522

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

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

Abstract: 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.

Category / Keywords: public-key cryptography / Lattice, Local field, SVP, CVP, LVP, Signature Scheme, Public-key Cryptosystem

Date: received 20 Apr 2021

Contact author: dengyp at amss ac cn,luolixia@amss ac cn,gjXiao@amss ac cn,panyanbin@amss ac cn,znwang@amss ac cn

Available format(s): PDF | BibTeX Citation

Version: 20210423:122351 (All versions of this report)

Short URL: ia.cr/2021/522


[ Cryptology ePrint archive ]