Editing 153: Cryptography

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 8: Line 8:
  
 
==Explanation==
 
==Explanation==
βˆ’
This comic refers to the study of {{w|cryptography}}. We can note the presence of the {{w|International Association for Cryptologic Research|International Association for Cryptologic Research (IACR)}} logo in the lectern ([[1661|podium?]]), an association that organizes the most important conferences in the cryptology field.  
+
This comic refers to the study of {{w|cryptography}}. We can note the presence of the {{w|International Association for Cryptologic Research|International Association for Cryptologic Research (IACR)}} logo in the lectern, an association that organizes the most important conferences in the cryptology field.  
  
 
[[Randall]], drawn as [[Cueball]] behind the lectern at the podium, is describing a proposed crypto system in which a computer program turns a very large number, called the "{{w|key (cryptography)|key}}," and a message into an encrypted form that can only be read by using the same key, based on the model of a {{w|Feistel cipher}}. Part of any Feistel cipher is the "round function," which determines how the key is applied to the original message; this is applied multiple times with a variety of tricks and techniques to ensure that the process can eventually be reversed. One common component of round functions is the {{w|S-box}}, a simple table that converts input bytes into output bytes, preferably in a way that doesn't correspond to any mathematical rules.
 
[[Randall]], drawn as [[Cueball]] behind the lectern at the podium, is describing a proposed crypto system in which a computer program turns a very large number, called the "{{w|key (cryptography)|key}}," and a message into an encrypted form that can only be read by using the same key, based on the model of a {{w|Feistel cipher}}. Part of any Feistel cipher is the "round function," which determines how the key is applied to the original message; this is applied multiple times with a variety of tricks and techniques to ensure that the process can eventually be reversed. One common component of round functions is the {{w|S-box}}, a simple table that converts input bytes into output bytes, preferably in a way that doesn't correspond to any mathematical rules.

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)