如何解密此密码哈希? [英] how to decrypt this password hash?

问题描述

我已经用Google搜索了很多解密，但是没有用的人可以告诉我这是哪种加密类型以及如何解密 0x010056049b0e92e4e85487c8a63385cdb89bdd66cb7f28cab34e

i had googled a lot for decryption but it was useless can anyone please tell me which type of encryption is this and how to decrypt 0x010056049b0e92e4e85487c8a63385cdb89bdd66cb7f28cab34e

有关更多信息:

密码哈希:0x010056049b0e92e4e85487c8a63385cdb89bdd66cb7f28cab34e

标题:0x0100

盐:56049b0e

mixedcase:92e4e85487c8a63385cdb89bdd66cb7f28cab34e

mixedcase: 92e4e85487c8a63385cdb89bdd66cb7f28cab34e

有人可以教我如何生存吗

can anyone teach me how to survive this i m totally new to this

推荐答案

如果密码所有者对您的公司不起作用，那么如果您继续沿这条路走，您可能会违反法律.请非常小心，以确保您知道自己是否违反法律，并就是否违反法律做出适当的决定.我不主张违反法律，并在下面提供可公开获得的信息，以用于您的一般教育目的.

If the password owner doesn't work for your company then you may be running afoul of the law if you continue down this path. Be very careful to ensure that you know if you are violating the law and make an appropriate decision for whether or not to do so. I do not advocate breaking the law, and provide the publicly available information, below, for your general educational purposes.

不想更改密码，但想学习它通常是非常可疑的.如果您有业务访问密码保护的数据，那么您可能有权更改密码，或者您可能已经知道密码.想要保持密码不变，但要了解密码并获得对基础资产的访问权，便会提出一个问题:为什么将密码保持不变?一个明显的答案是防止合法所有者知道您具有访问权限.另一个明显的答案是因为您忘记了密码，并试图重新获得对自己数据的访问权限-尽管访问哈希值非常罕见，但如果确实是合法所有者，则不能仅更改密码.

Not wanting to change the password but wanting to learn it is generally very suspicious. If you have business accessing the data that the password protects, then you probably have access to change the password, or you probably already know the password. Wanting to keep the password unchanged, but learn what it is and gain access to the underlying assets begs the question: why leave it unchanged? One obvious answer is to prevent the rightful owner from knowing that you have access. Another obvious answer is because you forgot the password and are trying to regain access to your own data - though it is very unusual to have access to the hash but not the ability to just change the password if one is truly the rightful owner.

正如评论者所提到的，您不能解密散列.散列和加密/解密是两个单独的操作.加密和解密是相反的，而哈希没有相反的功能.

As commenters have mentioned, you cannot decrypt a hash. Hashing and encryption/decryption are two separate operations. Encryption and decryption are opposites, while hashing has no opposite function.

为简单起见，请考虑将加密像为每个字符加1一样，因此原始文本中的"a"变为"b"，原始文本中的"b"变为"c"，依此类推.解密将从数字中减去1，因此密文中的"b"变为"a".实际上，使用了更困难的数学问题，但这是一般的想法.

For simplicity's sake, consider encryption to be like adding 1 to each character, so "a" in the original text becomes "b", "b" in the original text becomes "c", and so on. Decryption would be subtracting 1 from the number, so "b" in the cipher text becomes "a". In reality, much harder math problems are used, but this is the general idea.

散列没有反函数.考虑像查找mod 2结果一样进行哈希处理.例如，"a"可以表示为值"97"，而97 mod 2 =1."b"可以表示为值"98"，而98 mod 2 =0.如下表所示.

Hashing doesn't have an inverse. Consider hashing like finding the mod 2 result. For example, "a" could be represented as the value "97", and 97 mod 2 = 1. "b" could be represented as the value "98" and 98 mod 2 = 0. Shown as a table below...

letter  numeric            mod 2
         representation      (the 'hash')
 a         97             1
 b         98             0
 c         99             1
 d        100             0
 e        101             1

从表中可以看到，没有办法只知道哈希值就回到原始字母.实际上，基于更难的数学运算，哈希值要复杂得多，并且通常旨在防止冲突-避免了我在描述中出现的情况，其中mod2中每个奇数"字母都导致"1"，而每个偶数"字母都导致一个"0".

As you can see from the table, there's no way to get back to the original letter knowing only the hash value. In reality, hashes are much more complex, based on much harder math, and often are designed to prevent collisions - avoiding the scenario in my description where mod2 every "odd" letter results in a "1" and every "even" letter results in a "0".

尽管如此，应该清楚地是，您不能像可以反转(解密)加密那样反转哈希.

Nonetheless, it should be clear that you cannot reverse a hash like you can reverse (decrypt) encryption.

也就是说，有时有一些方法可以找出密码.您可能会蛮力"尝试所有可能的输入，直到获得预期的结果.也就是说，使用密码"a"，"aa"，"aaa"，"aaa"，...，"b"，"bb"，...，"ab"，...尝试盐.好的哈希算法，这是找出特定哈希的最快方法.但是，使用良好的哈希算法和足够长的密码，您将无法在太阳熄灭之前以这种方式学习密码.

That said, there sometimes ways to find out the password. You might "brute force" every possible input until you get the expected result. That is, try your salt with the password "a", "aa", "aaa", "aaa", ..., "b", "bb", ..., "ab", ... With a good hash algorithm, this is the fastest way to figure out a particular hash. However, with a good hash algorithm and a sufficiently long password, you won't be able to learn the password this way before the sun dies out.

有时，哈希算法会存在弱点.有时，会有一种比暴力破解更快的方法.您需要查找正在使用的特定算法并了解其弱点，但是即使如此，这并不意味着有可能在合理的时间内中断.我将其留给读者练习，并且不会响应任何对指针的请求:)

Sometimes hash algorithms will have weaknesses. Sometimes, there will be a method that is faster than brute forcing. You'd need to look up the particular algorithm in use and learn its weaknesses, but even then this doesn't mean it will be possible to break in reasonable time. I'll leave this as an exercise for the reader, and will not be responding to any requests for pointers :)

最后，通常比尝试反向散列更容易的是以另一种方式学习密码.实际上，这正是强大的哈希算法旨在迫使您执行的操作-很难学习原始密码，以至于您不得不使用另一种技术.例如，如果使用密码的人为您的公司工作，则首席执行官可以要求他们提供密码.通常，真正的目标是获得对有效帐户的控制权，因此您只需更改当前密码即可.

Finally, often easier than attempting to reverse a hash is to learn the password another way. Realistically, this is exactly what a strong hash algorithm is intended to force you to do - it's supposed to be so hard to learn the original password that you have to resort to another technique. For example, if the person who uses the password works for your company, the CEO can ask them for their password. More often, the real goal is to gain control over a valid account, so you can just change the current password.

鉴于您的问题含糊不清，这实际上是我能提供的答案.如果您对更多内容感兴趣，请咨询您的律师并开始阅读Wikipedia文章.他们在解释加密和散列以及相关算法方面做得非常好.

That's about as much of an answer as I can really give, given the vagueness of your question. If you are interested in more, talk to your lawyer and start reading Wikipedia articles. They do a very good job of explaining encryption and hashing and related algorithms.

这篇关于如何解密此密码哈希?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！