Results 181 to 190 of about 164,602 (198)
Some of the next articles are maybe not open access.
2008 International Conference on Advanced Computer Theory and Engineering, 2008
A new image retrieval method was introduced based on the combination of CBIR (content-based image retrieval) and MD5, after a brief introduction to current status of image retrieval technology. Kernel thought was that MD5 value was extracted from an image file and then indexed. These indexed MD5 values were used for image retrieval.
openaire +2 more sources
A new image retrieval method was introduced based on the combination of CBIR (content-based image retrieval) and MD5, after a brief introduction to current status of image retrieval technology. Kernel thought was that MD5 value was extracted from an image file and then indexed. These indexed MD5 values were used for image retrieval.
openaire +2 more sources
Preimage Attacks on Step-Reduced MD5
2008In this paper, we propose preimage attacks on step-reduced MD5. We show that a preimage of a 44-step MD5 can be computed to a complexity of 296. We also consider a preimage attack against variants of MD5 where the round order is modified from the real MD5.
Yu Sasaki, Kazumaro Aoki
openaire +2 more sources
MD5 collisions and the impact on computer forensics
Digital Investigation, 2005In August 2004 at the annual cryptography conference in Santa Barbara, California a group of cryptographers, Xianyan Wang, Dengguo Feng, Xuejia Lai, Hongbo Yu, made the announcement that they had successfully generated two files with different contents that had the same MD5 hash.
openaire +2 more sources
An Improved Collision Attack on MD5 Algorithm
2008The research on the attack algorithm for a MD5 collision is one of the focuses in cryptology nowadays. In this paper, by analyzing the properties of the nonlinear Boolean functions used in MD5 and the differences in term of XOR and subtraction modulo 232, we prove that some sufficient conditions presented by Jie Liang and Xuejia Lai are also necessary ...
Chenhui Jin, Shiwei Chen
openaire +2 more sources
2020
If X is sender of a message and Y is the receiver of the same, then X encrypts the same with Y’s public key and then sends the encrypted data to Y. It confirms about authenticity and authorization of receiver. If X sends message and Y receives, X encrypts the message with X’s private key and sends the encrypted data to Y.
Surojit Roy +3 more
openaire +2 more sources
If X is sender of a message and Y is the receiver of the same, then X encrypts the same with Y’s public key and then sends the encrypted data to Y. It confirms about authenticity and authorization of receiver. If X sends message and Y receives, X encrypts the message with X’s private key and sends the encrypted data to Y.
Surojit Roy +3 more
openaire +2 more sources
Improved Collision Attacks on MD4 and MD5
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007At Eurocrypt'05, Wang et al. presented efficient collision attacks on MD5 and MD4 hash functions. They found a collision of MD5 with a complexity of less than 237 MD5 hash operations, and a collision of MD4 with complexity less than 28 MD4 hash operations. In their attack, the procedure to generate a collision is divided into 4 steps.
Noboru Kunihiro +3 more
openaire +2 more sources
Studies of Quadratic Watermark Based on MD5
2013In the area of digital watermark’s copyright protection, it is difficult to identify the rightful ownership in multiple marks, namely the interpretation attack. In this paper, we propound the quadratic watermark based on the message-digest algorithm 5 (MD5). By embedding a watermark and the MD5 into the products in proper order, the products can resist
Shibo Qiu, Lei Liu, Taolin Ma
openaire +2 more sources
Construction of the Initial Structure for Preimage Attack of MD5
2009 International Conference on Computational Intelligence and Security, 2009The construction of the initial structure for preimage attack of MD5 is proposed in this paper. With the help of “divide-and-rule” technique, the successful possibility of the construction is higher than 2-32 . Our construction is based on the MD5 structure, the message modification technique which is improved from Wang’ s. Some related techniques such
Jin Xu, Ming Mao, Shaohui Chen
openaire +2 more sources
Researching on MD5's characteristics based on software reversing
The Journal of China Universities of Posts and Telecommunications, 2010Abstract Recognizing message digest algorithm 5 (MD5 algorithm) from binary files plays an important role in finding malicious code and protecting computer system. Based on analysis result of the basic concept of MD5 algorithm, this paper researches their software reversing characters, and gives analysis of typical examples in detail.
Li-na Zhang, Yu Nan, Yue-Long Ou
openaire +2 more sources
TG43 - The MD5 Checksum for an MSL Report
2023MSL can provide electronic calibration, test, and measurement reports in Portable Document Format (PDF) as an alternative to paper documents. When a report is emailed to a customer, MSL also provides an MD5 checksum for the file. A new checksum should be calculated on arrival and compared to the one provided by MSL.
openaire +1 more source