Encryption - Socoder

-=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- (c) WidthPadding Industries 1987 0\|52\|0 -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=-
Socoder -> Concept/Design -> Encryption
Thu, 17 Apr 2008, 11:55
HoboBen	Just keeping this simple, for now. I've got this text: aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa --v Right now, encrypting it with the string "abcdefghijk" produces some lovely hexadecimal gibberish, which would be fine if I wasn't going to redistribute the decrypting part. But if I decrypt it with the string "abcdefghijx" (the last letter changed) I get this: aaaaaaaaaa^aaaaaaaaaa^aaaaaaaa --v Which is obviously really bad, as anyone can guess the key one letter at a time! What's a nice way of doing it properly? I've done a Google, but I can't seem to find anything in between rot13 and 100-page acedemic PDFs! (I'm not looking for something secure enough to store your bank details in, but it would be nice if it was good enough that it wouldn't take someone ten minutes to crack! If at all possible too, good enough that even if someone saw the source code it would still stand up (no over-dependence on obsfucation)) -=-=- blog \| work \| code \| more code
Thu, 17 Apr 2008, 12:48
Phoenix	I'm sure Agent Smith knows the most about encryption on this forum. He hasn't been here for five days, but he'll show up eventually, I guess. I know nothing about it though, so I'm of little help. Good luck, though!
Thu, 17 Apr 2008, 12:55
HoboBen	Heh, thanks I downloaded the source code for PuTTY (for the SSH stuff), but all I could find was their hashing (MD5/Sha) algorithms, which I don't think would help in this case. But besides that, it was a bit beyond me anyway! Edit: Googling more - Wow, the internet is full of people who think reversing a base-64 string counts as encryption! I'm going to think twice next time I sign up for a website -=-=- blog \| work \| code \| more code
Thu, 17 Apr 2008, 20:25
Scherererer	What is this being used for? is it password storage or is it encrypting a string that needs to be decrypted? I say this because, a password doesn't have to Actually be stored, just the hash (which can't be reversed without a pretty hardcore lookup rainbow table), whereas something that needs to be decrypted can't be done that way. -=-=- YouTube Twitter Computer Science Series: Logic (pt1) (part 2) (part 3) 2's Complement Mathematics: Basic Differential Calculus
Fri, 18 Apr 2008, 09:42
HoboBen	Yup, I know about password hashing. I'm after a way to encrypt and decrypt the (XML-style) markup used by my GUI. This would be to protect game-related files, e.g. so that you can't edit the shop menu to make the best weapon the cheapest, for example. For a game file, a bit of obsfucation and really-simple encryption would probably suffice, but I also hope that people who may use my GUI could have the ability to protect the source code of their scripts, so I'd have to do a proper job of the encryption. -=-=- blog \| work \| code \| more code
Fri, 18 Apr 2008, 12:07
HoboBen	Speak of the devil! Thank you for those links. Edit: Wow, that second website is full of great stuff on a load of other topics, too. -=-=- blog \| work \| code \| more code
Sun, 20 Apr 2008, 22:57
HoboBen	Well, I'm not doing too bad implementing AES encryption (I've got two of the four operations working, so far) thanks to the second link that Agent Smith posted, but taking a break from that I wanted to implement a MD5 hashing function. There's JavaScript ones, and even BlitzBasic ones, but I've yet to find a good MD5 tutorial that mathematically explains the hashing. I find doing a straight code-to-code port hard if I don't actually understand what it's doing (which is why it's taking so long for me to implement the AES encryption; I'm trying to understand the maths behind each bit, so that I know I've done it right!) So does anyone know of any MD5 tutorials like that? Alternatively, please tell me what << means in JavaScript! -=-=- blog \| work \| code \| more code
Mon, 21 Apr 2008, 02:51
Afr0	Hm, I've been watching 'National Treasure 2', and if you need a crypto system that doesn't require so much maths, is a little less secure, but much easier to use, you could look into the Playfair Cipher. A Java implementation is available here -=-=- Afr0 Games Project Dollhouse on Github - Please fork!
Mon, 21 Apr 2008, 06:14
Afr0	Ooh, cool! I'll convert this to C# later tonight -=-=- Afr0 Games Project Dollhouse on Github - Please fork!
Mon, 21 Apr 2008, 13:28
HoboBen	AFAIK << in JavaScript is just bitwise left shift, same as in C. Cool, thanks. And yep, I'll make sure to test it - after going to all the effort of writing the thing, it would be a shame not to have a proper implementation! -=-=- blog \| work \| code \| more code
Mon, 21 Apr 2008, 13:40
Yo! Wazzup?	lol, I was about to make a quick playfair converter in C -=-=- Hi everyone! I'm new to Blitz and only 10 years old so all things coding is gush to me
Mon, 21 Apr 2008, 17:17
Afr0	Hm, not done yet, but this is what I have so far: using System; using System.Collections.Generic; using System.Text; using System.Text.RegularExpressions; namespace Playfair { public enum PlayfairBoolean { FALSE, TRUE, } public enum PlayfairRetcodes { NO_ERROR, NO_KEYWORD, SHORT_KEYWORD, LONG_KEYWORD, BAD_KEYWORD, } /// <summary> /// A filter which enciphers text using the 'Playfair' transposition cipher. /// /// C# implementation by Afr0, 2008. /// Based on original C implementation by Agent Smith, 2002. /// Copyright Charles Wheatstone, 1854. /// </summary> public class Playfair { //Minimum length of keyword. private static int m_MINKEY = 5; private char[,] m_Matrix = new char[7,7]; /// <summary> /// Function To test for Alphabets. /// </summary> /// <param name="strToCheck"></param> /// <returns>Returns true if all characters of the parameter string are in the alphabet.</returns> private bool IsAlpha(string strToCheck) { Regex objAlphaPattern = new Regex("[^a-zA-Z]"); return !objAlphaPattern.IsMatch(strToCheck); } /// <summary> /// Function to Check for AlphaNumeric. /// </summary> /// <param name="strToCheck"></param> /// <returns></returns> private bool IsAlphaNumeric(string strToCheck) { Regex objAlphaNumericPattern = new Regex("[^a-zA-Z0-9]"); return !objAlphaNumericPattern.IsMatch(strToCheck); } /// <summary> /// Return PlayfairBoolean.TRUE if letter is in matrix. /// </summary> /// <param name="Letter">A letter to check for.</param> /// <returns>PlayfairBoolean.TRUE if letter was found, PlayfairBoolean.FALSE otherwise.</returns> private PlayfairBoolean Found(char Letter) { int r, c; for (r = 1; r < 6; r++) for (c = 1; c < 6; c++) if (m_Matrix[r,c] == Letter) return PlayfairBoolean.TRUE; return PlayfairBoolean.FALSE; } /// <summary> /// Find row and column of letter in matrix. /// </summary> /// <param name="?"></param> void Find(char Letter, out int Row, out int Col) { int r, c; for (r = 1; r < 6; r++) { for (c = 1; c < 6; c++) if (m_Matrix[r, c] == Letter) { Row = r; Col = c; return; } } Row = 0; Col = 0; return; } /// <summary> /// Perform 'Playfair' encipherment of plaintext string. /// </summary> /// <param name="plaintext"></param> /// <param name="ciphertext"></param> void Encipher(char* plaintext, char* ciphertext) { char[] digraph = new char[3]; char p1 = plaintext, p2; char c1 = ciphertext, c2 = c1 + 1; int row1, col1, row2, col2; while (p1) { if (IsAlpha(p1)) { if (p1 == 'J' \|\| p1 == 'j') digraph[1] = 'I'; else { digraph[1] = toupper(p1); digraph[2] = '?'; p2 = p1 + 1; } //Find the next encipherable character while (p2 != '\n') { if (isalpha(p2)) { if (p2 == 'J' \|\| p2 == 'j') digraph[2] = 'I'; else { digraph[2] = toupper(p2); break; } } else //Copy non-letter character c2++ = p2++; } //If the two plaintext letters are identical, insert a dummy letter if (digraph[1] == digraph[2]) { digraph[2] = dummy; --p2; } else if (digraph[2] == '?') { /* If the line contains an odd number of encipherable letters, insert a dummy letter to complete the last digraph. / digraph[2] = dummy; p2 = p1; c2 = c1 + 1; } Find(digraph[1], row1, col1); Find(digraph[2], row2, col2); if (row1 == row2) { / If the two letters are in the same row of the 5x5 matrix they encipher as the letters to the right of them, where column 1 is considered to be to the right of column 5, if necessary. / if (col1 == 5) c1 = matrix[row1][1]; else c1 = matrix[row1][col1 + 1]; if (col2 == 5) c2 = matrix[row2][1]; else c2 = matrix[row2][col2 + 1]; } else if (col1 == col2) { / If the two letters are in the same column of the 5x5 matrix they encipher as the letters below them, where row 1 is considered to be below row 5, if necessary. / if (row1 == 5) c1 = matrix[1][col1]; else c1 = matrix[row1 + 1][col1]; if (row2 == 5) c2 = matrix[1][col2]; else c2 = matrix[row2 + 1][col2]; } else { / If the two letters are at diagonally opposite corners of a rectangle in the 5x5 matrix they encipher to the pair at the other two corners. We adopt the convention that each letter is replaced by the corner letter in the same row as itself. / c1 = matrix[row1][col2]; c2 = matrix[row2][col1]; } // Preserve case of plaintext in ciphertext if (islower(p1)) c1 = tolower(c1); if (isalpha(p2)) { if (islower(p2)) c2 = tolower(c2); } else c2 = tolower(c2); // Bump plaintext and ciphertext indices p1 = ++p2; c1 = ++c2; ++c2; } else { // Non-encipherable character c1++ = p1++; c2 = c1 + 1; } } // Null-terminate ciphertext string *c1 = '\0'; } /// <summary> /// Gets or sets the minimum allowed length of keywords. /// </summary> public static int MinKey { get { return m_MINKEY; } set { m_MINKEY = value; } } } } --v Note to Agent Smith: Damn you for using retarded C comments and 2 spacings. :\ -=-=- Afr0 Games Project Dollhouse on Github - Please fork!
Tue, 22 Apr 2008, 12:23
Afr0	As for the 2-space indentation - yeah, I dunno about that either. It's just a personal taste thing. 3 or more seems too much for me. What, are you dyslexic or something? Some people on this forum don't bother indenting at all - which I find even more vexing. Nope, not dyslectic, more dyscalculectic. Anyways, the only other coders I've seen using 2 space indenting are Delphi and/or Turbo Pascal programmers. In the C-family, tab indentation seems to be used almost exclusively, so I wasn't prepared for it. You're right though, people who don't indent at all shouldn't program at all. Edit: Oh yeah, and I've started converting your enciphering code into 'proper' C# code using strings, and so far it's going quite well. However, I can't understand what you're doing here? *c2 = c1 + 1; --v -=-=- Afr0 Games Project Dollhouse on Github - Please fork!
Tue, 22 Apr 2008, 13:19
Phoenix	The whole line is: register char c1 = ciphertext, c2 = c1 + 1; --v So c2 is a pointer to a char, which is located one step from the memory position of c1 (unless it's unicode). So, if c1 points to "abcdef", c2 would point to "bcdef". At least, that's how I think it is. Feel free to correct me if I'm wrong, Agent Smith.
Tue, 22 Apr 2008, 14:46
mike_g	yes, it sets the c2 pointer because the assignment is at the same time as the declaration. In other circumstances it would assign the memory address of c1+1 to what c2 points to. So far I don't really see a point in using 'register' variables. In my experience it has always been slower than normal variables, even when I'm only requesting one. Plus being a GNU language extension id guess it affects the portability of the code.
Tue, 22 Apr 2008, 15:34
Afr0	Ok, thanks, cool. Here's the newest version. It's already a little easier to understand. What happens during the Deciphering function is that you basically move through the string and change it according to the rules set down by Charles Wheatstone. using System; using System.Collections.Generic; using System.Text; using System.Text.RegularExpressions; namespace Playfair { public enum PlayfairBoolean { FALSE, TRUE, } public enum PlayfairRetcodes { NO_ERROR, NO_KEYWORD, SHORT_KEYWORD, LONG_KEYWORD, BAD_KEYWORD, } /// <summary> /// A filter which enciphers text using the 'Playfair' transposition cipher. /// /// C# implementation by Afr0, 2008. /// Based on original C implementation by Agent Smith, 2002. /// Copyright Charles Wheatstone, 1854. /// </summary> public class Playfair { //Minimum length of keyword. private static int m_MINKEY = 5; private char[,] m_Matrix = new char[7,7]; /// <summary> /// Function To test for Alphabets. /// </summary> /// <param name="strToCheck"></param> /// <returns>Returns true if all characters of the parameter string are in the alphabet.</returns> private bool IsAlpha(string strToCheck) { Regex objAlphaPattern = new Regex("[^a-zA-Z]"); return !objAlphaPattern.IsMatch(strToCheck); } /// <summary> /// Function to Check for AlphaNumeric. /// </summary> /// <param name="strToCheck"></param> /// <returns></returns> private bool IsAlphaNumeric(string strToCheck) { Regex objAlphaNumericPattern = new Regex("[^a-zA-Z0-9]"); return !objAlphaNumericPattern.IsMatch(strToCheck); } /// <summary> /// Return PlayfairBoolean.TRUE if letter is in matrix. /// </summary> /// <param name="Letter">A letter to check for.</param> /// <returns>PlayfairBoolean.TRUE if letter was found, PlayfairBoolean.FALSE otherwise.</returns> private PlayfairBoolean Found(char Letter) { int r, c; for (r = 1; r < 6; r++) for (c = 1; c < 6; c++) if (m_Matrix[r,c] == Letter) return PlayfairBoolean.TRUE; return PlayfairBoolean.FALSE; } /// <summary> /// Find row and column of letter in matrix. /// </summary> /// <param name="?"></param> void Find(char Letter, out int Row, out int Col) { int r, c; for (r = 1; r < 6; r++) { for (c = 1; c < 6; c++) if (m_Matrix[r, c] == Letter) { Row = r; Col = c; return; } } Row = 0; Col = 0; return; } /// <summary> /// Perform 'Playfair' encipherment of plaintext string. /// </summary> /// <param name="plaintext"></param> /// <param name="ciphertext"></param> void Encipher(string plaintext, string ciphertext) { char[] digraph = new char[3]; string p1 = plaintext, p2; string c1 = ciphertext, c2 = c1.PadLeft(c1.Length - 1); int row1, col1, row2, col2; for(int i = 0; i < p1.Length; i++) { if (IsAlpha(p1.Substring(i))) { if (p1.Substring(i).Equals('J') \|\| p1.Substring(i).Equals('j')) digraph[1] = 'I'; else { digraph[1] = p1.Substring(i).ToUpper(); digraph[2] = '?'; p2 = p1 + 1; } //Find the next encipherable character //while (p2 != '\n') for(int x = 0; x < p2.Length; x++) { if (IsAlpha(p2.Substring(x))) { if (p2.Substring(x).Equals('J') \|\| p1.Substring(x).Equals('j')) digraph[2] = 'I'; else { digraph[2] = p2.Substring(x).ToUpper(); break; } } else //Copy non-letter character c2++ = p2++; } //If the two plaintext letters are identical, insert a dummy letter if (digraph[1] == digraph[2]) { digraph[2] = dummy; --p2; } else if (digraph[2] == '?') { / If the line contains an odd number of encipherable letters, insert a dummy letter to complete the last digraph. / digraph[2] = dummy; p2 = p1; c2 = c1 + 1; } Find(digraph[1], out row1, out col1); Find(digraph[2], out row2, out col2); if (row1 == row2) { / If the two letters are in the same row of the 5x5 matrix they encipher as the letters to the right of them, where column 1 is considered to be to the right of column 5, if necessary. / if (col1 == 5) c1 = matrix[row1][1]; else c1 = matrix[row1][col1 + 1]; if (col2 == 5) c2 = matrix[row2][1]; else c2 = matrix[row2][col2 + 1]; } else if (col1 == col2) { / If the two letters are in the same column of the 5x5 matrix they encipher as the letters below them, where row 1 is considered to be below row 5, if necessary. / if (row1 == 5) c1 = matrix[1][col1]; else c1 = matrix[row1 + 1][col1]; if (row2 == 5) c2 = matrix[1][col2]; else c2 = matrix[row2 + 1][col2]; } else { / If the two letters are at diagonally opposite corners of a rectangle in the 5x5 matrix they encipher to the pair at the other two corners. We adopt the convention that each letter is replaced by the corner letter in the same row as itself. / c1 = matrix[row1][col2]; c2 = matrix[row2][col1]; } // Preserve case of plaintext in ciphertext if (islower(p1)) c1 = tolower(c1); if (isalpha(p2)) { if (islower(p2)) c2 = tolower(c2); } else c2 = tolower(c2); // Bump plaintext and ciphertext indices p1 = ++p2; c1 = ++c2; ++c2; } else { // Non-encipherable character c1++ = p1++; c2 = c1 + 1; } } // Null-terminate ciphertext string *c1 = '\0'; } /// <summary> /// Gets or sets the minimum allowed length of keywords. /// </summary> public static int MinKey { get { return m_MINKEY; } set { m_MINKEY = value; } } } } --v -=-=- Afr0 Games Project Dollhouse on Github - Please fork!
Wed, 23 Apr 2008, 00:16
Afr0	Hm, regardless, the C# compiler is being picky and wants to make sure that all possible exceptions are covered. It simply won't compile without those! :o Edit: I think it's because they are out parameters, and will be returned regardless, and so the compiler wants to make sure they're not null. -=-=- Afr0 Games Project Dollhouse on Github - Please fork!
Wed, 23 Apr 2008, 01:28
Phoenix	public enum PlayfairBoolean { FALSE, TRUE, } --v That is also a bit redundant, since C# already has predefined true and false values. Also, pointers should generally not be used in C#, and even though I haven't really looked at the code in detail I cannot imagine that it does something which requires pointers.
Wed, 23 Apr 2008, 06:27
Afr0	Phoenix: The reason I'm still using pointers is because I haven't yet quite managed to figure out what Agent Smith is doing with all those pointer arithmetic operations. Agent Smith: Yes, I'm making it into a reusable class - that's why Found() and Find() are private, for instance. My idea was to have a property named EncipheredString or something, and another one named DecipheredString, that would be accessible from an instance of the class, and return the proper values given Deciper() and Encipher() has been used with the correct password values and such. -=-=- Afr0 Games Project Dollhouse on Github - Please fork!