HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Five members of a project team each want to send private messages to every other member, using…
MediumComputer ScienceHigh School (9–10)Computer Science › Encryption and Cyber SecurityNumericalConceptualIGCSE

Five members of a project team each want to send private messages to every other member, using…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Five members of a project team each want to send private messages to every other member, using symmetric encryption. Each pair of members must have its own key, so that nobody can read messages meant for others.

  1. How many keys are needed?
  1. Ana emails a new key to Ben, and the email is intercepted. Explain what the attacker can now do.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Symmetric encryption uses the same key to encrypt and to decrypt, so the key must be shared, and an intercepted key lets anyone decrypt. A key of nnn bits has 2n2^n2n possible values. If each pair of NNN people needs its own key, there are N(N−1)2\dfrac{N(N - 1)}{2}2N(N−1)​ keys.

The worked solution

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Count the pairs. The first member pairs with 444 others, the second with 333 new ones, then 222, then 111: 4+3+2+1=104 + 3 + 2 + 1 = 104+3+2+1=10 keys. The formula 5×42=10\dfrac{5 \times 4}{2} = 1025×4​=10 gives the same.

Step 2. The intercepted key. The same key decrypts as well as encrypts. So the attacker can decrypt every message that Ana and Ben send each other with it, and even write fake encrypted messages. This is the main weakness of symmetric encryption: the key must be shared, and sharing it is risky.

Answer: (a) 101010 keys. (b) The attacker can decrypt all the messages between Ana and Ben.

Log in to save this for later
← All Problems
← A thief tries to break a message encrypted with a 40-bit symmetric key…A class of 20 students wants every student to be able to send a private message to every other… →
More onComputer Science › Encryption and Cyber Security

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. A teacher wants each of her 30 students to be able to send her a private message that no other…Hard
  2. This is a toy model with tiny numbers. The exam does not ask for this calculation…Medium
  3. A company has 12 staff, and each has an asymmetric key pair…Easy
  4. A class of 20 students wants every student to be able to send a private message to every other…Hard
  5. A thief tries to break a message encrypted with a 40-bit symmetric key…Medium
All problems on this topic →