Content deleted Content added
Citation bot (talk | contribs) Add: pmid, s2cid, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_toolbar |
→Security of symmetric ciphers: added para on post-quantum cryptography |
||
Line 28:
== Security of symmetric ciphers ==
Symmetric ciphers have historically been susceptible to [[known-plaintext attack]]s, [[chosen-plaintext attack]]s, [[differential cryptanalysis]] and [[linear cryptanalysis]]. Careful construction of the functions for each round can greatly reduce the chances of a successful attack.{{citation needed|date=April 2012}} It is also possible to increase the key length or the rounds in the encryption process to better protect against attack. This, however, tends to increase the processing power and decrease the speed at which the process runs due to the amount of operations the system needs to do.<ref>{{Cite book |title=Hack proofing your network|date=2002|publisher=Syngress|author=David R. Mirza Ahmad |author2=Ryan Russell|isbn=1-932266-18-6|edition=2nd |___location=Rockland, MA|pages=165–203|oclc=51564102}}</ref>
Most modern symmetric-key algorithms appear to be resistant to the threat of [[post-quantum cryptography]].<ref name="djb-intro">{{cite book |author=Daniel J. Bernstein |title=Post-Quantum Cryptography |year=2009 |chapter=Introduction to post-quantum cryptography |author-link=Daniel J. Bernstein |chapter-url=http://www.pqcrypto.org/www.springer.com/cda/content/document/cda_downloaddocument/9783540887010-c1.pdf}}</ref> [[Quantum computing|Quantum computers]] would exponentially increase the speed at which these ciphers can be decoded; [[Grover's algorithm]], for example, would take the square-root of the time taken for a [[brute-force attack]]. However, these vulnerabilities can be relatively simply compensated for by increasing key length.<ref name="djb-groverr">{{cite journal |author=Daniel J. Bernstein |author-link=Daniel J. Bernstein |date=2010-03-03 |title=Grover vs. McEliece |url=http://cr.yp.to/codes/grovercode-20100303.pdf}}</ref>
== Key management ==
| |||