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 Fq[x]/(Φp k (x)) with k > 1 in the case where q ≡ 1 (mod p) but Φp k (x) is not totally split over Fq. Our attack uses the fact that the roots of Φp k (x) over suitable extensions of Fq 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.Agencia Estatal de InvestigaciónUniversidad de Alcal
Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants k...
The ring variant of learning with errors (Ring-LWE) problem has provided efficient post-quantum cryp...
Since its introduction in 2010 by Lyubashevsky, Peikert and Regev, the ring learning with errors pro...
We describe a decisional attack against a version of the PLWE problem inwhich the samples are taken ...
In this paper, we survey the status of attacks on the ring and polynomial learning with errors probl...
In CRYPTO 2015, Elias, Lauter, Ozman and Stange described an attack on the non-dual decision version...
In this paper, we survey the status of attacks on the ring and polynomial learning with errors probl...
The Ring Learning-With-Errors (RLWE) problem shows great promise for post-quantum cryptography and h...
The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learn...
The Ring-LWE over two-to-power cyclotomic integer rings has been the hard computational problem for ...
The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learn...
© International Association for Cryptologic Research 2016. In CRYPTO 2015, Elias, Lauter, Ozman and ...
Abstract. The ring and polynomial learning with errors problems (Ring-LWE and Poly-LWE) have been pr...
We generalise our previous work by giving a polynomial upper bound on the condition number of certa...
Abstract. We describe a new attack on the Search Ring Learning-With-Errors (RLWE) problem based on t...
Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants k...
The ring variant of learning with errors (Ring-LWE) problem has provided efficient post-quantum cryp...
Since its introduction in 2010 by Lyubashevsky, Peikert and Regev, the ring learning with errors pro...
We describe a decisional attack against a version of the PLWE problem inwhich the samples are taken ...
In this paper, we survey the status of attacks on the ring and polynomial learning with errors probl...
In CRYPTO 2015, Elias, Lauter, Ozman and Stange described an attack on the non-dual decision version...
In this paper, we survey the status of attacks on the ring and polynomial learning with errors probl...
The Ring Learning-With-Errors (RLWE) problem shows great promise for post-quantum cryptography and h...
The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learn...
The Ring-LWE over two-to-power cyclotomic integer rings has been the hard computational problem for ...
The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learn...
© International Association for Cryptologic Research 2016. In CRYPTO 2015, Elias, Lauter, Ozman and ...
Abstract. The ring and polynomial learning with errors problems (Ring-LWE and Poly-LWE) have been pr...
We generalise our previous work by giving a polynomial upper bound on the condition number of certa...
Abstract. We describe a new attack on the Search Ring Learning-With-Errors (RLWE) problem based on t...
Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants k...
The ring variant of learning with errors (Ring-LWE) problem has provided efficient post-quantum cryp...
Since its introduction in 2010 by Lyubashevsky, Peikert and Regev, the ring learning with errors pro...