[Resource Topic] 2021/522: Public-key Cryptosystems and Signature Schemes from p-adic Lattices

Welcome to the resource topic for 2021/522

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

Authors: Yingpu Deng, Lixia Luo, Yanbin Pan, Zhaonan Wang, 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.

ePrint: https://eprint.iacr.org/2021/522

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .