Talk:Ring learning with errors

	This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the project page for more information.Articles for creationWikipedia:WikiProject Articles for creationTemplate:WikiProject Articles for creationAfC articles
	This article was accepted from this draft on 22 July 2015 by reviewer PotatoNinja (talk · contribs).

Mathematics Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

Computer science Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Computing: Security Low‑importance

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles

Low

This article has been rated as Low-importance on the project's importance scale.

This article is supported by WikiProject Computer Security (assessed as Low-importance).

Things you can help WikiProject Computer Security with:

Article alerts will be generated shortly by AAlertBot. Please allow some days for processing. More information...

Review importance and quality of existing articles
Identify categories related to Computer Security
Tag related articles
Identify articles for creation (see also: Article requests)
Identify articles for improvement
Create the Project Navigation Box including lists of adopted articles, requested articles, reviewed articles, etc.
Find editors who have shown interest in this subject and ask them to take a look here.

Why quantum safe?

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

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

The cyclotomic polynomial $\Phi (x)$ is irreducible over $\mathbb {Q}$ . The article makes it sound it like we need to pick an irreducible polynomial over $\mathbb {Z} _{q}$ , 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]