AniNIX/CryptoWorkbench
AniNIX/CryptoWorkbench
3
0
Fork 0
Code Issues 2 Pull Requests Releases Wiki Activity

Adding free-character checking to Analysis module

Browse Source
This commit is contained in:
DarkFeather 2019-05-01 16:38:56 -05:00
parent c1ed369262
commit 9d1280422e
1 changed files with 32 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
Analysis.csharp
View File

@ -39,6 +39,9 @@ namespace AniNIX.Crypto {
case "one-to-one": case "one-to-one":
OneToOneQuery(workSpace,inputText); OneToOneQuery(workSpace,inputText);
break; break;
case "free":
FindFreeCharacters(workSpace,inputText);
break;
case "diff": case "diff":
Diff(line); Diff(line);
break; break;
@ -280,7 +283,9 @@ namespace AniNIX.Crypto {
/// </summary> /// </summary>
/// <param name="workSpace">the workSpace</param> /// <param name="workSpace">the workSpace</param>
/// <param name="inputText">the user input</param> /// <param name="inputText">the user input</param>
public bool OneToOneQuery(String workSpace, String inputText) { /// <param name="shouldPrint">Should the program write to stdout</param>
/// <returns>A boolean if the query is one-to-one</returns>
public bool OneToOneQuery(String workSpace, String inputText, bool shouldPrint=true) {
Dictionary<char,char> relation = new Dictionary<char,char>(); Dictionary<char,char> relation = new Dictionary<char,char>();
//Seed the keys so that we print efficiently. //Seed the keys so that we print efficiently.
StringBuilder subKey = new StringBuilder(); StringBuilder subKey = new StringBuilder();
@ -295,7 +300,7 @@ namespace AniNIX.Crypto {
if (relation.ContainsKey(workSpace[i])) { if (relation.ContainsKey(workSpace[i])) {
// if the relation doesn't match up, we found the mismatch and should return false. // if the relation doesn't match up, we found the mismatch and should return false.
if (relation[workSpace[i]] != inputText[i]) { if (relation[workSpace[i]] != inputText[i]) {
Console.Error.WriteLine(String.Format("Character {0} repeated. These are not one-to-one.",workSpace[i])); if (shouldPrint) Console.Error.WriteLine(String.Format("Character {0} repeated. These are not one-to-one.",workSpace[i]));
return false; return false;
} }
// Otherwise add the new relation pairing. // Otherwise add the new relation pairing.
@ -310,12 +315,34 @@ namespace AniNIX.Crypto {
} }
} }
// Print the keys and return true. // Print the keys and return true.
if (shouldPrint) {
subKey.Append("\nInput-to-final key:"); subKey.Append("\nInput-to-final key:");
Console.WriteLine(subKey.ToString()); Console.WriteLine(subKey.ToString());
Console.WriteLine(encKey.ToString()); Console.WriteLine(encKey.ToString());
}
return true; return true;
} }
/// <summary>
/// Find the characters unused by the encryption key.
/// <summary>
/// <param name="workSpace">the workSpace</param>
/// <param name="inputText">the user input</param>
public void FindFreeCharacters(String workSpace, String inputText) {
// Start with a list of all the alphanum characters.
List<char> alphanum = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789".ToCharArray().OfType<char>().ToList();
// Eliminate all of the ones we can.
for (int i = 0; i < workSpace.Length; i++) {
if (alphanum.Contains(workSpace[i])) alphanum.Remove(workSpace[i]);
}
// Print the remaining elements.
Console.WriteLine("Remaining characters to use in keys:");
foreach (char c in alphanum) {
Console.Write(c);
}
Console.WriteLine();
}
/// <summary> /// <summary>
/// Show the numeric difference between two characters -- useful for identifying Caesarian ciphers /// Show the numeric difference between two characters -- useful for identifying Caesarian ciphers
/// </summary> /// </summary>