Chaoping Xing

On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications

2017 · arXiv (Cornell University)

In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closest vector problem is hard …

A New Metric on Symmetric Group and Application to Block Permutation Codes.

2021 · arXiv (Cornell University)

Permutation codes have received a great attention due to various applications. For different applications, one needs permutation codes under different metrics. The generalized Cayley metric was introduced by Chee and Vu [4] and this metric …

Binary sequences with a low correlation via cyclotomic function fields with odd characteristics

2022 · arXiv (Cornell University)

Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary sequences attracts great …

Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)

2025 · IEEE Transactions on Information Theory

Fast encoding and decoding of codes have always been an important topic in coding theory as well as complexity theory. Although encoding is easier than decoding in general, designing an encoding algorithm of codes of …