San Ling

CCA2 Attack and Modification of Huang<i>et al</i>.’s Public Key Encryption with Authorized Equality Test

2016 · The Computer Journal

In this article, we identify a flaw in Huang et al.'s public key encryption with authorized equality test (The Computer Journal, 2015). More precisely, we point out that the proof of the indistinguishability under adaptive …

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 Comparison of Distance Bounds for Quasi-Twisted Codes

2021 · IEEE Transactions on Information Theory

Spectral bounds on the minimum distance of quasi-twisted codes over finite fields are proposed, based on eigenvalues of polynomial matrices and the corresponding eigenspaces. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a way similar …