LCS35 is a cryptographic challenge and a time-lock puzzle set by Ron Rivest in 1999. The challenge is to calculate the value w = 2 2 t ( mod n ) {\displaystyle w=2^{2^{t}}{\pmod {n}}} where t is a specific 14-digit (or 47-bit) integer, namely 79685186856218, and n is a specific 616-digit (or 2048-bit) integer that is the product of two large primes (which are not given).
LCS35 is a cryptographic challenge and a time-lock puzzle set by Ron Rivest in 1999. The challenge is to calculate the value w = 2 2 t ( mod n ) {\displaystyle w=2^{2^{t}}{\pmod {n}}} where t is a specific 14-digit (or 47-bit) integer, namely 79685186856218, and n is a specific 616-digit (or 2048-bit) integer that is the product of two large primes (which are not given).
Source: Wikipedia "LCS35" · CC BY-SA 4.0
Share this article: X · Bluesky