"
Team:Davidson-Missouri Western/Color Plots
From 2008.igem.org
This code hashes all messages with the split model to a single character in the output. The user must input a message in string format, a key (one character) in string format, the number of characters in user's alphabet, and the decimal value (ascii) of the starting character of the alphabet.
This code hashes all messages with the spoke model to any fixed amount of characters in the output. The user must input a message in string format, a key (one character) in string format, the number of characters in the user's alphabet, and the number of characters desired in the output. This code assumes that the decimal value of the starting character of the alphabet is 0.
This code makes a color plot with all possible messages (of indicated length) and keys sorted by the outputs each message/key combination hashes to. The user must input the length of messages to be plotted, the character the alphabet starts with, the character the alphabet ends with, and the hashing method desired.
This code makes color plots for each hash output. Each color plot includes all messages (of indicated length) and keys that hash to that hash output. The user must input the length of messages to be plotted, the character the alphabet starts with, the character the alphabet ends with, and the hashing method desired.
