Talk:Lattice-based cryptography: Difference between revisions

Content deleted Content added

Inline

Revision as of 10:35, 18 December 2011

Cryptography: Computer science Unassessed

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography 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.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography articles
???	This article has not yet received a rating on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the importance scale.
	This article is supported by WikiProject Computer science.

Merge Lattice problems into this article

I propose merger of the Lattice problems article into this one. IMHO, the Lattice problems article, in its current state, does not warrant a separate page. Also, eventually, many of the problems mentioned will have a separate page of their own, and hence, the article will end up being a short condensed summary of each problem, the number of which is not too many. Hrushikesh Tilak (talk) 21:25, 31 July 2009 (UTC)[reply]

Agreed. Merging is a good idea. --Robin (talk) 17:35, 20 August 2009 (UTC)[reply]

Agreed. They really should be merged. Search engines point to this page on some searches and to Lattice Based Cryptography page on others (related searches). I second your thoughts on this. —Preceding unsigned comment added by Akashssp (talk • contribs) 16:40, 9 January 2010 (UTC)[reply]

Disagreed. This article is about a hard problem in computer science. Many such problems may have applications in cryptography, however that is not their primary function. They are surely separate articles. —Preceding unsigned comment added by 128.82.39.139 (talk) 14:40, 13 September 2010 (UTC)[reply]

Disagreed. Ditto the above comments. Theoretical computer science has a separate existence outside of the world of cryptography. — 15 March 2011 (talk)

Disagreed. Ditto the above comments. Why do we have separate articles for RSA, factoring and discrete logarithms? Because one must distinguish a computational problem from its (cryptographic) applications. I think the lattice problems article should include the information related to mathematical problem, methods to tackle them and a short section for the "distinction" between its classical and quantum complexity; the cryptography page should contain the information related lattice protocols, comparison with other ones and a discussion about their robustness.

By the way, I am not an expert on this particular topic but I it is related to my work; I study quantum computation and information.

Garrapito (talk) 10:35, 18 December 2011 (UTC)[reply]

@@ Line 11: / Line 11: @@
 : '''Disagreed'''. Ditto the above comments. Why do we have separate articles for RSA, factoring and discrete logarithms? Because one must distinguish a computational problem from its (cryptographic) applications. I think the lattice problems article should include the information related to mathematical problem, methods to tackle them and a short section for the "distinction" between its classical and quantum complexity; the cryptography page should contain the information related lattice protocols, comparison with other ones and a discussion about their robustness.
-By the way, I am not an expert on this particular topic but I it is related to my work; I study quantum computation and information.
+: By the way, I am not an expert on this particular topic but I it is related to my work; I study quantum computation and information.
 [[User:Garrapito|Garrapito]] ([[User talk:Garrapito|talk]]) 10:35, 18 December 2011 (UTC)