I'm Korean so English skill is very low.
I don't know encrpytion method (LIKE SHA, MD5 anything else..)
only know that this data is used one-way encryption.
I have 15,000 amounts of real data
and have 60,000 amounts of encrypted data
(15,000 real data is matched with 15,000 encrypted data)
1) real data is only numbers (length is 8 )
2) encrypted data length is 80
Is it possible to decrypt one-way encryption?
=========Here is Sample matched data============
32700130 (real data)
JDQ4MTYyMiM1MSMkMSMkNCMkOTIkMzgxMzUxIzExIyQxIyQzIyQ4OSQyNjE4MzIjNDEjJDEjJDQjJDgz
11100079
JDQ4MTg4MSM1MSMkMSMkMCMkODkkMzgxMzUxIzExIyQxIyQzIyQ3OSQzNjE4MzIjODEjJDEjJDYjJDgz
11100443
JDQ4MTg4MSM1MSMkMSMkMCMkODkkMzgxMzUxIzExIyQxIyQzIyQ2MiQzNjE0ODEjNTEjJDEjJDYjJDgz
11100494
JDQ4MTg4MSM1MSMkMSMkMCMkODkkMzgxMzUxIzExIyQxIyQzIyQ2MiQ0NjEwMDIjNjEjJDEjJDAjJDgz
35100010
JDQ4MTYyMiM2MSMkMSMkNiMkODkkMzgxMzUxIzExIyQxIyQzIyQ3OSQyNjEwMDIjNDEjJDEjJDQjJDgz
31100864
JDQ4MTYyMiM1MSMkMSMkMCMkODkkMzgxMzUxIzExIyQxIyQzIyQxMyQyNjE4MzIjNzEjJDEjJDgjJDgz
Although hashing is not intended for use in any way like lossy compression, it does compress, and it is very lossy. There is not only no known way to reverse a good hash. There is no theoretically possible way either.
Consider the entire set of numbers 10,000 digits long. There are 10^10000 possibilities. All of them can be hashed into a 512 bit hash. But a 512 bit hash has 2^512, or roughly 10^100, possibilities. So each of those 10^100 possible hashes in the SHA512 algorithm would contain 10^100 collisions if you could hash every 10,000 digit number.
Yes, that is a whole lot of collisions. Hash algorithms are collision resistant, but it is impossible to make one collision proof. Don't bet you'll live long enough to see a single such collision because you probably won't. But if you could hash every 10,000 digit number you would find lots of them.
Then the question comes. If you have just the hash, which of those 10^100 different plain texts did it come from? That information is not contained in the hash itself. There is no way to go from a hash to the plain text that resulted in it. In fact the way hash functions are built, you cannot even examine any hash or set of hashes and say with confidence the setting of a single bit of the original bytes. If you could, we would say that hash is broken and nobody would use it any more.
Collected from the Internet
Please contact [email protected] to delete if infringement.
Comments