我正在做一个关于密码学的在线免费课程,有一个非常令人困惑的问题:
有人能解释一下答案吗?
Question for hashing algorithms:
Select one or more than one.
a. It is impossible to break its resistance to collision and preimage
b. It is more difficult to break its resistance to collision than to the preimage
c. It's just as easy to break your r
可能重复: 不同哈希算法的碰撞率
许多哈希算法似乎都有固定长度的消息摘要作为输出。
如果我计算两个字符串的md5散列:
>>> hashlib.md5("This is a really really long text string to make a hash out of").hexdigest()
'2916991b5ebba69ab38a84a0a72b4176'
>>> hashlib.md5("Short").hexdigest()
'30bb747c98bccdd11b3f89e64