Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Trace-based cryptanalysis of cyclotomic $R_{q,0}\times R_q$-PLWE for the non-split case (2209.11962v5)

Published 24 Sep 2022 in cs.CR

Abstract: We describe a decisional attack against a version of the PLWE problem in which the samples are taken from a certain proper subring of large dimension of the cyclotomic ring $\mathbb{F}q[x]/(\Phi{pk}(x))$ with $k>1$ in the case where $q\equiv 1\pmod{p}$ but $\Phi_{pk}(x)$ is not totally split over $\mathbb{F}q$. Our attack uses the fact that the roots of $\Phi{pk}(x)$ over suitable extensions of $\mathbb{F}_q$ have zero-trace and has overwhelming success probability as a function of the number of input samples. An implementation in Maple and some examples of our attack are also provided.

Citations (3)

Summary

We haven't generated a summary for this paper yet.