Trace-based cryptoanalysis of cyclotomic PLWE for the non-split case

09/24/2022
by   Iván Blanco Chacón, et al.
0

We provide an attack against the decision version of PLWE over the cyclotomic ring 𝔽_q[x]/(Φ_p^k(x)) with k>1 in the case where q≡ 1p but Φ_p^k(x) is not totally split over 𝔽_q. Our attack uses that the roots of Φ_p^k(x) over suitable extensions of 𝔽_q have zero-trace and has overwhelming success probability in function of the number of samples taken as input. An implementation in Maple and some examples of our attack are also provided.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2018

On polycyclic codes over a finite chain ring

Galois images of polycyclic codes over a finite chain ring S and their a...
research
11/05/2018

Polyadic cyclic codes over a non-chain ring F_q[u,v]/〈 f(u),g(v), uv-vu〉

Let f(u) and g(v) be any two polynomials of degree k and ℓ respectively ...
research
09/24/2020

L_2-norm sampling discretization and recovery of functions from RKHS with finite trace

We provide a spectral norm concentration inequality for infinite random ...
research
01/11/2022

Improving the minimum distance bound of Trace Goppa codes

In this article we prove that a class of Goppa codes whose Goppa polynom...
research
02/14/2022

Trace norm regularization for multi-task learning with scarce data

Multi-task learning leverages structural similarities between multiple t...
research
04/03/2019

An Improved Upper Bound for the Ring Loading Problem

The Ring Loading Problem emerged in the 1990s to model an important spec...
research
06/29/2023

How trace plots help interpret meta-analysis results

The trace plot is seldom used in meta-analysis, yet it is a very informa...

Please sign up or login with your details

Forgot password? Click here to reset