computer science

RSA Secret-Key Challenge

RSA Secret-Key Challenge is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand RSA Secret-Key Challenge rather than just read about it. In short: The RSA Secret-Key Challenge was a series of cryptographic contests organised by RSA Laboratories with the intent of helping to demonstrate the relative security of different encryption algorithms. The challenge ran from 28 January 1997 until May 2007.

Key takeaways

RSA Secret-Key Challenge belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect RSA Secret-Key Challenge to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of RSA Secret-Key Challenge from memory before moving on to harder problems.

Reference excerpt

The RSA Secret-Key Challenge was a series of cryptographic contests organised by RSA Laboratories with the intent of helping to demonstrate the relative security of different encryption algorithms. The challenge ran from 28 January 1997 until May 2007.

Contest details For each contest, RSA had posted on its website a block of ciphertext and the random initialization vector used for encryption. To win, a contestant would have had to break the code by finding the original plaintext and the cryptographic key that will generate the posted ciphertext from the plaintext. The challenge consisted of one DES contest and twelve contests based around the block cipher RC5. Each of the RC5 contests is named after the variant of the RC5 cipher used. The name RC5-w/r/b indicates that the cipher used w-bit words, r rounds, and a key made up of b bytes. The contests are often referred to by the names of the corresponding distributed.net projects, for example RC5-32/12/9 is often known as RC5-72 due to the 72-bit key size. The first contest was DES Challenge III (and was also part of the DES Challenges) and was completed in 22 hours 15 minutes by distributed.net and the EFF's Deep Crack machine. In May 2007 RSA Laboratories announced the termination of the challenge, stating that they would not disclose the solutions to the remaining contents, and nor would they confirm or reward prize money for future solutions. On 8 September 2008 distributed.net announced that they would fund a prize of $4000 for the RC5-32/12/9 contest.

Distributed.net

The contests are associated with the distributed.net group, which had actively participated in the challenge by making use of distributed computing to perform a brute force attack. RC5-32/12/7 was completed on 19 October 1997, with distributed.net finding the winning key in 250 days and winning the US$10,000 prize. The recovered plaintext was: The unknown message is: It's time to move to a longer key length. RC5-32/12/8 also carried a US$10,000 prize and was completed by distributed.net on 14 July 2002. It took the group 1,757 days to locate the key, revealing the plaintext: The unknown message is: Some things are better left unread. There were eight contests that had not yet been solved, RC5/32/12/9 through RC5/32/12/16, each of which was a US$10,000 prize. Distributed.net is working on RC5-32/12/9 and were at 15.200% as of January 1 2026 (12.298% as of July 13 2024, 7.559% as of March 22 2021, 6.700% as of 20 June 2020, 5.329% as of 18 September 2018, 4.356% as of 7 January 2017).

Worked examples

Example 1 — a first encounter with RSA Secret-Key Challenge

Start with the simplest possible case. Write down what RSA Secret-Key Challenge claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to RSA Secret-Key Challenge before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about RSA Secret-Key Challenge ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of RSA Secret-Key Challenge

In research: RSA Secret-Key Challenge appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses RSA Secret-Key Challenge in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: RSA Secret-Key Challenge is common in secondary-school and first-year university syllabi. It links to neighbouring topics Cryptography contests, Recurring events disestablished in 2007, Recurring events established in 1997, so understanding it makes those chapters shorter.
In everyday life: Look for RSA Secret-Key Challenge outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study RSA Secret-Key Challenge in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what RSA Secret-Key Challenge means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain RSA Secret-Key Challenge out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is RSA Secret-Key Challenge in simple terms?

Why does RSA Secret-Key Challenge matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study RSA Secret-Key Challenge?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on RSA Secret-Key Challenge.