Paper 2022/874

Lattice Codes for Lattice-Based PKE

Shanxiang Lyu, Jinan University
Ling Liu, Shenzhen University
Junzuo Lai, Jinan University
Cong Ling, Imperial College London
Hao Chen, Jinan University

The public key encryption (PKE) protocol in lattice-based cryptography (LBC) can be modeled as a noisy point-to-point communication system, where the communication channel is similar to the additive white Gaussian noise (AWGN) channel. To improve the error correction performance, this paper investigates lattice-based PKE from the perspective of lattice codes. We propose an efficient labeling function that converts between binary information bits and lattice codewords. The proposed labeling is feasible for a wide range of lattices, including Construction-A and Construction-D lattices. Based on Barnes-Wall lattices, a few improved parameter sets with either higher security or smaller ciphertext size are proposed for FrodoPKE.

Available format(s)
Public-key cryptography
Publication info
public key encryption (PKE) lattice-based cryptography (LBC) lattice codes
Contact author(s)
lsx07 @ jnu edu cn
liulingcs @ szu edu cn
laijunzuo @ gmail com
c ling @ imperial ac uk
chenhao @ fudan edu cn
2022-08-04: last of 2 revisions
2022-07-04: received
See all versions
Short URL
Creative Commons Attribution


      author = {Shanxiang Lyu and Ling Liu and Junzuo Lai and Cong Ling and Hao Chen},
      title = {Lattice Codes for Lattice-Based PKE},
      howpublished = {Cryptology ePrint Archive, Paper 2022/874},
      year = {2022},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.