Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > CYCLOTOMIC POLYNOMIALS:
Reports tagged with cyclotomic polynomials:
TR05-158 | 12th December 2005
Chris Peikert, Alon Rosen

#### Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

The generalized knapsack function is defined as $f_{\a}(\x) = \sum_i a_i \cdot x_i$, where $\a = (a_1, \ldots, a_m)$ consists of $m$
elements from some ring $R$, and $\x = (x_1, \ldots, x_m)$ consists
of $m$ coefficients from a specified subset $S \subseteq R$.
Micciancio ... more >>>

ISSN 1433-8092 | Imprint