8 citations · 16 across the 4 of their papers we have counts for
4 papers
On the Closest Vector Problem for Lattices Constructed from Polynomials and Their Cryptographic Applications
Zhe Li, San Ling, Chaoping Xing +1
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…
On the last fall degree of zero-dimensional Weil descent systems
Ming-Deh A. Huang, Michiel Kosters, Yun Yang +1
In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gröbner basis computations and the heuris…
Notes on summation polynomials
Michiel Kosters, Sze Ling Yeo
In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assu…
New Constant-Weight Codes from Propagation Rules
Yeow Meng Chee, Chaoping Xing, Sze Ling Yeo
This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.