[转载]XXTEA加密算法的各种程序实现整理

发布:kinglong | 发布时间: 2006年6月28日

原作者：andot
原文章地址：JavaScript实现，Java实现，C# 实现

引用XXTEA文章说明资料：
“... XXTEA 算法很安全，而且非常快速，非常适合应用于 Web 开发中。但目前似乎很少有人将该算法用于实际开发中。甚至国内尚无介绍该算法的文章（至少在 Google 上搜索不到这方面的中文文章，关于密码学算法的书中也未见提及）。我在 Google 上搜索到了几个国外的 XXTEA 算法的实现（见参考文献）...” 。

JavaScript实现（下载文件）
//=================================;

/* xxtea.js
*
* Author: Ma Bingyao <andot@ujn.edu.cn>
* Copyright: CoolCode.CN
* Version: 1.2
* LastModified: 2006-05-02
* This library is free. You can redistribute it and/or modify it.
* http://www.coolcode.cn/?p=128
*/

function xxtea_encrypt(str, key) {
if (str == "") {
return "";
}
var v = str2long(str, true);
var k = str2long(key, false);
var n = v.length - 1;

var z = v[n], y = v[0], delta = 0x9E3779B9;
var mx, e, q = Math.floor(6 + 52 / (n + 1)), sum = 0;
while (q-- > 0) {
sum = sum + delta & 0xffffffff;
e = sum >>> 2 & 3;
for (var p = 0; p < n; p++) {
y = v[p + 1];
mx = (z >>> 5 ^ y << 2) + (y >>> 3 ^ z << 4) ^ (sum ^ y) + (k[p & 3 ^ e] ^ z);
z = v[p] = v[p] + mx & 0xffffffff;
}
y = v[0];
mx = (z >>> 5 ^ y << 2) + (y >>> 3 ^ z << 4) ^ (sum ^ y) + (k[p & 3 ^ e] ^ z);
z = v[n] = v[n] + mx & 0xffffffff;
}

return long2str(v, false);
}

function xxtea_decrypt(str, key) {
if (str == "") {
return "";
}
var v = str2long(str, false);
var k = str2long(key, false);
var n = v.length - 1;

var z = v[n - 1], y = v[0], delta = 0x9E3779B9;
var mx, e, q = Math.floor(6 + 52 / (n + 1)), sum = q * delta & 0xffffffff;
while (sum != 0) {
e = sum >>> 2 & 3;
for (var p = n; p > 0; p--) {
z = v[p - 1];
mx = (z >>> 5 ^ y << 2) + (y >>> 3 ^ z << 4) ^ (sum ^ y) + (k[p & 3 ^ e] ^ z);
y = v[p] = v[p] - mx & 0xffffffff;
}
z = v[n];
mx = (z >>> 5 ^ y << 2) + (y >>> 3 ^ z << 4) ^ (sum ^ y) + (k[p & 3 ^ e] ^ z);
y = v[0] = v[0] - mx & 0xffffffff;
sum = sum - delta & 0xffffffff;
}

return long2str(v, true);
}

Java实现（下载文件）
//=================================;

