- 浏览: 82048 次
- 性别:
- 来自: 重庆
最新评论
-
lihua2008love:
为什么报javax.imageio.IIOException: ...
图片加水印JAVA实现 -
dearhwj:
我整理了一些我常用的Eclipse插件http://www.d ...
eclipse 常用插件 -
javay:
谢谢。
图片加水印JAVA实现 -
hailanc1108:
不错,谢谢啦.
图片加水印JAVA实现 -
elf8848:
我看了, 很好, 但水印不是半透明的
图片加水印JAVA实现
Java版本
Javascript版本
import java.security.MessageDigest; /** * MD5的算法在RFC1321 中定义 在RFC 1321中,给出了Test suite用来检验你的实现是否正确: * MD5 ("") = d41d8cd98f00b204e9800998ecf8427e * MD5 ("a") = 0cc175b9c0f1b6a831c399e269772661 * MD5 ("abc") = 900150983cd24fb0d6963f7d28e17f72 * MD5 ("message digest") = f96b697d7cb7938d525a2f31aaf161d0 * MD5 ("abcdefghijklmnopqrstuvwxyz") = c3fcd3d76192e4007dfb496cca67e13b * * * 传入参数:一个字节数组 传出参数:字节数组的 MD5 结果字符串 */ public class MD5 { public static String getMD5(String pwd) { byte[] source = pwd.getBytes(); String s = null; // 用来将字节转换成 16 进制表示的字符 char hexDigits[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' }; try { // MD5 的计算结果是一个 128 位的长整数, 用字节表示就是 16 个字节 MessageDigest md = MessageDigest.getInstance("MD5"); md.update(source); byte tmp[] = md.digest(); // 每个字节用 16 进制表示的话,使用两个字符,所以表示成 16进制需要 32 个字符 char str[] = new char[16 * 2]; // 表示转换结果中对应的字符位置 int k = 0; // 从第一个字节开始,对 MD5 的每一个字节转换成 16 进制字符的转换 for (int i = 0; i < 16; i++) { // 取第 i 个字节 byte byte0 = tmp[i]; // 取字节中高 4 位的数字转换,>>> 为逻辑右移,将符号位一起右移 str[k++] = hexDigits[byte0 >>> 4 & 0xf]; // 取字节中低 4 位的数字转换 str[k++] = hexDigits[byte0 & 0xf]; } s = new String(str); // 换后的结果转换为字符串 } catch (Exception e) { e.printStackTrace(); } return s; } public static void main(String xu[]) { // 计算 "a" 的 MD5 // 代码,应该为:0cc175b9c0f1b6a831c399e269772661 System.out.println(MD5.getMD5("a")); } }
Javascript版本
/* * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message * Digest Algorithm, as defined in RFC 1321. * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet * Distributed under the BSD License * See http://pajhome.org.uk/crypt/md5 for more info. */ /* * Configurable variables. You may need to tweak these to be compatible with * the server-side, but the defaults work in most cases. */ var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */ var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */ var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */ /* * These are the functions you'll usually want to call * They take string arguments and return either hex or base-64 encoded strings */ function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));} function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));} function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));} function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); } function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); } function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); } /* * Perform a simple self-test to see if the VM is working */ function md5_vm_test() { return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72"; } /* * Calculate the MD5 of an array of little-endian words, and a bit length */ function core_md5(x, len) { /* append padding */ x[len >> 5] |= 0x80 << ((len) % 32); x[(((len + 64) >>> 9) << 4) + 14] = len; var a = 1732584193; var b = -271733879; var c = -1732584194; var d = 271733878; for(var i = 0; i < x.length; i += 16) { var olda = a; var oldb = b; var oldc = c; var oldd = d; a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); c = md5_ff(c, d, a, b, x[i+10], 17, -42063); b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); d = md5_ff(d, a, b, c, x[i+13], 12, -40341101); c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329); a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); c = md5_gg(c, d, a, b, x[i+11], 14, 643717713); b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); c = md5_gg(c, d, a, b, x[i+15], 14, -660478335); b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734); a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); b = md5_hh(b, c, d, a, x[i+14], 23, -35309556); a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); d = md5_hh(d, a, b, c, x[i+12], 11, -421815835); c = md5_hh(c, d, a, b, x[i+15], 16, 530742520); b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651); a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); c = md5_ii(c, d, a, b, x[i+10], 15, -1051523); b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); d = md5_ii(d, a, b, c, x[i+15], 10, -30611744); c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551); a = safe_add(a, olda); b = safe_add(b, oldb); c = safe_add(c, oldc); d = safe_add(d, oldd); } return Array(a, b, c, d); } /* * These functions implement the four basic operations the algorithm uses. */ function md5_cmn(q, a, b, x, s, t) { return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b); } function md5_ff(a, b, c, d, x, s, t) { return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t); } function md5_gg(a, b, c, d, x, s, t) { return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t); } function md5_hh(a, b, c, d, x, s, t) { return md5_cmn(b ^ c ^ d, a, b, x, s, t); } function md5_ii(a, b, c, d, x, s, t) { return md5_cmn(c ^ (b | (~d)), a, b, x, s, t); } /* * Calculate the HMAC-MD5, of a key and some data */ function core_hmac_md5(key, data) { var bkey = str2binl(key); if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz); var ipad = Array(16), opad = Array(16); for(var i = 0; i < 16; i++) { ipad[i] = bkey[i] ^ 0x36363636; opad[i] = bkey[i] ^ 0x5C5C5C5C; } var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz); return core_md5(opad.concat(hash), 512 + 128); } /* * Add integers, wrapping at 2^32. This uses 16-bit operations internally * to work around bugs in some JS interpreters. */ function safe_add(x, y) { var lsw = (x & 0xFFFF) + (y & 0xFFFF); var msw = (x >> 16) + (y >> 16) + (lsw >> 16); return (msw << 16) | (lsw & 0xFFFF); } /* * Bitwise rotate a 32-bit number to the left. */ function bit_rol(num, cnt) { return (num << cnt) | (num >>> (32 - cnt)); } /* * Convert a string to an array of little-endian words * If chrsz is ASCII, characters >255 have their hi-byte silently ignored. */ function str2binl(str) { var bin = Array(); var mask = (1 << chrsz) - 1; for(var i = 0; i < str.length * chrsz; i += chrsz) bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32); return bin; } /* * Convert an array of little-endian words to a string */ function binl2str(bin) { var str = ""; var mask = (1 << chrsz) - 1; for(var i = 0; i < bin.length * 32; i += chrsz) str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask); return str; } /* * Convert an array of little-endian words to a hex string. */ function binl2hex(binarray) { var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length * 4; i++) { str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) + hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF); } return str; } /* * Convert an array of little-endian words to a base-64 string */ function binl2b64(binarray) { var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; var str = ""; for(var i = 0; i < binarray.length * 4; i += 3) { var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16) | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 ) | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF); for(var j = 0; j < 4; j++) { if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); } } return str; }
发表评论
-
设计模式备忘录
2012-02-27 23:11 872创建型模式 1.抽 ... -
文件拷贝工具
2009-09-18 18:45 828package jp.swtech; import ... -
随机生成指定长度的全半角日文假名
2009-09-16 21:48 2748package cn.com.oneslife; ... -
javadoc参数
2009-06-19 18:44 1527生成javadoc的时候添加的参数,不然中文会出现乱码! -
Hibernate中Criteria总结(一)
2009-05-31 00:47 1376复合查询主要是处理,具有关联关系的两个实体怎样进行关联查询, ... -
eclipse 常用插件
2009-05-03 01:27 1543SVN Explain: 版本控制插件 Home Page: ... -
Spring+Hibernate延迟加载测试基类
2009-04-22 03:17 1317package cn.com.oneslife; imp ... -
Spring2.5 及 Hibernate Annotation 配置文件笔记
2009-04-21 19:18 12461. web.xml 配置 <context-pa ... -
hibernate annotation
2009-04-21 18:14 975hibernate提供了hibernate ann ... -
利用struts拦截器实现简单的权限验证
2009-04-17 18:25 1431package cn.com.oneslife.interce ... -
Spring 2.5 典型配置
2009-04-14 19:15 1021<?xml version="1.0&qu ... -
Java 术语表
2009-04-07 02:02 1006Java术语表 英文 中文 acces ... -
Spring Security 2 配置精讲
2009-04-05 23:42 1018downpour 写道论坛上看了 ... -
Spring2.5注释语法
2009-04-04 02:41 1680Spring的IoC public class Foo {① ... -
用Spring AOP实现松散耦合
2009-04-04 01:23 840摘 要 面向方面编程(AO ... -
将HQL以及参数加载到Query实例中
2009-04-03 18:43 1346package cn.com.oneslife.dao; ... -
[转]string和stringbuffer的区别
2009-03-02 16:14 845看JAVA源代码,发现了str ... -
Hibernate 的数据加载方式
2008-12-24 13:35 6791.即时加载(Immediate Loading)当实体加载完 ... -
数独游戏网址
2007-08-13 17:35 1137http://www.sudoku.name/index-cn ... -
图片加水印JAVA实现
2007-08-13 17:12 8709java 代码 import java.awt. ...
相关推荐
用matlab实现的一个md5算法,有详细的注释说明
MD5算法是一种广泛使用的 Hash 算法,常用于确保信息传输的完整性与一致性。对于输入的任一不定长度信息, MD5算法在对最后一块进行填充后用512个比特对其进行分组,使用压缩函数将其生成4个32比特的数据,合并为128...
如果你想学习md5算法,又苦于看不懂代码,就看看这个流程图吧
MD5算法应用 MD5算法应用 MD5算法应用 MD5算法应用
MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法MD5算法
基于 MD5 算法的文件完整性校验程序,本实验使用 C++ 语言在 Linux 平台进行编程和运行。 ./md5 -h 查看帮助 ./md5 -t 打印程序的测试信息 ./md5 -c nankai.txt 计算出的被测文件的 MD5 摘要并打印 ./md5 -v nankai....
MD5 算法 c++builder 类模块,在xe10下添加进工程可以不做修改直接使用,例程是bcb6的项目。
MD5算法的(c语言)实现Decode (x, block, 64); //第一轮 FF (a,b,c,d,x[0],7,0xd76aa478); FF (d,a,b,c,x[1],12,0xe8c7b756); FF (c,d,a,b,x[2],17,0x242070db); FF (b,c,d,a,x[3],22,0xc1bdceee); FF ...
MD5算法源代码,java类型的,实此程序现了md5算法,能正确运行!
java的MD5算法 java的MD5算法,java的MD5算法,java的MD5算法 方便有需要的兄弟
按照MD5摘要算法在matlab上实现的MD5算法。
MD5 算法的实现过程MD5 算法的实现过程MD5 算法的实现过程
基于MD5算法的文件完整性检查工具,这个工具比较好用,现在推荐你们!
简单地MD5算法演算,有利于初学者了解并掌握MD5算法过程
此为MD5算法源码,与学校老师教学PPT上的讲解有所更改,仅供参考
MD5算法java篇
MD5算法封装,可以直接使用。 简单容易使用的MD5算法,用于文件Hash计算。
参考http://www.cppblog.com/ant/archive/2007/09/11/31886.html一文所述的方法,结合...利用Qt编程,对MD5算法进行了改写。具体解释请参考http://blog.csdn.net/tandesir/article/details/7851991
吉林大学硕士论文完整原版,MD5算法研究,算法原理,常见优秀hash函数,MD5算法优化等。
链接: https://pan.baidu.com/s/1YDd-uSEUDqK-x2lIUjBieA 提取码: ak53 复制这段内容后打开百度网盘手机App,操作更方便哦 按照md5加密算法流程,使用matlab的m语言编写的md5加密算法。