Team:Davidson-Missouri Western/Tables of Outputs

From 2008.igem.org

(Difference between revisions)
Line 23: Line 23:
[[Media:Splitmodel.m|Split Model For 128 Character Alphabet]]
[[Media:Splitmodel.m|Split Model For 128 Character 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.
+
 
[[Media:Spokemodel.m|Spokemodel]]
[[Media:Spokemodel.m|Spokemodel]]
[[Media:Spoketest.m|Spoketest]]
[[Media:Spoketest.m|Spoketest]]

Revision as of 21:01, 29 October 2008

Table Generators

Testhash

for split and spoke model, makes table of what both models get as hash %value for each message combination and key of indicated alphabet and %message length function test = Testhash(X,Y,L) %L=length of message, X is smallest ascii character in alphabet,Y is largest ascii character in alphabet

Testhash128

%for split and spoke model, makes table of what both models get as hash %value for each message combination and key of full ascii alphabet and %indicated message length function test = Testhash128(X,Y,L) %L=length of message, X,Y ascii

Onekey


The Models

Split Model For 128 Character Alphabet


Spokemodel

Spoketest