Editing 2626: d65536

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 17: Line 17:
  
 
The title text references how cryptographic systems (especially RSA and other factoring-is-hard based systems) are vulnerable to quantum attacks as quantum computing technology develops. The title text is essentially punning on the idea of a "large" quantum system. "Large" in the quantum computing sense would be on the order of 64 qubits each of which would be an atom or two at most. This would still be microscopic and will never be as large as the giant die the comic is centered on; but for a well-observed environment and human rolling without sufficient entropy (consider somebody obsessed with a certain number dropping the die on something soft), a conventional computer could predict some rolls. See also [[538]] for non-mathematical paths of cryptography.
 
The title text references how cryptographic systems (especially RSA and other factoring-is-hard based systems) are vulnerable to quantum attacks as quantum computing technology develops. The title text is essentially punning on the idea of a "large" quantum system. "Large" in the quantum computing sense would be on the order of 64 qubits each of which would be an atom or two at most. This would still be microscopic and will never be as large as the giant die the comic is centered on; but for a well-observed environment and human rolling without sufficient entropy (consider somebody obsessed with a certain number dropping the die on something soft), a conventional computer could predict some rolls. See also [[538]] for non-mathematical paths of cryptography.
 
Since 65536 is 2^16, if for some reason you must simulate a D65536 using nothing but D&D dice, the most efficient method is to roll a D8 4 times and roll a D4 twice (2^(3×4) · 2^(2×2)), or roll a D8 5 times and toss a coin (2^(3×5) × 2).
 
  
 
==Transcript==
 
==Transcript==

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)