Team:Davidson-Missouri Western/Tables of Outputs

From 2008.igem.org

(Difference between revisions)
 
(11 intermediate revisions not shown)
Line 1: Line 1:
-
[[Media:Onekey.m|Onekey]]
+
'''Table Generators'''
-
[[Media:Testhash.m|Testhash]]
+
[[Media:Testhash.m|Table of Hash Outputs for Any Alphabet]]
-
for split and spoke model, makes table of what both models get as hash
+
This code generates a table of hash outputs generated by both the split and spoke models for each message (of indicated length) and key combinations (from indicated alphabet). The user must input the starting character of the alphabet, the ending character of the alphabet, and the length of the message.
-
%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
+
-
[[Media:Testhash128.m|Testhash128]]
+
[[Media:Testhash128.m|Table of Hash Outputs for Fixed 128 Character Alphabet]]
-
[[Media:Splitmodel.m|Splitmodel]]
+
This code generates a table of hash outputs generated by both the split and spoke models for each message (of indicated length) and key combinations (from full 128 character ascii alphabet). The user must input the starting character of the alphabet, the ending character of the alphabet, and the length of the message.
 +
 +
----
-
[[Media:Spokemodel.m|Spokemodel]]
+
'''The Models'''
-
[[Media:Spoketest.m|Spoketest]]
+
[[Media:Splitmodel.m|Split Model]]
 +
 
 +
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 and a key (one character) in string format.
 +
 
 +
[[Media:Spoketest.m|Spoke Model]]
 +
 
 +
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.

Latest revision as of 21:12, 29 October 2008

Table Generators

Table of Hash Outputs for Any Alphabet

This code generates a table of hash outputs generated by both the split and spoke models for each message (of indicated length) and key combinations (from indicated alphabet). The user must input the starting character of the alphabet, the ending character of the alphabet, and the length of the message.

Table of Hash Outputs for Fixed 128 Character Alphabet

This code generates a table of hash outputs generated by both the split and spoke models for each message (of indicated length) and key combinations (from full 128 character ascii alphabet). The user must input the starting character of the alphabet, the ending character of the alphabet, and the length of the message.

The Models

Split Model

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 and a key (one character) in string format.

Spoke Model

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.

Retrieved from "http://2008.igem.org/Team:Davidson-Missouri_Western/Tables_of_Outputs"