Skip to content

Commit

Permalink
Refactor
Browse files Browse the repository at this point in the history 
Signed-off-by: Omar Gamil Salem <nicromonicon@hotmail.com>
  • Loading branch information
@Omar-Salem
Omar-Salem committed Dec 1, 2012
1 parent cf0c143 commit 7b0f423
Show file tree
Hide file tree
Showing 29 changed files with 878 additions and 483 deletions.
Binary file modified ClassicalEncryptionTechniques.sln.docstates.suo
View file
Binary file not shown.
Binary file modified ClassicalEncryptionTechniques.suo
View file
Binary file not shown.
2 changes: 0 additions & 2 deletions EncryptionAlgorithms/Cocnrete/Monoalphabetic.cs
View file
Expand Up @@ -3,8 +3,6 @@
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.ComponentModel.Composition;

public class Monoalphabetic : SecurityAlgorithm
{
Expand Down
127 changes: 63 additions & 64 deletions EncryptionAlgorithms/Cocnrete/PlayFair.cs
View file
Expand Up @@ -7,6 +7,7 @@
public class PlayFair : SecurityAlgorithm
{
string key;

public PlayFair(string key)
{
this.key = key;
Expand All @@ -30,8 +31,6 @@ public override string Decrypt(string cipherText)

private string Process(string message, Mode mode)
{
List<char> lstKey = new List<char>();

//Key:Charcater
//Value:Position
Dictionary<char, string> characterPositionsInMatrix = new Dictionary<char, string>();
Expand All @@ -40,144 +39,144 @@ private string Process(string message, Mode mode)
//Value:Charcater
Dictionary<string, char> positionCharacterInMatrix = new Dictionary<string, char>();

FillMatrix(key.Distinct().ToArray(), characterPositionsInMatrix, positionCharacterInMatrix);

foreach (char c in key.ToLower().Trim())//get key..remove duplicates
{
if (!lstKey.Contains(c) && c != ' ')
{
lstKey.Add(c);
}
}
FillMatrix(lstKey, ref characterPositionsInMatrix, ref positionCharacterInMatrix);
if (mode == Mode.Encrypt)
{
message = RepairWord(message);
}
////////////////////////////////////////////////
string strReturn = "";

string result = "";

for (int i = 0; i < message.Length; i += 2)
{
string substring_of_2 = message.Substring(i, 2);//get characters from text by pairs
//get Row & Column of each character
string strR_C_1 = characterPositionsInMatrix[substring_of_2[0]];
string strR_C_2 = characterPositionsInMatrix[substring_of_2[1]];
string rc1 = characterPositionsInMatrix[substring_of_2[0]];
string rc2 = characterPositionsInMatrix[substring_of_2[1]];

if (strR_C_1[0] == strR_C_2[0])//Same Row, different Column
if (rc1[0] == rc2[0])//Same Row, different Column
{
int nNew_C1 = 0, nNew_C2 = 0;
int newC1 = 0, newC2 = 0;

switch (mode)
{
case Mode.Encrypt://Increment Columns
nNew_C1 = (int.Parse(strR_C_1[1].ToString()) + 1) % 5;
nNew_C2 = (int.Parse(strR_C_2[1].ToString()) + 1) % 5;
newC1 = (int.Parse(rc1[1].ToString()) + 1) % 5;
newC2 = (int.Parse(rc2[1].ToString()) + 1) % 5;
break;
case Mode.Decrypt://Decrement Columns
nNew_C1 = (int.Parse(strR_C_1[1].ToString()) - 1) % 5;
nNew_C2 = (int.Parse(strR_C_2[1].ToString()) - 1) % 5;
newC1 = (int.Parse(rc1[1].ToString()) - 1) % 5;
newC2 = (int.Parse(rc2[1].ToString()) - 1) % 5;
break;
}

nNew_C1 = RepairNegative(nNew_C1);
nNew_C2 = RepairNegative(nNew_C2);
strReturn += positionCharacterInMatrix[strR_C_1[0].ToString() + nNew_C1.ToString()];
strReturn += positionCharacterInMatrix[strR_C_2[0].ToString() + nNew_C2.ToString()];
newC1 = RepairNegative(newC1);
newC2 = RepairNegative(newC2);

result += positionCharacterInMatrix[rc1[0].ToString() + newC1.ToString()];
result += positionCharacterInMatrix[rc2[0].ToString() + newC2.ToString()];
}

else if (strR_C_1[1] == strR_C_2[1])//Same Column, different Row
else if (rc1[1] == rc2[1])//Same Column, different Row
{
int nNew_R1 = 0, nNew_R2 = 0;
int newR1 = 0, newR2 = 0;

switch (mode)
{
case Mode.Encrypt://Increment Rows
nNew_R1 = (int.Parse(strR_C_1[0].ToString()) + 1) % 5;
nNew_R2 = (int.Parse(strR_C_2[0].ToString()) + 1) % 5;
newR1 = (int.Parse(rc1[0].ToString()) + 1) % 5;
newR2 = (int.Parse(rc2[0].ToString()) + 1) % 5;
break;
case Mode.Decrypt://Decrement Rows
nNew_R1 = (int.Parse(strR_C_1[0].ToString()) - 1) % 5;
nNew_R2 = (int.Parse(strR_C_2[0].ToString()) - 1) % 5;
newR1 = (int.Parse(rc1[0].ToString()) - 1) % 5;
newR2 = (int.Parse(rc2[0].ToString()) - 1) % 5;
break;
}
nNew_R1 = RepairNegative(nNew_R1);
nNew_R2 = RepairNegative(nNew_R2);
strReturn += positionCharacterInMatrix[nNew_R1.ToString() + strR_C_1[1].ToString()];
strReturn += positionCharacterInMatrix[nNew_R2.ToString() + strR_C_2[1].ToString()];
newR1 = RepairNegative(newR1);
newR2 = RepairNegative(newR2);

result += positionCharacterInMatrix[newR1.ToString() + rc1[1].ToString()];
result += positionCharacterInMatrix[newR2.ToString() + rc2[1].ToString()];
}

else//different Row & Column
{
//1st character:row of 1st + col of 2nd
//2nd character:row of 2nd + col of 1st
strReturn += positionCharacterInMatrix[strR_C_1[0].ToString() + strR_C_2[1].ToString()];
strReturn += positionCharacterInMatrix[strR_C_2[0].ToString() + strR_C_1[1].ToString()];
result += positionCharacterInMatrix[rc1[0].ToString() + rc2[1].ToString()];
result += positionCharacterInMatrix[rc2[0].ToString() + rc1[1].ToString()];
}
}
return strReturn;

return result;
}

private string RepairWord(string message)
{
string strTrimmed = message.Replace(" ", "");
string strReturn = "";
for (int i = 0; i < strTrimmed.Length; i++)
string trimmed = message.Replace(" ", "");
string result = "";

for (int i = 0; i < trimmed.Length; i++)
{
strReturn += strTrimmed[i];
if (i < strTrimmed.Length - 1 && message[i] == message[i + 1]) //check if two consecutive letters are the same
result += trimmed[i];

if (i < trimmed.Length - 1 && message[i] == message[i + 1]) //check if two consecutive letters are the same
{
strReturn += 'x';
result += 'x';
}
}

if (strReturn.Length % 2 != 0)//check if length is even
if (result.Length % 2 != 0)//check if length is even
{
strReturn += 'x';
result += 'x';
}

return strReturn;
return result;
}

private void FillMatrix(List<char> lstKey, ref Dictionary<char, string> dicCharacter_positions_in_Matrix, ref Dictionary<string, char> dicPosition_Character_in_Matrix)
private void FillMatrix(IList<char> key, Dictionary<char, string> characterPositionsInMatrix, Dictionary<string, char> positionCharacterInMatrix)
{
char[,] arrMatrix_PF = new char[5, 5];
int nKeyPosition = 0, nchar_position = 0;
List<char> lstAlphabet_PF = alphabet.Keys.ToList();
lstAlphabet_PF.Remove('j');
char[,] matrix = new char[5, 5];
int keyPosition = 0, charPosition = 0;
List<char> alphabetPF = alphabet.Keys.ToList();
alphabetPF.Remove('j');

for (int i = 0; i < 5; i++)
{
for (int j = 0; j < 5; j++)
{
if (nchar_position < lstKey.Count)
if (charPosition < key.Count)
{
arrMatrix_PF[i, j] = lstKey[nchar_position];//fill matrix with key
lstAlphabet_PF.Remove(lstKey[nchar_position]);
nchar_position++;
matrix[i, j] = key[charPosition];//fill matrix with key
alphabetPF.Remove(key[charPosition]);
charPosition++;
}

else//key finished...fill with rest of alphabet
{
arrMatrix_PF[i, j] = lstAlphabet_PF[nKeyPosition];
nKeyPosition++;
matrix[i, j] = alphabetPF[keyPosition];
keyPosition++;
}

string strPosition = i.ToString() + j.ToString();
string position = i.ToString() + j.ToString();
//store character positions in dictionary to avoid searching everytime
dicCharacter_positions_in_Matrix.Add(arrMatrix_PF[i, j], strPosition);
dicPosition_Character_in_Matrix.Add(strPosition, arrMatrix_PF[i, j]);
characterPositionsInMatrix.Add(matrix[i, j], position);
positionCharacterInMatrix.Add(position, matrix[i, j]);
}
}
}

private int RepairNegative(int nNumber)
private int RepairNegative(int number)
{
if (nNumber < 0)
if (number < 0)
{
nNumber += 5;
number += 5;
}

return nNumber;
return number;
}

#endregion
}
}
32 changes: 17 additions & 15 deletions EncryptionAlgorithms/Cocnrete/RailFence.cs
View file
Expand Up @@ -32,52 +32,54 @@ private string Process(string message, Mode mode)
{
int rows = key;
int columns = (int)Math.Ceiling((double)message.Length / (double)rows);
char[,] result = FillArray(message, rows, columns, mode);
string strReturn = "";
char[,] matrix = FillArray(message, rows, columns, mode);
string result = "";

foreach (char c in result)
foreach (char c in matrix)
{
strReturn += c;
result += c;
}

return strReturn;
return result;
}

private char[,] FillArray(string message, int nRows, int nColumns, Mode mode)
private char[,] FillArray(string message, int rowsCount, int columnsCount, Mode mode)
{
int charPosition = 0;
int length = 0, width = 0;
char[,] arrReturn = new char[nRows, nColumns];
char[,] matrix = new char[rowsCount, columnsCount];

switch (mode)
{
case Mode.Encrypt:
length = nRows;
width = nColumns;
length = rowsCount;
width = columnsCount;
break;
case Mode.Decrypt:
arrReturn = new char[nColumns, nRows];
width = nRows;
length = nColumns;
matrix = new char[columnsCount, rowsCount];
width = rowsCount;
length = columnsCount;
break;
}

for (int i = 0; i < width; i++)
{
for (int j = 0; j < length; j++)
{
if (charPosition < message.Length)
{
arrReturn[j, i] = message[charPosition];
matrix[j, i] = message[charPosition];
}
else
{
arrReturn[j, i] = '*';
matrix[j, i] = '*';
}

charPosition++;
}
}

return arrReturn;
return matrix;
}

#endregion
Expand Down
3 changes: 0 additions & 3 deletions EncryptionAlgorithms/Cocnrete/RowTransposition.cs
View file
Expand Up @@ -2,9 +2,6 @@
{
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.ComponentModel.Composition;

public class RowTransposition : SecurityAlgorithm
{
Expand Down
Binary file modified EncryptionAlgorithms/bin/Debug/EncryptionAlgorithms.dll
View file
Binary file not shown.
Binary file modified EncryptionAlgorithms/bin/Debug/EncryptionAlgorithms.pdb
View file
Binary file not shown.
Binary file modified EncryptionAlgorithms/obj/Debug/EncryptionAlgorithms.dll
View file
Binary file not shown.
Binary file modified EncryptionAlgorithms/obj/Debug/EncryptionAlgorithms.pdb
View file
Binary file not shown.

0 comments on commit 7b0f423

Please sign in to comment.