Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Talk:Ring learning with errors

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 2 years ago by 2604:5500:C29D:FF01:2059:2215:8DE:21D1 in topic Irreducible polynomial

Why quantum safe?

[edit]

Is there a proof of some kind as to why RLWE is quantum-safe - or is that question nonsensical? (Meaning, "thought quantum-safe given what current quantum circuits can do.") Jimw338 (talk) 23:51, 18 February 2018 (UTC)Reply

Yes, there is a proof. "Kind-off". See NP-hard problems.  Preceding unsigned comment added by 37.120.92.37 (talk) 09:19, 25 May 2018 (UTC)Reply

Quotiens are not subrings

[edit]

The statement: "The sub-ring is typically the finite quotient (factor) ring formed by reducing all of the polynomials in {\textstyle \mathbf {F} _{q}[x]} {\textstyle \mathbf {F} _{q}[x]} modulo an irreducible polynomial {\textstyle \Phi (x)} {\textstyle \Phi (x)}" does not make sense as quotient rings are not subrings. They might be represented by a subring, but there is a mathematical distinction.  Preceding unsigned comment added by 37.120.92.37 (talk) 09:15, 25 May 2018 (UTC)Reply

Irreducible polynomial

[edit]

The cyclotomic polynomial is irreducible over . The article makes it sound it like we need to pick an irreducible polynomial over , which it may not be (nor do we need it to be). 2604:5500:C29D:FF01:2059:2215:8DE:21D1 (talk) 00:25, 20 September 2023 (UTC)Reply