About This Page
I designed this page for an elementary number theory course I'm taking this year. You can take a look at the source code here.
Euclid GCD Algorithm
This calculates the GCD of two numbers using the Euclidean algorithm. You can read more about it here.
Here's another code if you need one more to crack:
DAZFI SFSPA VQLSN PXYSZ WXALC DAFGQ UISMT PHZGA MKTTF TCCFX KFCRG GLPFE TZMMM ZOZDE ADWVZ WMWKV GQSOH QSVHP WFKLS LEASE PWHMJ EGKPU RVSXJ XVBWV POSDE TEQTX OBZIK WCXLW NUOVJ MJCLL OEOFA ZENVM JILOW ZEKAZ EJAQD ILSWW ESGUG KTZGQ ZVRMN WTQSE OTKTK PBSTA MQVER MJEGL JQRTL GFJYG SPTZP GTACM OECBX SESCI YGUFP KVILL TWDKS ZODFW FWEAA PQTFS TQIRG MPMEL RYELH QSVWB AWMOS DELHM UZGPG YEKZU KWTAM ZJMLS EVJQT GLAWV OVVXH KWQIL IEUYS ZWXAH HUSZO GMUZQ CIMVZ UVWIF JJHPW VXFSE TZEDF
Step 1: Look for Duplicate Phrases
The first step is to look for duplicate phrases in the ciphertext.
Step 2: Find Factors of Distances
The second step is to create a table of all factors of all distances between duplicate phrases in the ciphertext.
|Possible length of key (or factors)|
The more repetitions a factor has (see highlighted numbers above), the more likely the key length is that factor.
Step 3: Use Frequency Analysis
The third step is to use frequency analysis on each monoalphabetic cipher within the vigenere algorithm. If the key length is, for example, 5, then the 1st, 6th, 11th, etc. letter of the ciphertext is encrypted using the same monoalphabetic substitution cipher.
Click on the labels below to toggle visibility and use the sliders to match up peaks and valleys with standard English letter frequency.
(Scroll down if you have 6+ sliders.)
Step 4: Crack the Key!
The letters of the key correspond to the shifts for each monoalphabetic cipher. Based on the shifts you made above, the resulting key is:
Calculate all solutions to modular equations with the form Ax = B (mod M)
|t||x||Solution: x (mod M)|
Number to Base
Convert a number from base 10 to another base.
Binary: Two's Complement & Addition/Subtraction
List of Primes
Use this to generate a list of prime numbers. You can either set a list size, or an "up to" value (i.e. only prime numbers up to that number). Also customize the joiner (defaults to a space) if you would like to change how the numbers are outputted. "\n" for newline.