ps5_encryption.py

# 6.00x Problem Set 5
#
# Part 1 - HAIL CAESAR!

import string
import random

WORDLIST_FILENAME = "words.txt"

# -----------------------------------
# Helper code
# (you don't need to understand this helper code)
def loadWords():
    """
    Returns a list of valid words. Words are strings of lowercase letters.

    Depending on the size of the word list, this function may
    take a while to finish.
    """
    print "Loading word list from file..."
    inFile = open(WORDLIST_FILENAME, 'r')
    wordList = inFile.read().split()
    print "  ", len(wordList), "words loaded."
    return wordList

def isWord(wordList, word):
    """
    Determines if word is a valid word.

    wordList: list of words in the dictionary.
    word: a possible word.
    returns True if word is in wordList.

    Example:
    >>> isWord(wordList, 'bat') returns
    True
    >>> isWord(wordList, 'asdf') returns
    False
    """
    word = word.lower()
    word = word.strip(" !@#$%^&*()-_+={}[]|\\:;'<>?,./\"")
    return word in wordList

def randomWord(wordList):
    """
    Returns a random word.

    wordList: list of words
    returns: a word from wordList at random
    """
    return random.choice(wordList)

def randomString(wordList, n):
    """
    Returns a string containing n random words from wordList

    wordList: list of words
    returns: a string of random words separated by spaces.
    """
    return " ".join([randomWord(wordList) for _ in range(n)])

def randomScrambled(wordList, n):
    """
    Generates a test string by generating an n-word random string
    and encrypting it with a sequence of random shifts.

    wordList: list of words
    n: number of random words to generate and scamble
    returns: a scrambled string of n random words

    NOTE:
    This function will ONLY work once you have completed your
    implementation of applyShifts!
    """
    s = randomString(wordList, n) + " "
    shifts = [(i, random.randint(0, 25)) for i in range(len(s)) if s[i-1] == ' ']
    return applyShifts(s, shifts)[:-1]

def getStoryString():
    """
    Returns a story in encrypted text.
    """
    return open("story.txt", "r").read()


# (end of helper code)
# -----------------------------------


#
# Problem 1: Encryption
#
def buildCoder(shift):
    """
    Returns a dict that can apply a Caesar cipher to a letter.
    The cipher is defined by the shift value. Ignores non-letter characters
    like punctuation, numbers and spaces.

    shift: 0 <= int < 26
    returns: dict
    """

    result = {}

    stringLower = string.ascii_lowercase
    stringUpper = string.ascii_uppercase

    shiftedStringLower = stringLower[shift:] + stringLower[:shift]
    shiftedStringUpper = stringUpper[shift:] + stringUpper[:shift]

    for i in range(len(stringUpper)):
        result[stringUpper[i]] = shiftedStringUpper[i]

    for i in range(len(stringLower)):
        result[stringLower[i]] = shiftedStringLower[i]

    return result


def applyCoder(text, coder):
    """
    Applies the coder to the text. Returns the encoded text.

    text: string
    coder: dict with mappings of characters to shifted characters
    returns: text after mapping coder chars to original text
    """

    encoded = ''
    for letter in text:
        if letter in coder:
            encoded = encoded + coder[letter]
        else:
            encoded = encoded + letter
    return encoded



def applyShift(text, shift):
    """
    Given a text, returns a new text Caesar shifted by the given shift
    offset. Lower case letters should remain lower case, upper case
    letters should remain upper case, and all other punctuation should
    stay as it is.

    text: string to apply the shift to
    shift: amount to shift the text (0 <= int < 26)
    returns: text after being shifted by specified amount.
    """

    coder = buildCoder(shift)
    return applyCoder(text, coder)


#
# Problem 2: Decryption
#
def findBestShift(wordList, text):
    """
    Finds a shift key that can decrypt the encoded text.

    text: string
    returns: 0 <= int < 26
    """
    # Set the maximum number of real words found to 0.
    maxRealWords = 0

    # Set the best shift to 0.
    bestShift = 0

    # For each possible shift from 0 to 26:
    for shift in range(0,26):

	   # Shift the entire text by this shift.
       shiftedText = applyShift(text, shift)

	   # Split the text up into a list of the individual words.
       individualWords = shiftedText.split()

       # Count the number of valid words in this list.
       validWords = 0
       for word in individualWords:
           if isWord(wordList, word):
               validWords = validWords + 1

	   # If this number of valid words is more than the largest number of
	   # real words found, then:
       if validWords > maxRealWords:

           # Record the number of valid words.
           maxRealWords = validWords

		   # Set the best shift to the current shift.
           bestShift = shift

	   # Increment the current possible shift by 1. Repeat the loop
	   # starting at line 3.

    # Return the best shift.
    return bestShift


def decryptStory():
    """
    Using the methods you created in this problem set,
    decrypt the story given by the function getStoryString().
    Use the functions getStoryString and loadWords to get the
    raw data you need.

    returns: string - story in plain text
    """

    wordList = loadWords()
    text = getStoryString()
    shift = findBestShift(wordList, text)
    return applyShift(text, shift)


#
# Build data structures used for entire session and run encryption
#


if __name__ == '__main__':
    wordList = loadWords()
    decryptStory()