The most secure form of cryptography, indeed, the only provably secure form is the One Time Pad.
Pedantically the one time pad is not a single algorithm, but in general it is applying pre-agreed randomness to each letter.
The fundamental problem with the One Time Pad is the Key Distribution Problem, how do two people on [...]
Tag Archives: Classical Cryptography
Numbers Stations
Paper based Enigma Machine
A nice little paper project for people who want a visual representation of Enigma.
Poker By Phone
Is it possible to play poker by post or email?
Yes, if we assume that there is a trusted ‘know all’ dealer who tells each player their cards. However, is it popssible without such a trusted person.
Let’s summarise the problem. First we must shuffle the cards. Then the cards must be dealt, and no player must [...]
The solution to the worked example
Over the past few days we have been looking at how we might solve:
VKMHG QFVMO IJOII OHNSN IZXSS CSZEA WWEXU
LIOZB AGEKQ UHRDH IKHWE OBNSQ RVIES LISYK
BIOVF IEWEO BQXIE UUIXK EKTUH NSZIB SWJIZ
BSKFK YWSXS EIDSQ INTBD RKOZD QELUM AAAEV
MIDMD GKJXR UKTUH TSBGI EQRVF XBAYG UBTCS
XTBDR SLYKW AFHMM TYCKU JHBWV TUHRQ XYHWM
IJBXS LSXUB BAYDI OFLPO XBULU OZAHE [...]
Known Plaintext Attack - Worked Example
Over the past few days we’ve been working on this puzzle:
VKMHG QFVMO IJOII OHNSN IZXSS CSZEA WWEXU
LIOZB AGEKQ UHRDH IKHWE OBNSQ RVIES LISYK
BIOVF IEWEO BQXIE UUIXK EKTUH NSZIB SWJIZ
BSKFK YWSXS EIDSQ INTBD RKOZD QELUM AAAEV
MIDMD GKJXR UKTUH TSBGI EQRVF XBAYG UBTCS
XTBDR SLYKW AFHMM TYCKU JHBWV TUHRQ XYHWM
IJBXS LSXUB BAYDI OFLPO XBULU OZAHE JOBDT
ATOUT GLPKO FHNSO [...]