/* xxtea.java
*
* Author:    Ma Bingyao < andot@ujn.edu.cn >
* Copyright: CoolCode.CN
* Version: 1.0
* LastModified: 2006-05-11
* This library is free. You can redistribute it and/or modify it.
* http://www.coolcode.cn/?p=169
*/
public class xxtea {
/**
   * Encrypt data with key.
   *
   * @param data
   * @param key
   * @return
   */
public static byte [] encrypt ( byte [] data , byte [] key ) {
if ( data . length == 0 ) {
return data ;
}
return toByteArray ( encrypt ( toIntArray ( data , true ) , toIntArray ( key , false )) , false ) ;
}

/**
   * Decrypt data with key.
   *
   * @param data
   * @param key
   * @return
   */
public static byte [] decrypt ( byte [] data , byte [] key ) {
if ( data . length == 0 ) {
return data ;
}
return toByteArray ( decrypt ( toIntArray ( data , false ) , toIntArray ( key , false )) , true ) ;
}

/**
   * Encrypt data with key.
   *
   * @param v
   * @param k
   * @return
   */
public static int [] encrypt ( int [] v , int [] k ) {
int n = v . length - 1 ;
if ( n < 1 ) {
return v ;
}
if ( k . length < 4 ) {
int [] key = new int [ 4 ] ;
System . arraycopy ( k , 0 , key , 0 , k . length ) ;
k = key ;
}
int z = v [ n ] , y = v [ 0 ] , delta = 0x9E3779B9 , sum = 0 , e ;
int p , q = 6 + 52 / ( n + 1 ) ;
while ( q -- > 0 ) {
sum = sum + delta ;
e = sum >>> 2 & 3 ;
for ( p = 0 ; p < n ; p ++ ) {
y = v [ p + 1 ] ;
z = v [ p ] += ( z >>> 5 ^ y << 2 ) + ( y >>> 3 ^ z << 4 ) ^ ( sum ^ y ) + ( k [ p & 3 ^ e ] ^ z ) ;
}
y = v [ 0 ] ;
z = v [ n ] += ( z >>> 5 ^ y << 2 ) + ( y >>> 3 ^ z << 4 ) ^ ( sum ^ y ) + ( k [ p & 3 ^ e ] ^ z ) ;
}
return v ;
}

/**
   * Decrypt data with key.
   *
   * @param v
   * @param k
   * @return
   */
public static int [] decrypt ( int [] v , int [] k ) {
int n = v . length - 1 ;
if ( n < 1 ) {
return v ;
}
if ( k . length < 4 ) {
int [] key = new int [ 4 ] ;
System . arraycopy ( k , 0 , key , 0 , k . length ) ;
k = key ;
}
int z = v [ n ] , y = v [ 0 ] , delta = 0x9E3779B9 , sum , e ;
int p , q = 6 + 52 / ( n + 1 ) ;
sum = q * delta ;
while ( sum != 0 ) {
e = sum >>> 2 & 3 ;
for ( p = n ; p > 0 ; p -- ) {
z = v [ p - 1 ] ;
y = v [ p ] -= ( z >>> 5 ^ y << 2 ) + ( y >>> 3 ^ z << 4 ) ^ ( sum ^ y ) + ( k [ p & 3 ^ e ] ^ z ) ;
}
z = v [ n ] ;
y = v [ 0 ] -= ( z >>> 5 ^ y << 2 ) + ( y >>> 3 ^ z << 4 ) ^ ( sum ^ y ) + ( k [ p & 3 ^ e ] ^ z ) ;
sum = sum - delta ;
}
return v ;
}

/**
   * Convert byte array to int array.
   *
   * @param data
   * @param includeLength
   * @return
   */
private static int [] toIntArray ( byte [] data , boolean includeLength ) {
int n = ((( data . length & 3 ) == 0 ) ? ( data . length >>> 2 )
: (( data . length >>> 2 ) + 1 )) ;
int [] result ;
if ( includeLength ) {
result = new int [ n + 1 ] ;
result [ n ] = data . length ;
} else {
result = new int [ n ] ;
}
n = data . length ;
for ( int i = 0 ; i < n ; i ++ ) {
result [ i >>> 2 ] |= ( 0x000000ff & data [ i ]) << (( i & 3 ) << 3 ) ;
}
return result ;
}

/**
   * Convert int array to byte array.
   *
   * @param data
   * @param includeLength
   * @return
   */
private static byte [] toByteArray ( int [] data , boolean includeLength ) {
int n ;
if ( includeLength ) {
n = data [ data . length - 1 ] ;
} else {
n = data . length << 2 ;
}

byte [] result = new byte [ n ] ;
for ( int i = 0 ; i < n ; i ++ ) {
result [ i ] = ( byte ) ( data [ i >>> 2 ] >>> (( i & 3 ) << 3 )) ;
}
return result ;
}
}

//=================================;
C#实现（下载文件）
//=================================;

/* xxtea.cs
*
* Author: Ma Bingyao < andot@ujn.edu.cn >
* Copyright: CoolCode.CN
* Version: 1.1
* LastModified: 2006-05-05
* This library is free. You can redistribute it and/or modify it.
* http://www.coolcode.cn/?p=163
*/

using System ;

