谁能给个TEA算法的测试例程的C语言写的啊！

1106767620

谁能给个TEA算法的测试例程的C语言写的啊！不胜感激！！！！

1106767620

顶起来啊！

wqy_1000

用C写的TEA算法源代码

1. /*
   
2. The Tiny Encryption Algorithm, or TEA, is a Feistel cipher invented by David
   
3. Wheeler. It is intended for use in applications where code size is at a
   
4. premium, or where it is necessary for someone to remember the algorithm and
   
5. code it on an arbitrary machine at a later time.
   
6. 
   
7. Since its round function is relatively weak, with nonlinearity coming only from
   
8. the carry propagation, TEA has 64 rounds. However, its simplicity means that it
   
9. runs more quickly in software than many other algorithms with fewer, more
   
10. complex, rounds.
    
11. */
    
12. 
    
13. void code(long* v, long* k)
    
14. {
    
15. unsigned long y=v[0],z=v[1],sum=0,             /* set up */
    
16.               delta=0x9e3779b9, n=32 ;         /* key schedule constant*/
    
17. 
    
18. while (n-->0)
    
19. {                                              /* basic cycle start*/
    
20.   sum += delta ;
    
21.   y += (z<<4)+k[0] ^ z+sum ^ (z>>5)+k[1] ;
    
22.   z += (y<<4)+k[2] ^ y+sum ^ (y>>5)+k[3] ;     /* end cycle */
    
23. }
    
24. v[0]=y ;
    
25. v[1]=z ;
    
26. }
    

复制代码

wqy_1000

1. /**********************************************************
   
2.    TEA - Tiny Encryption Algorithm
   
3.    Feistel cipher by David Wheeler & Roger M. Needham
   
4.    (extended version)
   
5. **********************************************************/
   
6. 
   
7. #define ROUNDS 32
   
8. #define DELTA 0x9e3779b9 /* sqr(5)-1 * 2^31 */
   
9. 
   
10. #include "ctypes.h"
    
11. 
    
12. /**********************************************************
    
13.    Input values:         k[4]        128-bit key
    
14.                         v[2]    64-bit plaintext block
    
15.    Output values:        v[2]    64-bit ciphertext block
    
16. **********************************************************/
    
17. 
    
18. void tean(word32 *k, word32 *v, long N) {
    
19.   word32 y=v[0], z=v[1];
    
20.   word32 limit,sum=0;
    
21.   if(N>0) { /* ENCRYPT */
    
22.     limit=DELTA*N;
    
23.     while(sum!=limit) {
    
24.       y+=((z<<4)^(z>>5)) + (z^sum) + k[sum&3];
    
25.       sum+=DELTA;
    
26.       z+=((y<<4)^(y>>5)) + (y^sum) + k[(sum>>11)&3];
    
27.     }
    
28.   } else { /* DECRYPT */
    
29.     sum=DELTA*(-N);
    
30.     while(sum) {
    
31.       z-=((y<<4)^(y>>5)) + (y^sum) + k[(sum>>11)&3];
    
32.       sum-=DELTA;
    
33.       y-=((z<<4)^(z>>5)) + (z^sum) + k[sum&3];
    
34.     }
    
35.   }
    
36.   v[0]=y; v[1]=z;
    
37. }
    
38. 
    
39. void cl_enc_block(word32 *k, word32 *v) {
    
40. tean(k,v,ROUNDS);
    
41. }
    
42. 
    
43. void cl_dec_block(word32 *k, word32 *v) {
    
44. tean(k,v,-ROUNDS);
    
45. }
    

复制代码

Mr.Guo

这是加密算法？？？长见识了 。。。。楼主记得问题解决后整理发帖。。。谢谢！！