首页
社区
课程
招聘
算文件摘要的话,最快是什么算法
发表于: 2009-10-15 00:00 7519

算文件摘要的话,最快是什么算法

2009-10-15 00:00
7519
网上号称md5最快,但是测试过md4性能好一点
有没有其他散列能快速计算文件摘要,又相对可靠点的呢?

[注意]传递专业知识、拓宽行业人脉——看雪讲师团队等你加入!

收藏
免费 0
支持
分享
最新回复 (8)
雪    币: 2096
活跃值: (100)
能力值: (RANK:420 )
在线值:
发帖
回帖
粉丝
2
自己創一個 hash function 可能會比較好一點。
2009-10-15 00:03
0
雪    币: 259
活跃值: (10)
能力值: ( LV2,RANK:10 )
在线值:
发帖
回帖
粉丝
3
呵呵,版主的头像真cute。
自己创的话,我想顶多也就是类似crc那种水平了。。
2009-10-15 01:06
0
雪    币: 2096
活跃值: (100)
能力值: (RANK:420 )
在线值:
发帖
回帖
粉丝
4
不論水平如何~
相信~~自己創的 ~~應該會很快 ~~自己相信它的可靠度也高~~
但它是不是真的 secure? 沒人知道!
2009-10-15 01:17
0
雪    币: 232
活跃值: (10)
能力值: ( LV4,RANK:50 )
在线值:
发帖
回帖
粉丝
5
很多散列算法都能做文件摘要,例如 VirusTotal 用到的MD5、SHA-1等
自己写算法也行,不过要注意,文件摘要的目的是让算出的散列值尽可能只对应一个文件,比如你 CRC(文件A),但也有可能出现 CRC(文件B) = CRC(文件A) 的冲突情况,只要要解决这个问题你的摘要算法就OK了。

解决办法也很简单,所谓再一再二不能再三再四,用2-3个不同的哈希算法计算文件的摘要,哪怕第一个算法的散列值碰撞了,第二个算法同时发生 Hash(文件A) = Hash(文件B) 的可能性可以说微乎其微... VirusTotal中就是复合采用 MD5/SHA-1/文件大小 来唯一确定一个文件的。
2009-10-15 08:43
0
雪    币: 259
活跃值: (10)
能力值: ( LV2,RANK:10 )
在线值:
发帖
回帖
粉丝
6
crc就是觉得碰撞的可能性高了点。不知道更高位的crc会不会好一点。
如果是用多种hash算digest,就没办法达到速度的要求了。。目前我的速度需求比较大
现在我想做个目录树的水印库,要算每个文件的hash,跟远端对比是否有改动。
这个文件夹文件又多又大,那就会长时间耗费cpu了。
rsync的效率十分高,不过还没看源码不知道是怎么算digest的。
2009-10-15 09:03
0
雪    币: 2096
活跃值: (100)
能力值: (RANK:420 )
在线值:
发帖
回帖
粉丝
7
1) http://www.springerlink.com/content/771w5258677t85t4/
Watermarking Abstract Tree-Structured Data
系列書 Lecture Notes in Computer Science
出版社 Springer Berlin / Heidelberg
ISSN 0302-9743 (Print) 1611-3349 (Online)
卷 Volume 3739/2005
圖書 Advances in Web-Age Information Management
DOI 10.1007/11563952
版權 2005
ISBN 978-3-540-29227-2
文章類目 Research Session 5: Data Management (I)
DOI 10.1007/11563952_20
頁 221-232
Subject Collection 電腦科學
SpringerLink Date 2005年10月20日

Gang Chen , Ke Chen , Tianlei Hu  and Jinxiang Dong

College of Computer Science, Zhejiang University, Hangzhou, 310027, P.R.China

Abstract
Digital watermarking techniques have been successfully applied in multimedia data such as image, audio, video, etc. With the rapid development of Internet, the requirement of copyright and integrity protection over semi-structured data, such as XML documents and complex hypertext content, is becoming more and more urgent. However, it is more challenging to apply the effective watermarking schemes into semi-structured data, because watermark for semi-structured data must have the dual protection feature toward both structure and content. In general, most semi-structured data can be represented as tree. Therefore, in this paper, we propose a novel watermark scheme for tree-structured data based on the value lying both in the tree structure and in the node content, which gives a comprehensive protection for both node content and structure of tree. The experiments on the robustness of the solution against various forms of attacks are conducted. The results highlight correctness and efficiency of our solution.

