answersLogoWhite

0


Best Answer

You can't decrypt them, that's why it's called one-way. The only way to get the password is to encrypt guess words with the same algorithm and checking if the result matches the encrypted password. So if your encrypted password is a9d82da, guess what it might be - maybe "frank"? - and encrypt that word, and if you get 29d8afd, you know the password is not "frank", so try another word. If one of them encrypts into a9d82da, then you know that's the password.
Passwords are often guessed this way by using a dictionary - a simple list of words - and automatically encrypting them one by one and comparing the result with the encrypted password. Another approach that takes much longer is to try every possible combination of characters, such as aa, ab, ac, aaa, aab, aac, aba, abb, abc, etc. This can take weeks, months, even years, depending on the algorithm used and the speed of your computer.

User Avatar

Wiki User

14y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: How do you do th decryption of passwords encrypted by one way hashing algorithm?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Engineering

What algorithm can't be reversed?

Hashing can't be reversed.


Which is better encryption algorithm among DES Blowfish and MD5?

MD5 isn't a encryption algorithm, it's a hashing algorithm. Encryption will 'hide' the meaning of the encrypted text, while MD5 will 'add up' all the text to come up with a number. This number can be compared to another time this file was 'added up', to provide a simple kind of check to see if the text has been changed or if it is the same.


What is Hash file organization in DBMS?

Hashing is the most common form of purely random access to a file or database. It is also used to access columns that do not have an index as an optimisation technique. Hash functions calculate the address of the page in which the record is to be stored based on one or more fields in the record. The records in a hash file appear randomly distributed across the available space. It requires some hashing algorithm and the technique. Hashing Algorithm converts a primary key value into a record address. The most popular form of hashing is division hashing with chained overflow.


Difference between Internal hashing n external hashing?

Internal hashing mainly used for internal file, it is particularly an array of records. External hashing used for file disk


What is hashing function in data structure?

If you read up on hashing, why hashing is done, what are its uses. Then you will be able to answer your own question. More to the point you will have studied the material that your homework question is intended to make you study. It is educational.

Related questions

What is Homomorphic Hashing?

Homomorphic Hashing is a algorithm technique used for verifying data.


What algorithm can't be reversed?

Hashing can't be reversed.


Which is better encryption algorithm among DES Blowfish and MD5?

MD5 isn't a encryption algorithm, it's a hashing algorithm. Encryption will 'hide' the meaning of the encrypted text, while MD5 will 'add up' all the text to come up with a number. This number can be compared to another time this file was 'added up', to provide a simple kind of check to see if the text has been changed or if it is the same.


What is SHA in Unix?

SHA is cryptographic hash function used to encrypt passwords. The SHA hashing algorithm is not restricted to Unix, though. It is typically used to verify the integrity of some downloaded file, to make sure there was no corruption during transmission. Your Windows or OSX software may use this same algorithm without you knowing it.


Which hashing algorithm is used to verify the integrity of data that has been transmitted over a network?

MD5


What you sthe bit length of any generated digest when using the MD5 hashing algorithm?

128 Bits


What are the security servics of cryptography?

Confidentiality, Integrity, Authentication, and Non-repudiationCryptography offers confidentiality and integrity of messages. Confidentiality ensures no one else can read your messages unless they have knowledge of the decryption key. Integrity is knowing the message is unaltered, and can be performed with either a trusted third party, hashing algorithm, or with public key cryptography.


What is Hash file organization in DBMS?

Hashing is the most common form of purely random access to a file or database. It is also used to access columns that do not have an index as an optimisation technique. Hash functions calculate the address of the page in which the record is to be stored based on one or more fields in the record. The records in a hash file appear randomly distributed across the available space. It requires some hashing algorithm and the technique. Hashing Algorithm converts a primary key value into a record address. The most popular form of hashing is division hashing with chained overflow.


The rules for making a hash algorithm are public on the fips website how come someone with access to lets say my sha1 function cant decipher the resulting hash?

Great question - one of the things about hashing is that it is very difficult or impossible to reverse the hashing process, even if you know the algorithm. This is because just doing the steps backwards will not result in the original value.


Which is more secure an LM hash or an NTLM hash?

NTLM Hash is more secure than LM Hash. It was actually replaced by Windows with NTLM. NTLM is case sensitive; so it matters how passwords are typed, its character set is 65,535, and it does not limit stored passwords to two 7- character parts. NTLM is considered a much stronger hashing algorithm. Just make sure passwords stored are more than 14 characters and you will be fine. Now Unix and Linux are probably a more stable OS because they use "salt" Windows LM and NTLM does not.


What are different types of hashing techniques are there in DBMS?

there are 2 types of hashing techniques 1- Static hashing 2-Dynamic hashing


What is the definition of the word 'hashing'?

Hashing is an algorithm (hash function) to convert a string of characters into a fixed sized text using mathematical functions. The file to be hashed is known as “input” the algorithm used in known as ”hash function” and output is called “Hash Value”, some people call hash value as message digest. Hash value is the value that dictates what exactly in this file and always produces hexadecimal value. more on :networkingmania