Post: C# MD5 + SHA1 Hashing in UTF8 and or UTF32
Options
03-10-2012, 09:39 PM
#1
Pichu
PICHU.
PICHU.
The program has a timer built in that allows for live hashing. I put it together real quick, you have the option to change the hash type with a simple click of a button also allowing for automatic changing of the text box to the right.
Very simple program.
Click on the Source Code and another box will appear with the programs source code for you to Copy and Paste and see how it was done. The source is just me copying and pasting the .cs page above the action of opening up a second form.
Download link here:
You must login or register to view this content.
---
You must login or register to view this content.
Last edited by
Pichu ; 03-10-2012 at 09:43 PM.
The following 2 users say thank you to Pichu for this useful post:
03-14-2012, 10:49 AM
#2
CRACKbomber
What's a CRACKbomber?
Originally posted by Sublimity
I got bored and haven't really seen anyone upload anything related to Hashing so I've decided to make one with MD5 and SHA1 including UTF8 and UTF32.
The program has a timer built in that allows for live hashing. I put it together real quick, you have the option to change the hash type with a simple click of a button also allowing for automatic changing of the text box to the right.
Very simple program.
Click on the Source Code and another box will appear with the programs source code for you to Copy and Paste and see how it was done. The source is just me copying and pasting the .cs page above the action of opening up a second form.
Download link here:
You must login or register to view this content.
---
You must login or register to view this content.
The program has a timer built in that allows for live hashing. I put it together real quick, you have the option to change the hash type with a simple click of a button also allowing for automatic changing of the text box to the right.
Very simple program.
Click on the Source Code and another box will appear with the programs source code for you to Copy and Paste and see how it was done. The source is just me copying and pasting the .cs page above the action of opening up a second form.
Download link here:
You must login or register to view this content.
---
You must login or register to view this content.
Me gusta :megusta:
03-14-2012, 11:46 PM
#3
Pichu
PICHU.
PICHU.
Originally posted by ClutchLikeCrack
Me gusta :megusta:
Lol, you can create a serial system using hashing. It's also great to use MD5 for checking software and seeing if there is a difference between the real one and an external one because if they are different, then the hashing is going to be different.
Very useful.
03-15-2012, 12:23 AM
#4
|C++|
< ^ > < ^ >
Originally posted by Sublimity
I got bored and haven't really seen anyone upload anything related to Hashing so I've decided to make one with MD5 and SHA1 including UTF8 and UTF32.
The program has a timer built in that allows for live hashing. I put it together real quick, you have the option to change the hash type with a simple click of a button also allowing for automatic changing of the text box to the right.
Very simple program.
Click on the Source Code and another box will appear with the programs source code for you to Copy and Paste and see how it was done. The source is just me copying and pasting the .cs page above the action of opening up a second form.
Download link here:
You must login or register to view this content.
---
You must login or register to view this content.
The program has a timer built in that allows for live hashing. I put it together real quick, you have the option to change the hash type with a simple click of a button also allowing for automatic changing of the text box to the right.
Very simple program.
Click on the Source Code and another box will appear with the programs source code for you to Copy and Paste and see how it was done. The source is just me copying and pasting the .cs page above the action of opening up a second form.
Download link here:
You must login or register to view this content.
---
You must login or register to view this content.
what hashing i dont know about any of this.
03-15-2012, 01:55 AM
#5
CRACKbomber
What's a CRACKbomber?
Originally posted by Sublimity
Lol, you can create a serial system using hashing. It's also great to use MD5 for checking software and seeing if there is a difference between the real one and an external one because if they are different, then the hashing is going to be different.
Very useful.
Very useful.
Very well done, nice and clean, to the point. C# is prolly my favorite language, if only it wasn't running the .shitframework
03-15-2012, 03:10 AM
#6
Pichu
PICHU.
PICHU.
Originally posted by ClutchLikeCrack
Very well done, nice and clean, to the point. C# is prolly my favorite language, if only it wasn't running the .shitframework
Yea, I wish it was it wasn't just only .Net, reason why I kinda want to learn C++ since I could then use it for things other than just .Net.
Learning HTML and such now, trying to expand what I know.
---------- Post added at 08:10 PM ---------- Previous post was at 08:05 PM ----------
Originally posted by SLiiTH3R
what hashing i dont know about any of this.
Hashing is essentially the taking of text and numbers and through a system of equations it essentially converts it into a line of text that can't be reversed.
Originally posted by another user
Hashing is the transformation of a string of You must login or register to view this content.s into a usually shorter fixed-length value or key that represents the original string. Hashing is used to index and retrieve items in a You must login or register to view this content. because it is faster to find the item using the shorter hashed key than to find it using the original value. It is also used in many You must login or register to view this content. algorithms.LEARN MORE
As a simple example of the using of hashing in databases, a group of people could be arranged in a database like this:
Abernathy, Sara Epperdingle, Roscoe Moore, Wilfred Smith, David (and many more sorted into alphabetical order)
Each of these names would be the key in the database for that person's data. A database search mechanism would first have to start looking character-by-character across the name for matches until it found the match (or ruled the other entries out). But if each of the names were hashed, it might be possible (depending on the number of names in the database) to generate a unique four-digit key for each name. For example:
7864 Abernathy, Sara 9802 Epperdingle, Roscoe 1990 Moore, Wilfred 8822 Smith, David (and so forth)
A search for any name would first consist of computing the hash value (using the same hash function used to store the item) and then comparing for a match using that value. It would, in general, be much faster to find a match across four digits, each having only 10 possibilities, than across an unpredictable value length where each character had 26 possibilities.
The hashing You must login or register to view this content. is called the hash function-- probably the term is derived from the idea that the resulting hash value can be thought of as a "mixed up" version of the represented value.
In addition to faster data retrieval, hashing is also used to encrypt and decrypt digital signatures (used to authenticate message senders and receivers). The You must login or register to view this content.is transformed with the hash function and then both the hashed value (known as a message-digest) and the signature are sent in separate transmissions to the receiver. Using the same hash function as the sender, the receiver derives a message-digest from the signature and compares it with the message-digest it also received. (They should be the same.)
The hash function is used to index the original value or key and then used later each time the data associated with the value or key is to be retrieved. Thus, hashing is always a one-way operation. There's no need to "reverse engineer" the hash function by analyzing the hashed values. In fact, the ideal hash function can't be derived by such analysis. A good hash function also should not produce the same hash value from two different inputs. If it does, this is known as a collision. A hash function that offers an extremely low risk of collision may be considered acceptable.
Here are some relatively simple hash functions that have been used:
As a simple example of the using of hashing in databases, a group of people could be arranged in a database like this:
Abernathy, Sara Epperdingle, Roscoe Moore, Wilfred Smith, David (and many more sorted into alphabetical order)
Each of these names would be the key in the database for that person's data. A database search mechanism would first have to start looking character-by-character across the name for matches until it found the match (or ruled the other entries out). But if each of the names were hashed, it might be possible (depending on the number of names in the database) to generate a unique four-digit key for each name. For example:
7864 Abernathy, Sara 9802 Epperdingle, Roscoe 1990 Moore, Wilfred 8822 Smith, David (and so forth)
A search for any name would first consist of computing the hash value (using the same hash function used to store the item) and then comparing for a match using that value. It would, in general, be much faster to find a match across four digits, each having only 10 possibilities, than across an unpredictable value length where each character had 26 possibilities.
The hashing You must login or register to view this content. is called the hash function-- probably the term is derived from the idea that the resulting hash value can be thought of as a "mixed up" version of the represented value.
In addition to faster data retrieval, hashing is also used to encrypt and decrypt digital signatures (used to authenticate message senders and receivers). The You must login or register to view this content.is transformed with the hash function and then both the hashed value (known as a message-digest) and the signature are sent in separate transmissions to the receiver. Using the same hash function as the sender, the receiver derives a message-digest from the signature and compares it with the message-digest it also received. (They should be the same.)
The hash function is used to index the original value or key and then used later each time the data associated with the value or key is to be retrieved. Thus, hashing is always a one-way operation. There's no need to "reverse engineer" the hash function by analyzing the hashed values. In fact, the ideal hash function can't be derived by such analysis. A good hash function also should not produce the same hash value from two different inputs. If it does, this is known as a collision. A hash function that offers an extremely low risk of collision may be considered acceptable.
Here are some relatively simple hash functions that have been used:
- Division-remainder method: The size of the number of items in the table is estimated. That number is then used as a divisor into each original value or key to extract a quotient and a remainder. The remainder is the hashed value. (Since this method is liable to produce a number of collisions, any search mechanism would have to be able to recognize a collision and offer an alternate search mechanism.)
- Folding method: This method divides the original value (digits in this case) into several parts, adds the parts together, and then uses the last four digits (or some other arbitrary number of digits that will work ) as the hashed value or key.
- Radix transformation method: Where the value or key is digital, the number base (or radix) can be changed resulting in a different sequence of digits. (For example, a decimal numbered key could be transformed into a hexadecimal numbered key.) High-order digits could be discarded to fit a hash value of uniform length.
- Digit rearrangement method: This is simply taking part of the original value or key such as digits in positions 3 through 6, reversing their order, and then using that sequence of digits as the hash value or key.
The following user thanked Pichu for this useful post:
03-15-2012, 09:15 PM
#7
|C++|
< ^ > < ^ >
Originally posted by Sublimity
Yea, I wish it was it wasn't just only .Net, reason why I kinda want to learn C++ since I could then use it for things other than just .Net.
Learning HTML and such now, trying to expand what I know.
---------- Post added at 08:10 PM ---------- Previous post was at 08:05 PM ----------
Hashing is essentially the taking of text and numbers and through a system of equations it essentially converts it into a line of text that can't be reversed.
Learning HTML and such now, trying to expand what I know.
---------- Post added at 08:10 PM ---------- Previous post was at 08:05 PM ----------
Hashing is essentially the taking of text and numbers and through a system of equations it essentially converts it into a line of text that can't be reversed.
damn its too bad i dont care about c# and i dont feel like reading all of that. but thanks for the effort
03-15-2012, 11:00 PM
#8
Epic?
Awe-Inspiring
Originally posted by ClutchLikeCrack
Very well done, nice and clean, to the point. C# is prolly my favorite language, if only it wasn't running the .shitframework
You can always use You must login or register to view this content..
Plus, I can't personally think of anything actually wrong with .NET.
03-25-2012, 08:59 AM
#10
Pichu
PICHU.
PICHU.
Originally posted by ShoTz
This was just something simple I put together for everyone. Honestly, everything is already built into .Net Public Sealed Class Files that you can access through
System.Security.Cryptography
Right now, I'm trying to understand how to use AES which would open many doors for me. Trying to figure it out so I can create a proper log in system that stores a XML file somewhere on your computer that's been encrypted.
(Not for public release just for personal knowledge. MSDN has a source to use it but it's all for console so I'm just going to convert that to be used with windows forms.
)
Copyright © 2024, NextGenUpdate.
All Rights Reserved.
