LCS35
From Wikipedia, the free encyclopedia
 |
This article needs attention from an expert on the subject. See the talk page for details. WikiProject Mathematics or the Mathematics Portal may be able to help recruit an expert. (October 2009) |
 |
This article may be confusing or unclear to readers. Please help clarify the article; suggestions may be found on the talk page. (October 2009) |
LCS35 is a cryptographic challenge and a puzzle. The idea is to calculate the one-time pad
in order to decrypt the ciphertext z, which in this case includes information to factor n. The value of t was chosen to make the calculation take about 35 years since the puzzle was published in 1999.
[edit] External links
Description of the LCS35 Time Capsule Crypto-Puzzle
 |
This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
