Problem 1499. Kryptos - CIA Cypher Sculpture: Vigenere Encryption
The Kryptos Sculpture contains four encypted messages.
This Challenge is to Encrypt two of the original messages for the sculptor.
The method employed is Vigenere Encryption. One clarification is that "?" are removed from the coding sequence and then re-inserted in the final encoded message.
Original phrase: Between subtle shading and the absence of light lies the nuance of iqlusion.
For coding purposes spaces and punctuation are removed, except "?".
Phrase to encode: BETWEENSUBTLESHADINGANDTHEABSENCEOFLIGHTLIESTHENUANCEOFIQLUSION
Input: Encode Phrase, Vigenere alphabet word, Vigenere shift word
Vigenere alphabet word ='KRYPTOS';
Vigenere shift word ='PALIMPSEST';
Output: EMUFPHZLRFAXYUSDJKZLDKRNSHGNFIVJYQTQUXQBQVYUVLLTREVJYQTMKYRDMFD
The encryption matrix for this case:
KRYPTOSABCDEFGHIJLMNQUVWXZ
PTOSABCDEFGHIJLMNQUVWXZKRY ABCDEFGHIJLMNQUVWXZKRYPTOS LMNQUVWXZKRYPTOSABCDEFGHIJ IJLMNQUVWXZKRYPTOSABCDEFGH MNQUVWXZKRYPTOSABCDEFGHIJL PTOSABCDEFGHIJLMNQUVWXZKRY SABCDEFGHIJLMNQUVWXZKRYPTO EFGHIJLMNQUVWXZKRYPTOSABCD SABCDEFGHIJLMNQUVWXZKRYPTO TOSABCDEFGHIJLMNQUVWXZKRYP
Follow Up Challenges:
2) Dictionary search
3) KRYPTOS Part IV
Solution Stats
Problem Comments
-
3 Comments
This one was fun.
Very interesting question! Took me a while to figure out this matrix, really enjoy it.
test suite is broken please fix it
Solution Comments
Show commentsGroup

Project Euler II
- 12 Problems
- 51 Finishers
- Sums of cubes and squares of sums
- Sum of big primes without primes
- Project Euler: Problem 11, Largest product in a grid
- Highly divisible triangular number (inspired by Project Euler 12)
- Divisors for big integer
- Large Sum (inspired by Project Euler 13)
- Longest Collatz Sequence
- Project Euler: Problem 16, Sums of Digits of Powers of Two
- Project Euler: Problem 18, Maximum path sum I
- Recurring Cycle Length (Inspired by Project Euler Problem 26)
- Numbers spiral diagonals (Part 1)
- Numbers spiral diagonals (Part 2)
Problem Recent Solvers53
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!