2) http://cat.inist.fr/?aModele=afficheN&cpsidt=20601824
Titre du document / Document title
A Novel Tree Structure Based Watermarking Algorithm
Auteur(s) / Author(s)
LIN Qiwei (1) ; FENG Gui (1) ;
Affiliation(s) du ou des auteurs / Author(s) Affiliation(s)
(1) Dept. of electronic and communication, HuaQiao University, QuanZhou, 362021, CHINE

Résumé / Abstract
In this paper, we propose a new blind watermarking algorithm for images which is based on tree structure. The algorithm embeds the watermark in wavelet transform domain, and the embedding positions are determined by significant coefficients wavelets tree(SCWT) structure, which has the same idea with the embedded zero-tree wavelet (EZW) compression technique. According to EZW concepts, we obtain coefficients that are related to each other by a tree structure. This relationship among the wavelet coefficients allows our technique to embed more watermark data. If the watermarked image is attacked such that the set of significant coefficients is changed, the tree structure allows the correlation-based watermark detector to recover synchronously. The algorithm also uses a visual adaptive scheme to insert the watermark to minimize watermark perceptibility. In addition to the watermark, a template is inserted into the watermarked image at the same time. The template contains synchronization information, allowing the detector to determine the geometric transformations type applied to the watermarked image. Experimental results show that the proposed watermarking algorithm is robust against most signal processing attacks, such as JPEG compression, median filtering, sharpening and rotating. And it is also an adaptive method which shows a good performance to find the best areas to insert a stronger watermark.
Revue / Journal Title
Proceedings of SPIE, the International Society for Optical Engineering   ISSN 0277-786X   CODEN PSISDG  
Source / Source
Congrès
International Symposium on Photoelectronic Detection and Imaging 2007 :   ( Image processing : 9-12 September 2007, Beijing China )
International Symposium on Photoelectronic Detection and Imaging, Beijing , CHINE (2007)
2008  , vol. 6623, pp. 66231W.1-66231W.7[Note(s) : various pagings, ] (11 ref.) ISBN 978-0-8194-6765-2 ; 0-8194-6765-0 ;  Illustration : Illustration ;
Langue / Language
Anglais

Editeur / Publisher
Society of Photo-Optical Instrumentation Engineers, Bellingham, WA, ETATS-UNIS  (1981) (Revue)
SPIE, Bellingham, Wash., ETATS-UNIS  (2008) (Monographie)

Mots-clés anglais / English Keywords
Correlation methods ; Wavelets ; Signal analysis ; Tree structured method ; Digital watermarking ; Tree structure ; Image processing ; Image compression ; Watermarking ; Experimental study ; Wavelet transforms ; Algorithms ; Signal processing ; Synchronization ;
Mots-clés français / French Keywords
4230V ; 0705P ; 0130C ; Méthode corrélation ; Ondelette ; Analyse signal ; Méthode arborescente ; Filigranage numérique ; Structure arborescente ; Traitement image ; Compression image ; Filigranage ; Etude expérimentale ; Transformation ondelette ; Algorithme ; Traitement signal ; Synchronisation ;
Mots-clés espagnols / Spanish Keywords
Análisis de señal ; Método arborescente ; Filigrana digital ; Estructura arborescente ; Compresión imagen ;
Localisation / Location
INIST-CNRS, Cote INIST : 21760, 35400017283301.0670

3) 使用三維模型來發展三維模型浮水印

4) A Semi-Blind Watermarking Scheme for Color Images Using a Tree Structure

.....族繁不及備載.....
2009-10-15 09:58
0
雪    币: 259
活跃值: (10)
能力值: ( LV2,RANK:10 )
在线值:
发帖
回帖
粉丝
8
十分感谢,先看看。
2009-10-15 10:30
0
雪    币: 211
活跃值: (10)
能力值: ( LV2,RANK:10 )
在线值:
发帖
回帖
粉丝
9
我用过的最快是UHASH,自己测过,比MD5快。专门有篇论文介绍UHASH,你可以搜索一下
2009-10-23 15:39
0
游客
登录 | 注册 方可回帖
返回
//