Sha-1哈希定点 [英] Sha-1 hash fixed point

问题描述

有多难找到x
其中
sha1（x）= x？
其中x是'c999303647068a6abaca25717850c26c9cd0d89c'的形式

我认为存在sha1碰撞的事实使这成为可能，但是，容易（或困难）它找到一个例子？

解决方案

阅读对SHA-1的密码分析在Wikipedia上。

$ b

编辑：

找到x其中sha1（x）= x？$ /

攻击被称为 preimage攻击并找到这样的 x 通常比一般的碰撞攻击要困难得多，例如找到任意 x1 和 x2 ，使得 sha（x1）= sha（x2）。

how hard is it to find x where sha1(x) = x? where x is the form of 'c999303647068a6abaca25717850c26c9cd0d89c'

i think the fact that there are sha1 collisions make this possible, but, how easy (or hard) is it to find an example?

解决方案

Read Cryptanalysis of SHA-1 on Wikipedia. There's more information than you need on that article and its references combined.

Edit:

how hard is it to find x where sha1(x) = x?

Such an attack is known as a preimage attack and finding such an x is usually much harder than a general collision attack, i.e. finding arbitrary x1 and x2 such that sha(x1) = sha(x2).

这篇关于Sha-1哈希定点的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！