Showing posts with label mathematical games. Show all posts
Showing posts with label mathematical games. Show all posts
13 Jun 2013
RSA Public-Key Encryption: Upper Secondary Mathematics
The idea behind every encryption system is to make communication between two parties secure and secret. The systems we have looked at this week involve a method, or algorithm, and a key; sometimes the encryption and decryption keys are the same, sometimes different. The task of anybody trying to intercept the communication is to try to discover both the algorithm and the encryption/decryption keys.
In 1977 a counter-intuitive discovery was published: that it was possible to devise a system where the encryption key was made public with only the decryption key kept private. This became known as RSA Public-Key Encryption and is still in use today.
Rather than thinking about it in terms of keys, imagine we have a lock-and-key system. Zeta receives all her communication via a courier system that places every message inside a box, locks it and then sends it to her. Zeta has created many copies of her private lock and distributes them throughout the world. Anybody who wishes to communicate with her places their message in a courier box, finds one of Zeta’s special locks and then closes the box securely using that lock. Anybody can do this, but only Zeta holds the key that unlocks the box! The encryption locks are public but the decryption key is private.
The mathematics behind this system involves knowledge of prime numbers and modular arithmetic. Let me go through one example, then you can try a similar question.
12 Jun 2013
The Undecipherable Cipher: Middle Secondary Mathematics

The weakness of the substitution ciphers used in the first two questions is that the distribution of letter frequencies remains intact. However, there is a very simple yet powerful method that changes the distribution of letters, thereby making the ciphertext much harder to crack.
The most common letters in the English language form the sequence ETAON RISHD; the most common double letters are TH and HE; and the most common first letter of a word is T. If blank spaces are encoded, then the ”space” becomes the most popular symbol (for example, in Unicode the “space” is encoded as U+2420). All this statistical information is used to crack simple substitution ciphers. However, what would happen if we used a sequence of different substitutions? A 16th century French diplomat, Blaise de Vigenère, perfected just such an encryption method that now bears his name.
Imagine that instead of one alphabet disk we have a sequence of them. Both the plaintext and ciphertext letters are in alphabetical order. Now, imagine picking a keyword, let’s start with something simple such as BYTE. Set the first wheel so that the plaintext letter A is encoded into the letter B; then set the second wheel so that A encodes into Y; then set the third and fourth wheels to T and E. No further wheels are needed in this case. Now, take your plaintext and encode the first letter using the first wheel, encode the second letter using the second wheel, and so on. Once you reach the end of your keyword start from the beginning again; in this way the fifth letter of the plaintext will be encoded using the first wheel again. This very simple method destroys the frequency distribution of the letters in the plaintext.
Without computers, the Vigenère Cipher is extremely difficult to crack. Indeed, if the keyword is very long - say, a whole poem - or at least longer than the actual message, then it is impossible to crack! It became so famous as to be called the Undecipherable Cipher. However, using some brute force computing and a fairly short keyword, some new statistical patterns emerge.
11 Jun 2013
Cracking Codes: Lower Secondary Mathematics
As a student, I first came across it as a teenager attending the Mathematics Masterclasses at the Royal Institution. I later taught a similar course at a Gifted Summer School. Indeed, it makes a great project for gifted maths clubs, summer schools and any other form of extension to the standard curriculum.
The first puzzle was a simple substitution cipher often called the Caesar Shift Cipher or rot-N, where N denotes the number of letters by which the alphabet has been shifted, or rotated when using an alphabet wheel.
The problem with merely shifting the alphabet is that there are very few ways to encode a message; if you get one letter correct, the whole message appears! Assuming a 26-letter alphabet, the simple shift cipher has only 25 settings - the 26th setting is the original plaintext. However, if we substitute the letters randomly, we have 26! possible permutations and that’s over 4x1026 potential ciphertexts – over 40,000,000,000,000,000,000,000,000 in longhand.
This Substitution Cracking Tool from Simon Singh, and its frequency analysis, will help you bring such a large number down to size.
Ciphertext 1
CJZTB OIXTT LJQJKRX XTCHKRX SAKVCABL MJOI LJYTL TUHRK OA OIALT AG R XJCIO RBCKTY OXJRBCKT OITB OIT RXTR AG OIT KRXCTLO SAKVCAB JL TUHRK OA OIT LHQ AG OIT RXTRL AG OIT OMA LQRKKTX ABTL
10 Jun 2013
7 Jun 2013
Prize Maths Quiz: A Large Cross of Numbers (PMQ22)
This is an extended version of previous Cross-Number Puzzles published here and here.
This time, the aim is to insert sixteen distinct 3-digit numbers into the grid such that every number is either a perfect square or cube.
Every number must be greater than 99, so there are no leading zeros. Numbers are read either left-to-right or top-to-bottom. The larger outer cross requires twelve numbers and the inner cross has space for four numbers; the circle in the centre will have a digit that is the first digit of two numbers and the last digit of two other numbers.
I have found one solution, but there may be more.
When submitting your answers, just write out a chain of numbers going clockwise round the outer cross, for example, starting at the top, 441 – 125 – 529 – 961 – 361... and so on. Then write the four numbers in the centre cross.
Have fun!
19 Apr 2013
Prize Maths Quiz: Sylver Coinage {9} Game (PMQ15)
![]() |
| J.J. Sylvester |
Alice had been teaching her friend Charlotte how to play the Sylver Coinage Game. Just then, Bill walks in, fiddling with what looked like a broken Rubik’s Cube.
“Don’t ask! I just wanted to see how it works.”
“And, no doubt, to solve it using your unique brand of brute force!” Alice smirked.
Bill couldn't think of a witty reply, so pretended to ignore the quip.
“Bill, Charlotte wishes to beat you at the Sylver game.” The girls giggled.
“Oh no! All those numbers make my head buzz.”
“So you accept defeat?”
“Did I say that? No way!” Bill looked at Charlotte, who seemed to be entranced in a Sylver daze. “Come on then, let’s play your little game.”
After everyone was sitting comfortably, Charlotte had first pick in the first game. Charlotte picks the number 9. Alice sinks her head in her hands.
“We hadn't played that opening, Alice, had we?” beamed Charlotte, as if she’d invented a new colour or something.
“There was a reason for that!” But then Alice noticed that Bill looked deep in thought. He’s... not... sure! Bill seemed to be stuck in thought.
18 Apr 2013
The Sylver Coinage Game: Upper Secondary Mathematics
This is more a project than a single question. There is, however, a question at the end; and it will help you with tomorrow’s PMQ.
John Conway invented a number of mathematical games including one that has come to be called the Sylver Coinage game. I usually try to obfuscate the standard names of various theorems so that users actually try to solve the problems rather than searching for the answer. In this case, the game remains interesting even after reading the literature.
The game is played by two players; let’s call them Alice and Bill. The game starts with the set of all positive whole numbers. Alice picks the first number – this removes from the game all multiples of this number. Bill then picks a number – this removes from the game all linear combinations of the two numbers in play. The game continues in this fashion until one player is left having to pick the 1 – that player is the loser.
John Conway invented a number of mathematical games including one that has come to be called the Sylver Coinage game. I usually try to obfuscate the standard names of various theorems so that users actually try to solve the problems rather than searching for the answer. In this case, the game remains interesting even after reading the literature.
The game is played by two players; let’s call them Alice and Bill. The game starts with the set of all positive whole numbers. Alice picks the first number – this removes from the game all multiples of this number. Bill then picks a number – this removes from the game all linear combinations of the two numbers in play. The game continues in this fashion until one player is left having to pick the 1 – that player is the loser.
Subscribe to:
Posts (Atom)





