Content deleted Content added
Line 8:
: '''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. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/128.82.39.139|128.82.39.139]] ([[User talk:128.82.39.139|talk]]) 14:40, 13 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
: '''Disagreed'''. Ditto the above comments. Theoretical computer science has a separate existence outside of the world of cryptography. <span style="font-size: smaller;" class="autosigned">— 15 March 2011 ([[User talk:64.100.220.139|talk]]) </span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
: '''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.
| |||