class XXTEA
{
public static Byte [] Encrypt ( Byte [] Data , Byte [] Key )
{
if ( Data . Length == 0 )
{
return Data ;
}
return ToByteArray ( Encrypt ( ToUInt32Array ( Data , true ) , ToUInt32Array ( Key , false )) , false ) ;
}
public static Byte [] Decrypt ( Byte [] Data , Byte [] Key )
{
if ( Data . Length == 0 )
{
return Data ;
}
return ToByteArray ( Decrypt ( ToUInt32Array ( Data , false ) , ToUInt32Array ( Key , false )) , true ) ;
}

public static UInt32 [] Encrypt ( UInt32 [] v , UInt32 [] k )
{
Int32 n = v . Length - 1 ;
if ( n < 1 )
{
return v ;
}
if ( k . Length < 4 )
{
UInt32 [] Key = new UInt32 [ 4 ] ;
k . CopyTo ( Key , 0 ) ;
k = Key ;
}
UInt32 z = v [ n ] , y = v [ 0 ] , delta = 0x9E3779B9 , sum = 0 , e ;
Int32 p , q = 6 + 52 / ( n + 1 ) ;
while ( q -- > 0 )
{
sum = unchecked ( sum + delta ) ;
e = sum >> 2 & 3 ;
for ( p = 0 ; p < n ; p ++ )
{
y = v [ p + 1 ] ;
z = unchecked ( v [ p ] += ( z >> 5 ^ y << 2 ) + ( y >> 3 ^ z << 4 ) ^ ( sum ^ y ) + ( k [ p & 3 ^ e ] ^ z )) ;
}
y = v [ 0 ] ;
z = unchecked ( v [ n ] += ( z >> 5 ^ y << 2 ) + ( y >> 3 ^ z << 4 ) ^ ( sum ^ y ) + ( k [ p & 3 ^ e ] ^ z )) ;
}
return v ;
}
public static UInt32 [] Decrypt ( UInt32 [] v , UInt32 [] k )
{
Int32 n = v . Length - 1 ;
if ( n < 1 )
{
return v ;
}
if ( k . Length < 4 )
{
UInt32 [] Key = new UInt32 [ 4 ] ;
k . CopyTo ( Key , 0 ) ;
k = Key ;
}
UInt32 z = v [ n ] , y = v [ 0 ] , delta = 0x9E3779B9 , sum , e ;
Int32 p , q = 6 + 52 / ( n + 1 ) ;
sum = unchecked (( UInt32 )( q * delta )) ;
while ( sum != 0 )
{
e = sum >> 2 & 3 ;
for ( p = n ; p > 0 ; p -- )
{
z = v [ p - 1 ] ;
y = unchecked ( v [ p ] -= ( z >> 5 ^ y << 2 ) + ( y >> 3 ^ z << 4 ) ^ ( sum ^ y ) + ( k [ p & 3 ^ e ] ^ z )) ;
}
z = v [ n ] ;
y = unchecked ( v [ 0 ] -= ( z >> 5 ^ y << 2 ) + ( y >> 3 ^ z << 4 ) ^ ( sum ^ y ) + ( k [ p & 3 ^ e ] ^ z )) ;
sum = unchecked ( sum - delta ) ;
}
return v ;
}
private static UInt32 [] ToUInt32Array ( Byte [] Data , Boolean IncludeLength )
{
Int32 n = ((( Data . Length & 3 ) == 0 ) ? ( Data . Length >> 2 ) : (( Data . Length >> 2 ) + 1 )) ;
UInt32 [] Result ;
if ( IncludeLength )
{
Result = new UInt32 [ n + 1 ] ;
Result [ n ] = ( UInt32 ) Data . Length ;
}
else
{
Result = new UInt32 [ n ] ;
}
n = Data . Length ;
for ( Int32 i = 0 ; i < n ; i ++ )
{
Result [ i >> 2 ] |= ( UInt32 ) Data [ i ] << (( i & 3 ) << 3 ) ;
}
return Result ;
}
private static Byte [] ToByteArray ( UInt32 [] Data , Boolean IncludeLength )
{
Int32 n ;
if ( IncludeLength )
{
n = ( Int32 ) Data [ Data . Length - 1 ] ;
}
else
{
n = Data . Length << 2 ;
}
Byte [] Result = new Byte [ n ] ;
for ( Int32 i = 0 ; i < n ; i ++ )
{
Result [ i ] = ( Byte )( Data [ i >> 2 ] >> (( i & 3 ) << 3 )) ;
}
return Result ;
}
}

标签:

XXTEA 加密算法 javascript Java C#

发布:kinglong | 分类:JAVA/C# | 评论:3 | 引用:0 | 浏览: | TrackBack引用地址

相关文章:
最近有关flash受IE补丁影响的消息以及解决方法  (2006-3-7 14:26:51)
[收藏]符合web标准的flash插入法  (2006-2-27 9:58:12)
[转载]javascript 的面向对象特性参考  (2006-2-27 9:51:49)
仿flash组件事件侦听注册技术的基类-KEvent  (2006-2-8 15:47:45)
[转载收藏]JavaScript的例外处理(try...catch...finally)  (2006-2-8 13:39:49)
常用的一些javascript小技巧  (2005-12-19 16:37:51)
一个表单验证的js代码  (2004-11-26 16:40:2)
推荐一篇有关[面向对象的Jscript]文章  (2004-11-13 16:43:35)
又整理一些有关检查数据的JS代码  (2004-11-12 16:46:47)
常用javascript代码  (2004-9-23 16:47:50)

1.神魂颠倒TWG
http://bbs.flash2u.com.tw
谢谢分享
很有用的资讯
我转载於此：http://bbs.flash2u.com.tw/FlashTopic64914_85_9_1.htm
2006-7-6 1:46:34 回复该留言

2.wool
好东西
js和e文都不好，能不能详细介绍一下该算法，比如原理及运用实例等
2006-9-24 11:37:09 回复该留言

3.sam
http://www.puhuagood.com
之前我尝试做过类似的，效果不好。谢谢你的资料，有帮助！！
2007-6-7 23:47:15 回复该留言

发表评论

◎欢迎参与讨论，请在这里发表您的看法、交流您的观点。

Kinglong's Blog

关于本博客

[转载]XXTEA加密算法的各种程序实现整理

发表评论

搜索内容

最近发表

最新评论及回复

最近留言