解密的密码 [英] decrypted pwd

查看:98
本文介绍了解密的密码的处理方法,对大家解决问题具有一定的参考价值,需要的朋友们下面随着小编来一起学习吧!

问题描述

美好的一天!


有一种方法可以检索用户的解密密码,就像我发布了一个SELECT * * FROM pg_shadow;"在早期版本的postgresql中?


提前感谢!ü

*(ˉ`·。,??。·'ˉ`·。?? .-> don诉soledad?

解决方案

" Don V. Soledad"< do ********* @ uratex.com.ph>写道:

有没有办法检索用户的解密密码,




如果找到了打破MD5的方式,很多人会非常非常感兴趣。


问候,汤姆车道


---------------------------(广播结束)----------------- ----------

提示7:别忘了增加你的免费空间地图设置


< blockquote> 2003年9月6日星期六,Don V. Soledad写道:

美好的一天!

有没有办法检索用户的解密密码,就像我在早期版本的postgresql中发出SELECT * FROM pg_shadow;时一样?


当然,这是一个简单的方法:


1:生成所有可能密码的列表。

2:为每一个生成一个md5 sig。

3:将无限数量的md5 sig与为

用户存储的sig5 sig进行比较。当它们匹配时,你会得到原始密码,或者至少一个

密码,它将像原版一样工作。


我认为总数这样做所需的计算机时间是几千年的订单,所以可能需要在集群中使用相当大的机器来实现这一点。

---------------------------(广播结束)---------- -----------------

提示9:如果您加入

加入,计划员将无视您选择索引扫描的愿望column'的数据类型不匹配


2003年9月8日星期一08:53:26 -0600,

scott.marlowe < SC *********** @ ihs.com>写道:

3:将无限数量的md5 sigs与为
用户存储的sig5 sigs进行比较。当它们匹配时,你会得到原始密码,或者至少一个可以像原始密码一样工作的密码。




这可能是值得的试图花一些时间试图找到一套有限的密码,这些密码被保证成为所有可能的生成器

MD5哈希(或者至少可能发生的哈希) ,这样你就可以在有限的时间内完成计算。


------------------ ---------(广播结束)---------------------------

提示7:别忘了增加你的免费空间地图设置


good day!

is there a way to retrieve a user''s decrypted password, just like when i
issued a "SELECT * FROM pg_shadow;" in the earlier version of postgresql?

thanks in advance!ü
*(ˉ`·.,??.·′ˉ`·.??.-> don v. soledad?

解决方案

"Don V. Soledad" <do*********@uratex.com.ph> writes:

is there a way to retrieve a user''s decrypted password,



If you find a way to break MD5, a lot of people will be very very
interested.

regards, tom lane

---------------------------(end of broadcast)---------------------------
TIP 7: don''t forget to increase your free space map settings


On Sat, 6 Sep 2003, Don V. Soledad wrote:

good day!

is there a way to retrieve a user''s decrypted password, just like when i
issued a "SELECT * FROM pg_shadow;" in the earlier version of postgresql?



Sure, here''s the simple method:

1: Generate a list of all possible passwords.
2: Generate an md5 sig for each one.
3: Compare your infinite number of md5 sigs to the one stored for the
user. When they match, you''ve got the original password, or at least a
password that will work just like the original.

I think the total computer time required to do this is something on the
order of a few thousand years, so it might take a rather large farm of
machines in a cluster to do this.
---------------------------(end of broadcast)---------------------------
TIP 9: the planner will ignore your desire to choose an index scan if your
joining column''s datatypes do not match


On Mon, Sep 08, 2003 at 08:53:26 -0600,
"scott.marlowe" <sc***********@ihs.com> wrote:

3: Compare your infinite number of md5 sigs to the one stored for the
user. When they match, you''ve got the original password, or at least a
password that will work just like the original.



It is probably worth trying to spend some time trying to find a finite
set of passwords that are guarenteed to be generators for all possible
MD5 hashes (or at least those than can possibly occur), so that you can
finish the computation in finite time.

---------------------------(end of broadcast)---------------------------
TIP 7: don''t forget to increase your free space map settings


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

查看全文
登录 关闭
扫码关注1秒登录
发送“验证码”获取 | 15天全站免登陆