 |
|
 |
hi guys
im curious to see if anyone here can infact decrypt a message encrypted by my app. so here's what we'll do, i added an encrypted string here encrypted with my method. You all know exactly how it works and you have the code to my app. So please, crack this message and reply to this thread with it 
id really like to know how it was done, if u plan to crack it just to rub it in my face then dont even bother.
i wana know how so i can use that info to better my encryption model and to better understand these things
Thanx in advance
______________________________________________________________________________________ Encrypted sting -------------------------------------------------------------------------------------- ९⛷̠࢜ᨀഅäἫۀذ⊘⯴⅐ᘦᯮማ̠␛☯ԡࣜ╻ࢉࠀ෬Ò⍽ᡸܰЪȜᢡ ۀᬫᇁ⍽ઠԮछ⩎ɠৄᯀ๏ä⍽ۀ݀⅐ᑶ⯴Ϡ ᝪᯮۛৠ↉ؘ࢝⪭࢜Ņʀ३@ẍ᠌ؐᾶᚒఠള⛂ۀᵴᇁঢ়⏌⊈Ơछ⣒ɠ૰᥀ಁä⅔ᡂÐ̴སఠฌ⁚ᑶᳲ֠ੁ⇲⚄֣ʠ⬌ঢ়ࠀ൨Ò⍽ᡸ۰⒄ᦆӭĶ᪖ᗰᰯᓫ̠↣↉Ơৃ⚘ܳࠀඉèৠِἒ᜴⮓Ϡ┨ᝪࠠጩঢ়ৠ⋝֖ʠ⬌ੁ᳀Рî≁᠌ۀ ʾϊે⁚ᑶᩨ̠⒆Ơ⚘ߋࠀབྷÞ⌮ᛈـЪȜӭĶ౾ยᢡᒑἫઠεʠ⏿̠ࠗᤀ༕Êৠᖄ۰⒄ۀⓁϠ⋪ᘦᳲᄍফ⅔↉©Òᬗ˥થࠀབྷÂᡸڐ⌼ᖺఠౚ⎎᠌ࠠᄍ̠⍽⋝Իआӓ¾ܡী෬Øৠᡂ݀ἒ᠌♅ϠⓖᡸᳲᄍੁΈ⊈פʠ⛷ࠪᯀРè‘ᕎȀⓖ⦮Ɠ̴බᯮᆔ̠ᚇઠ؋छ⣒˥ࠀೃØ≁ᡂِੀⷙϠ⁚ᦆᦥᐷŅ̖ೳф࢝⠔ࠄ̠ቀРê⇲ᔘِ⒄ᡂ⯴ி⌼ᔘࠠᎃଢৠ∳֣ʠࠄੁᮀ@ЃȜÐ̴སఠ෭⁚ᕎࠠᑤਨἫઠְߵ⩎࢜ࠀಢê⏌ۀ۠⎎ᡸఠฌ⅐ᕎࠠᓫਨ≁⏜ԡđζի̠᳀êỜᦆȀⓖᑶ⟉┨ᡂࠠᄍાỜઠחࠟ⚘࠽ઌᡀາæৠᒬ۰┨ᗰӭĶᝪࠠᎰঢ়⌮⇞ԡࠟ⬌ɠ૰ᬀಁÜৠ۠€⬲ഔⓖʾʊ௴ৠᠽƠ⩎ࢯᴀРÚ╗ۀڀ⁚ᑶ⬲ฌੀᝪᳲ֠ਗ਼␛☯פʠ⡳̠ࣻᭀඉÜỜൊÐ̴ቚ❨ວੀᘦᴳ֠⌮⛙פ࢈ࢉࠀ൨Â⌮ᔘȀ┨ᝪఠౚ↢᜴ᥤ֠ੁ⇲ઠפ࢈⛷ࢉ̠᷀๏ä⅔ᔘϰЪȜ↹ἒᗰବ֠ੁ⇲ઠפ࢈⛷ࢉ̠᷀๏ä⅔ᔘÐ̴ʾϊҹᕶᑶᶵᐷঢ়ৠᠽƠߵ⡳ɠৄᵀഅ@ὺᝪܠੀᑶఠള↢᠌ᢡᅧઌἫё̠ࠗ᷀ಁÒ⏌ᘦ۠ۀ⚦൱⒄ۀᢡ֠∳֖đζիϏᬀ෬@⍽ᡸؐ⒄ᕎఠ෭┨᠌ᢡትਏ‘⚄Ơ࢝⣒࢜ࠀÐἫۀܰ╺᜴ӭĶᓒ᜴ᥤ֠ܡৠ➃֣आ̠࢜ᣀ෬Þ⍽ᕎȀ⋪ᦆఠ⛂ᕎᴳɉúఉᯤՕࣜ⠔ɠܡࠀ༕ÜỜᕎܠⓖᡸⓁ ۀᰯᐊ̠ΈⓛƠࠊ⠔ߋાᤀƭౘ࠺Հ↢ᛈ⣬ϠᝢۀᶵፖৄἫ◚ח⏿ࠪৄࠀ๏äৠᖺ۰ੀᒬ⣬ಷ⌼ᔘ੩ɉúЃ͒εʠ➵ࠪ᷀Рè‘ᑶ݀ੀᡸ❨⒄ᕎ১ᐷ̠ᷯઠְछ⛷ࠪࠀ३N⑪ᕎȀ⋪ᘦ⮓෭⁚ᔘ͍ǂٙৠ☯Ոग़⛷ࠪঢ়ࠀ๏äৠᡂ݀⎎᜴♅ϠᝢۀᩨᄍஆἫ⒆ǻ߱ੁ᳀໓ÊỜʾ ᓒۀ⮓ἒ᠌ࠠᑤਨᷯ⚄Ơआ╻ࣂঢ়ᲀРÎ⌮ᑶذ⁚ᔘఠള⛂ۀḷᐊੁ⍽⚄©Òɠથᩀາä≁᠌Ȁ┨ᗰⓁฌੀᗰᢡᐷાఉ⚄Ơࣱ╻̠࢜ᭀྙ@ὺᘦܰ┨ʾϊ߾╺ᡸࠠೕ̠ẍ‵֖̳⬌ɠਨ᥀෬àৠᖄِ⁚ᛈ⟉ۀ᭬ትੳἫઠε̳⡳ͪѾƭЃȜр╺ᕎఠౚ⎎᠌ࠠᄍ̠↣⋝ߵⒽࠄঢ়̀ŊఉȀ☞ᑶ⟉ฌ↢᜴ᨧ֠৶≁◚Ơߵࢉੁᧀฮ@ౘቚؐ↢ᡸ⟉ۀ᧦ᎃଢৠ‵Ơ९⛷ޥાੀƭᚇ࠺ۀ⊘ۀ⮓ฌἒ᠌ᦥ֠⏌◚ӭ࢝☹ࠀඉÜ⏌ᝪȀ┨ᗰ♅Ϡⓖᯮɉúᐏ⒆ԔʠᬗɠடᯀฮN⏌ۀذ⊘ᝪ⮓ੀẹ֠ঢ়╗↉חʠ໘ӓાᤀРৠᤚ۰⌼࠺⯴Ϡᾶᛈᰯᐷঢ়ৠإʠ╻ࣻঢ়᳀Չ̖ʾ ᗈ♅Ϡ€ᝪᳲ֠ॹৠՕग़⏿ݙઌ᥀ƭᚇ࠺ېੀᤚⓁಷ┨ᘦᯮማ̠ὺⓛʠ⏿ɠᩀേÜЃȜҐ౾ᛈ⣬Ϡⓖᡸᢡᐊঢ়ৠ☯פग़⏿ߋਏᨀ@᜴݀⎎ۀ⯴ಘ⁚ۀᴳᒑાЃ͍͒आ├ɠܡࠀབྷÞ⇲࠺݀ੀᓢ⣬൱ⓖᕎࠠጩৠ↉إࡉ⪭÷ú --------------------------------------------------------------------------------------
have fun
-- modified at 12:56 Thursday 15th November, 2007
Never trust a programmer who carries a screw driver
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
Hello,
Note that if any byte in the key is 00, your algorithm will divide by zero during decryption and the program will crash.
Your key is this: 95 19 25 64 33 02 79 54 16 82 54 97 31 82 54 65 45 25 79 85 13 21
Your plaintext is this (or very close to it):
sit here clutching useless lists And keys for doors that don't exist I crack my teeth on pearls I tear into the history Show me what it means to me in this world Yeah, in this world
'Cause I am due for a miracle I'm waiting for a sign I'll stare straight into the sun And I won't close my eyes 'Till I understand or go blind
I see the parts but not the whole I study saints and scholars both No perfect plan unfurls Do I trust my heart or just my mind? Why is truth so hard to find in this world? Yeah, in this world
'Cause I am due for a miracle ɸI'm waiting for a sign I'll stare straight into the sun And I won't close my eyes 'Till I understand or go blind ('Till I understand or go blind)
I know that there's a point I've missed A shrine or stone I haven't kissed A scar that never graced my wrist A mirror that hasn't met my fist But I can't help feeling like I'm...
Due for a miracle ဌ'm waiting for a sign (Waiting for a sign) I'll stare straight into the sun And I won't close my eyes (And ဌ won't close my eyes)
Due for a miracle I'm waiting for a sign I'll stare straight into the sun And I won't close my eyes
I found it by assuming that your key's byte values would be between 01 and 99 and that each character output would be between 32 and 126. For each encrypted character (currentCharNum), I did this:
int j; for (int i = 1; i < 100; i++) { if (currentCharNum % i == 0) { j = currentCharNum / i; if (j > 31 && j < 127) { // i is the possible key byte for the encrypted character and // j is the related plaintext character for that key byte } } }
I did that until the possible key bytes started to repeat. Each character produced between 1 and 8 possible key bytes, not all of which seemed likely. It appeared that you were using a lot of lowercase letters and this helped narrow down the guesses of the key bytes, as did finding words. Finally I moved the first byte to be the last byte in the key, since your algorithm starts with the last byte and wraps back to the first one.
Good luck... Dan
-- modified at 7:38 Friday 16th November, 2007
|
| Sign In·View Thread·PermaLink | 5.00/5 (2 votes) |
|
|
|
 |
|
 |
hey there,
thats awsum! how long did it take you? this is really brilliant!
now lets say you didnt have the code to my program, you just intercepted a message not knowing how or with what it was encrypted, would it stil be as easy? how would you go to w0rk to find the hidden data?
i know about the dividing by 0 bug in the app, and yes i only used key values between 1 and 99 because i hav no check that keeps my char's within the ASCII table so if your ascii values times the key value is higher than 65535 the app crashes. i really am impressed!
the reson why your decrypted text isnt exactly right is because the post put new line characters inbetween my string and that screwd it around a bit.
thanx
Harvey Saayman - South Africa
Never trust a programmer who carries a screw driver
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
It took me under 5 minutes to modify your MainForm.cs file to the following and determine your key. Note that I changed your program to read in the cipher text from a file called "cipher.txt", write the output to a file called "plain.txt", and read the key in from a file called "key.txt". I did that to avoid trashing the input file every time the program is run.
using System; using System.Collections.Generic; using System.Drawing; using System.Windows.Forms; using System.IO; using System.Collections; using System.Threading;
namespace TextFileEncryptor_V2 { public partial class MainForm : Form { const string plainfn = "plain.txt"; const string cipherfn = "cipher.txt"; const string keyfn = "key.txt";
public ArrayList myKey = new ArrayList(); public MainForm() { InitializeComponent(); txbKey.Text = readFile(keyfn); } void BtnCheckClick(object sender, EventArgs e) { textBox1.Text = readFile(plainfn); textBox2.Text = ""; } void BtnEncryptClick(object sender, EventArgs e) { getKey(txbKey.Text); textBox1.Text = readFile(plainfn); textBox2.Text = encrypt(textBox1.Text); } void BtnDecryptClick(object sender, EventArgs e) { getKey(txbKey.Text); textBox1.Text = readFile(cipherfn); textBox2.Text = decrypt(textBox1.Text); } public void getKey(string keyString) { myKey.Clear(); keyString.Trim(); myKey.AddRange(keyString.Split(' ')); int[] key = new int[myKey.Count]; int counter = 0; foreach (string item in myKey) { try { key[counter] = Int32.Parse(item); counter++; } catch (FormatException) { MessageBox.Show("Characters Not Allowed As Key"); textBox1.Text = ""; } catch (Exception E) { MessageBox.Show("Error: \n \n" + E); } } counter = 0; } public string readFile(string fn) { string fileContents = ""; try { FileStream readStream = new FileStream(fn, FileMode.Open, FileAccess.Read); StreamReader readReader = new StreamReader(readStream); fileContents = readReader.ReadToEnd(); readStream.Flush(); readReader.Close(); readStream.Close(); } catch (FileNotFoundException) { MessageBox.Show("File Not Found"); } catch (Exception E) { MessageBox.Show("Error: \n\n" + E); } lblCharCount.Text = fileContents.Length.ToString(); return fileContents; } public string encrypt(string fileContents) { int currentCharNum = 0; int encryptedStringNum = 0; int keyIndex = myKey.Count - 1; string encryptedText = ""; lblCharCount.Text = fileContents.Length.ToString(); progressBar1.Maximum = fileContents.Length; progressBar1.Value = 0;
foreach (char currentChar in fileContents) { try { currentCharNum = currentChar; encryptedStringNum = currentCharNum * Int32.Parse(myKey[keyIndex].ToString()); encryptedText += (char)encryptedStringNum; } catch (OverflowException) { int error = 0; error = encryptedStringNum-65535; MessageBox.Show(currentChar + " [" + currentCharNum +"] * "+ myKey[keyIndex].ToString() +" = "+ encryptedStringNum +"\n"+ error); } progressBar1.Value += 1; keyIndex = (keyIndex == myKey.Count - 1) ? 0 : keyIndex++; } writefile(cipherfn, encryptedText); textBox2.Text=encryptedText; return encryptedText; } public string decrypt(string fileContents) { lblCharCount.Text = fileContents.Length.ToString(); int currentCharNum = 0; int decryptedStringNum = 0; int keyIndex = myKey.Count - 1; progressBar1.Maximum = fileContents.Length; progressBar1.Value = 0;
string decryptedText = ""; foreach (char currentChar in fileContents) { currentCharNum = currentChar; decryptedStringNum = currentCharNum / Int32.Parse(myKey[keyIndex].ToString());
int i,j = 0; for (i = 1; i < 100; i++) { if (currentCharNum % i == 0) { j = currentCharNum / i; if (j > 31 && j < 127) { decryptedText += i.ToString() + " " + (char)j + ", "; } } } decryptedText += "\r\n"; progressBar1.Value += 1; keyIndex = (keyIndex == myKey.Count - 1)? 0 : keyIndex++; }
writefile(plainfn, decryptedText); return decryptedText; }
void writefile(string filename, string text) { try { FileStream writeEncryped = new FileStream(filename, FileMode.Create, FileAccess.Write); StreamWriter writeEncryptedWriter = new StreamWriter(writeEncryped); writeEncryptedWriter.Write(text); writeEncryped.Flush(); writeEncryptedWriter.Close(); writeEncryped.Close(); } catch (Exception E) { MessageBox.Show("Error: \n\n" + E); } } } }
After determining your key, I reran your code to get the actual output. Having your code made this very easy. Without your code I probably wouldn't have spent the time to do it.
Dan
-- modified at 12:52 Saturday 17th November, 2007
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
Regarding your question based on the idea of intercepting a message that was secretly encrypted with this method and how to decipher it...
Your encryption method has these apparent weaknesses:
(1) If I have your source code (or even just the executable - because I could easily disassemble it) that encrypts the data, I can reverse engineer the method that gives me the key that was used to encrypt any ciphertext created with it. This is what I have already shown. This is a major weakness of your algorithm, because if you can't distribute the software without compromising the ciphertext, nobody can use it but you.
(2) If I have your encryption executable but don't want to disassemble it, I can still create my own key to determine how the software works and determine the algorithm that way - or use this info to guess your key. Consider this 80-character string of plaintext and use your key (or any key) and your encryption executable to create the ciphertext:
"AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA"
The 21-character substring repetition in the ciphertext tells me that each character is being substituted for each character in the key. Then encrypt this 21-character string: "BBBBBBBBBBBBBBBBBBBBB"
Then compare the first 21 characters (as numeric values) from each string - this shows the relationship of each key byte to the ciphertext. In your algorithm's case, the relationship becomes obvious when the key bytes used to try this are simple & sequential: "01 02 03 ...". I think this is what some others were trying to tell you in their replies.
(3) If you are sending a secret message using this method to an intended recipient, he/she would have to know your secret key and have the software to decrypt it. How would they get the secret key and software without those things being intercepted in the first place? This risk is unavoidable and if an interceptor gets them, your messages are not private anymore (using the methods explained above). Because of this, using a single key for encryption and decryption isn't the best choice for encrypting transmitted messages.
Good luck... Dan
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
The trouble between good cryptography and bad cryptography is that the output of both look pretty much the same at first glance. Yes, the simple method listed above will obfuscate data and "keep honest people honest". It would be sufficient for data that you didn't want in plain text, but wouldn't have legal/financial obligations if divulged.
We know that if you had a really random one-time pad and select a key that is the same length as the data being encrypted that it's secure. Unfortunately, the method above lacks the entropy required by reusing the same key multiple times in the same message as well as over successive messages.
If I was trying to find the key, I'd simply enter in AAAAAAA as the text to encrypt. Then I'd try BBBBBB and compare the output. Since I know that every letter in the input is the same, the differences in the output are linked directly to the algorithm and key used.
"The Code Book" (http://www.amazon.com/Code-Book-Science-Secrecy-Cryptography/dp/0385495323/ref=pd_bbs_4?ie=UTF8&s=books&qid=1195091724&sr=8-4) is a passable introduction to the history of cryptography and cryptanalysis. It explains the basic premise of frequency analysis in trying to decipher an encrypted message. (Think about the methods used to decipher a basic newspaper cryptogram). It also covers the cryptanalysis of rotating ciphers such as yours above.
"Applied Cryptography" (http://www.amazon.com/Applied-Cryptography-Protocols-Algorithms-Source/dp/0471117099/ref=pd_bbs_sr_1?ie=UTF8&s=books&qid=1195091955&sr=8-1) is pretty much required reading for anyone interested in cryptography. Bruce Schneier is the same one who authored the Blowfish Algorithm which was a contender for the US Govt. AES algorithm (the title now applied to Rijndael algorithm)
|
| Sign In·View Thread·PermaLink | 5.00/5 (3 votes) |
|
|
|
 |
|
 |
well thanx for the post i dont see how that would help you decypher my messages tho.
i invyt you to decypher a piece of text i put up in a thred here. just know that this isnt for implementation in a real world app, its just for myself, im exploring the topic first hand instead of reading it up and not knowing much anyway thanx
Harvey Saayman - South Africa
Never trust a programmer who carries a screw driver
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
Since you asked, output encrypted by this program would be vulnerable to 2 types of cryptanalysis: the known plaintext attack and frequency analysis.
A known plaintext attack would work by taking a plaintext document and the encrypted version and then comparing them. Encrypted / x = plaintext, so it's incredibly easy to find x, your key. Thus with even one tiny document that you carelessly left around in unencrypted form, the attacker found your key for all the other documents.
For an explanation of frequency analysis, look at this wikipedia article: http://en.wikipedia.org/wiki/Frequency_analysis
And for more about cryptanalysis, look at these: http://en.wikipedia.org/wiki/Cryptanalysis http://www.schneier.com/paper-self-study.pdf <- Bruce Schneier is a prestigious cryptographer who has written his own industry-standard algorithms.
|
| Sign In·View Thread·PermaLink | 5.00/5 (1 vote) |
|
|
|
 |
|
 |
I gave you a 5 for trying new things and having to deal with a jack-a** poster. Keep up the C# developing.
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
|
 |
|
 |
Everyone goes through this phase when they think they have a decent encryption algorithm. Variants on ROT13 and XOR don't really count for much with respect to encryption. Please don't use these for anything more important than your little sister's diary. Real encryption algorithms aren't this easy to come up with, but they're robust enough to sustain the pressure of external peer review. Please just use Rijndael, Blowfish, or RC5 for your basic symmetric encryption needs. Start looking at the System.Security.Cryptography namespace.
|
| Sign In·View Thread·PermaLink | 3.53/5 (6 votes) |
|
|
|
 |
|
 |
well thank you for your self cented remark
ive only been a C# programmer for a few months so im pretty new to all this. instead of telling me off on my "Terible idea", why not look a little closer at the concept of what i did.
instead of being a sheep following the rest of the population i tried something NEW --to me anyways-- and i succeeded! im not telling anyone to throw out Rijndael and use my method. i just thaught id share my thinking patern at the time with other ppl and hear what they think about my idea.
i respect your opinion but i think you could have been a lil less cocky and a lil more supportive of a junior programmer exploring the posibilities of C# first hand rather than just studying out of a book and not knowing anything anyway
no hard feelings
Harvey Saayman - South Africa
-- modified at 16:33 Wednesday 14th November, 2007
Never trust a programmer who carries a screw driver
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
Sorry, but it's not self-centered. As you yourself mention, this is not secure. If you're using this to about encryption, great. Unfortunately, I've seen naive programmers use stuff like this to protect passwords and credit card numbers in real-life situations.
You could take a moment to look at how you can actually use built-in algorithms like Rijndael in your code instead of being confused by the 16-byte window (http://www.codeproject.com/dotnet/DotNetCrypto.asp)
Or You could start looking at implementing an algorithm like Blowfish ( http://www.schneier.com/blowfish.html) and use it as a vehicle to improve your C# knowledge and focus your interest in cryptography (What's a nonce? What about Initialization Vectors? Why should I add salt to a hash? What's a Rainbow table? What are the issues surrounding random number generators in software?)
|
| Sign In·View Thread·PermaLink | 3.46/5 (4 votes) |
|
|
|
 |
|
|
 |
|
 |
I agree with the original post.
Every time you write a program and put it in front of a client you are exposing yourself to criticism. If you can't take criticism them you are in the wrong business.
There is no way to sugar coat it; Ciphers like this have been around for centuries and wouldn't pass muster in week one of your first semester at university.
Sorry, that's just how it is.
Gerard
|
| Sign In·View Thread·PermaLink | 3.50/5 (2 votes) |
|
|
|
 |
|
 |
hey there
i put this up here to be critisized, but yall are miising the point. i didnt do this to be used or to put in infront of a client. i did it to see if the idea in my head could be done and to improve my own abilites.
id actually like to know how a "cracker" would go about cracking an intercepted message encrypted my my silly idea. so if anyone could tell me how that would be done id appreciate it!
once again this isnt for implementation in an actual app, its for my own exploration of my craft
Never trust a programmer who carries a screw driver
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
HarveySaayman,
Well firstly given that you have just explained how your cipher works it would simply be a matter decrypting it given that it does not use a key.
That aside, it would be a simple matter of looking at byte reoccurrence over a larger string to look for characters that in the English language have a higher probability of being used (such as the letter T) and then developing a hypothesis on how the string was converted.
I suggest that you do a little reading on the topic rather than getting us to help you with your school assignment.
Gerard
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
All I know about cryptography I learnt from reading 'Cryptonomicon' by Neal Stephenson (http://www.amazon.co.uk/Cryptonomicon-Neal-Stephenson/dp/0099410672). Not quite true but its an excellent start, I would also suggest "The code book" by Simon Singh (http://www.simonsingh.net/The_Code_Book.html)
Keep up the work though.
Alice + Bob
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
your frequency anylisis wont work on this gerard, because all the a's wont be the same encrypted character. and i do make use of a key
Never trust a programmer who carries a screw driver
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
Only your second example uses a key, not the first.
The problem with the 2nd example is that people trying to decrypt your string will try all of the obvious things too.
If you intended your article as an example of the obvious things somebody might try before coming to the realization that somebody has already invented the wheel you have hit the mark.
Don't let us discourage you. I am sure we all look forward to what you do next.
Gerard
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
 |
hey
yeah the first example is quite silly, but if you hav another look at the article its underneath backgroud, i was just explaining what i did to lead up to the 2nd example.
i wont get discouraged, i put it up here to be critisezed so i can better it and infact better my skils. i did all this to try and understand hopw proper encrytion works exactly cuz .Net isnt open source so i cant just go look at rijaendels code.
i actually want someone to break it and tell me how it was done. i put up another thread for that so feel free to crack my code.
have a good one.
Harvey Saayman - South Africa
Never trust a programmer who carries a screw driver
|
| Sign In·View Thread·PermaLink | |
|
|
|
 |
|
|
 |
|
 |
Take it easy "NoSpamYouFreakingMorons", like the kid said, its his first attempt to make an encryption program, and by doing so, hi will probably explorer new and far more safer ways to encrypt, i remember my first try to make an encryption program, what a pile of junk i made back then , but i learned from it, while i was developering it.
Instead you could just have writtin a simple line like: "Hey you might wanna search google / codeproject for blowfish or Rijndael".
But hey thats just me... :->:->:->
I say keep trying HarveySaayman, and always do research before coding...   
|
| Sign In·View Thread·PermaLink | 5.00/5 (3 votes) |
|
|
|
 |
|
|
 |
|
|
 |