搜索结果: 1-5 共查到“密码学 MD”相关记录5条 . 查询时间(0.054 秒)
Better Than Advertised: Improved Collision-Resistance Guarantees for MD-Based Hash Functions
hash functions MD transform SHA
2018/6/25
The MD transform that underlies the MD and SHA families iterates a compression function hh to get a hash function HH. The question we ask is, what property X of hh guarantees collision resistance (CR)...
Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
MD hash function padding rule suffix-free
2009/7/14
This paper characterizes collision preserving padding rules and provides variants
of Merkle-Damgard (MD) which are having less or no overhead costs due to length. We rst
show that sux-free proper...
Various Security Analysis of a pfCM-MD Hash Domain Extension and Applications based on the Extension
pfCM-MD Hash Domain Extension pfCM-MD HMAC
2009/6/9
We propose a new hash domain extension a prefix-free-Counter-Masking-
MD (pfCM-MD). And, among security notions for the hash function, we focus on the
indifferentiable security notion by which we ca...
Enhancing the MD-Strengthening and Designing Scalable Families of One-Way Hash Algorithms
One-Way Hash Algorithm Replaceable One-Way Hash Algorithm One-Way Hash Family Long Term Security
2009/3/16
One-way hash algorithms are an indispensable
tool in data security. Over the last decade or
so a number of one-way hash algorithms have
been designed and many of them have been used
in numerous ap...
How to Construct Sufficient Condition in Searching Collisions of MD
Construct Sufficient Condition Searching Collisions MD
2008/10/31
In Eurocrypt 2005, Wang et al. presented a collision attak on MD5. In their paper, they intoduced “Sufficient Condition” which would be needed to generate collisions. In this paper, we explain how to ...