You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

161 lines
4.8KB

  1. // SHA-1 code Copyright 2007 Michael Nidermayer <michaelni@gmx.at>
  2. // license LGPL
  3. // based on public domain SHA-1 code by Steve Reid <steve@edmweb.com>
  4. #include "common.h"
  5. #include "sha1.h"
  6. typedef struct AVSHA1 {
  7. uint64_t count;
  8. uint8_t buffer[64];
  9. uint32_t state[5];
  10. } AVSHA1;
  11. #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  12. /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
  13. #define blk0(i) (block[i] = be2me_32(((uint32_t*)buffer)[i]))
  14. #define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1))
  15. #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  16. #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk (i)+0x5A827999+rol(v,5);w=rol(w,30);
  17. #define R2(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
  18. #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
  19. #define R4(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  20. /* Hash a single 512-bit block. This is the core of the algorithm. */
  21. static void transform(uint32_t state[5], uint8_t buffer[64]){
  22. uint32_t block[80];
  23. unsigned int i, a, b, c, d, e;
  24. a = state[0];
  25. b = state[1];
  26. c = state[2];
  27. d = state[3];
  28. e = state[4];
  29. #ifdef CONFIG_SMALL
  30. for(i=0; i<80; i++){
  31. int t;
  32. if(i<16) t= be2me_32(((uint32_t*)buffer)[i]);
  33. else t= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1);
  34. block[i]= t;
  35. t+= e+rol(a,5);
  36. if(i<40){
  37. if(i<20) t+= ((b&(c^d))^d) +0x5A827999;
  38. else t+= ( b^c ^d) +0x6ED9EBA1;
  39. }else{
  40. if(i<60) t+= (((b|c)&d)|(b&c))+0x8F1BBCDC;
  41. else t+= ( b^c ^d) +0xCA62C1D6;
  42. }
  43. e= d;
  44. d= c;
  45. c= rol(b,30);
  46. b= a;
  47. a= t;
  48. }
  49. #else
  50. for(i=0; i<15; i+=5){
  51. R0(a,b,c,d,e,0+i); R0(e,a,b,c,d,1+i); R0(d,e,a,b,c,2+i); R0(c,d,e,a,b,3+i); R0(b,c,d,e,a,4+i);
  52. }
  53. R0(a,b,c,d,e,15); R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
  54. for(i=20; i<40; i+=5){
  55. R2(a,b,c,d,e,0+i); R2(e,a,b,c,d,1+i); R2(d,e,a,b,c,2+i); R2(c,d,e,a,b,3+i); R2(b,c,d,e,a,4+i);
  56. }
  57. for(; i<60; i+=5){
  58. R3(a,b,c,d,e,0+i); R3(e,a,b,c,d,1+i); R3(d,e,a,b,c,2+i); R3(c,d,e,a,b,3+i); R3(b,c,d,e,a,4+i);
  59. }
  60. for(; i<80; i+=5){
  61. R4(a,b,c,d,e,0+i); R4(e,a,b,c,d,1+i); R4(d,e,a,b,c,2+i); R4(c,d,e,a,b,3+i); R4(b,c,d,e,a,4+i);
  62. }
  63. #endif
  64. state[0] += a;
  65. state[1] += b;
  66. state[2] += c;
  67. state[3] += d;
  68. state[4] += e;
  69. }
  70. void av_sha1_init(AVSHA1* context){
  71. context->state[0] = 0x67452301;
  72. context->state[1] = 0xEFCDAB89;
  73. context->state[2] = 0x98BADCFE;
  74. context->state[3] = 0x10325476;
  75. context->state[4] = 0xC3D2E1F0;
  76. context->count = 0;
  77. }
  78. void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){
  79. unsigned int i, j;
  80. j = context->count & 63;
  81. context->count += len;
  82. #ifdef CONFIG_SMALL
  83. for( i = 0; i < len; i++ ){
  84. context->buffer[ j++ ] = data[i];
  85. if( 64 == j ){
  86. transform(context->state, context->buffer);
  87. j = 0;
  88. }
  89. }
  90. #else
  91. if ((j + len) > 63) {
  92. memcpy(&context->buffer[j], data, (i = 64-j));
  93. transform(context->state, context->buffer);
  94. for ( ; i + 63 < len; i += 64) {
  95. transform(context->state, &data[i]);
  96. }
  97. j=0;
  98. }
  99. else i = 0;
  100. memcpy(&context->buffer[j], &data[i], len - i);
  101. #endif
  102. }
  103. void av_sha1_final(AVSHA1* context, uint8_t digest[20]){
  104. int i;
  105. uint64_t finalcount= be2me_64(context->count<<3);
  106. av_sha1_update(context, "\200", 1);
  107. while ((context->count & 63) != 56) {
  108. av_sha1_update(context, "", 1);
  109. }
  110. av_sha1_update(context, &finalcount, 8); /* Should cause a transform() */
  111. for(i=0; i<5; i++)
  112. ((uint32_t*)digest)[i]= be2me_32(context->state[i]);
  113. }
  114. // use the following to test
  115. // gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1
  116. #ifdef TEST
  117. #include <stdio.h>
  118. #undef printf
  119. int main(){
  120. int i, k;
  121. AVSHA1 context;
  122. unsigned char digest[20];
  123. for(k=0; k<3; k++){
  124. av_sha1_init(&context);
  125. if(k==0)
  126. av_sha1_update(&context, "abc", 3);
  127. else if(k==1)
  128. av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
  129. else
  130. for(i=0; i<1000*1000; i++)
  131. av_sha1_update(&context, "a", 1);
  132. av_sha1_final(&context, digest);
  133. for (i = 0; i < 20; i++)
  134. printf("%02X", digest[i]);
  135. putchar('\n');
  136. }
  137. //Test Vectors (from FIPS PUB 180-1)
  138. printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
  139. "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
  140. "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");
  141. return 0;
  142. }
  143. #endif