MD2.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156
  1. /*
  2. * md2.c : MD2 hash algorithm.
  3. *
  4. * Part of the Python Cryptography Toolkit
  5. *
  6. * Originally written by: A.M. Kuchling
  7. *
  8. * ===================================================================
  9. * The contents of this file are dedicated to the public domain. To
  10. * the extent that dedication to the public domain is not available,
  11. * everyone is granted a worldwide, perpetual, royalty-free,
  12. * non-exclusive license to exercise all rights associated with the
  13. * contents of this file for any purpose whatsoever.
  14. * No rights are reserved.
  15. *
  16. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  17. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  18. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  19. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  20. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  21. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  22. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  23. * SOFTWARE.
  24. * ===================================================================
  25. *
  26. */
  27. #include "common.h"
  28. FAKE_INIT(MD2)
  29. typedef struct {
  30. uint8_t C[16]; /** checksum **/
  31. uint8_t X[48];
  32. unsigned count;
  33. uint8_t buf[16];
  34. } hash_state;
  35. EXPORT_SYM int md2_init(hash_state **md2State)
  36. {
  37. hash_state *hs;
  38. if (NULL == md2State) {
  39. return ERR_NULL;
  40. }
  41. *md2State = hs = (hash_state*) calloc(1, sizeof(hash_state));
  42. if (NULL == hs)
  43. return ERR_MEMORY;
  44. return 0;
  45. }
  46. EXPORT_SYM int md2_destroy(hash_state *hs)
  47. {
  48. free(hs);
  49. return 0;
  50. }
  51. static const uint8_t S[256] = {
  52. 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6,
  53. 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188,
  54. 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24,
  55. 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251,
  56. 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63,
  57. 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50,
  58. 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165,
  59. 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210,
  60. 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,
  61. 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27,
  62. 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15,
  63. 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197,
  64. 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65,
  65. 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123,
  66. 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233,
  67. 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228,
  68. 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237,
  69. 31, 26, 219, 153, 141, 51, 159, 17, 131, 20
  70. };
  71. EXPORT_SYM int md2_copy(const hash_state *src, hash_state *dst)
  72. {
  73. if (NULL == src || NULL == dst) {
  74. return ERR_NULL;
  75. }
  76. *dst = *src;
  77. return 0;
  78. }
  79. EXPORT_SYM int md2_update(hash_state *hs, const uint8_t *buf, size_t len)
  80. {
  81. if (NULL == hs || NULL == buf)
  82. return ERR_NULL;
  83. while (len) {
  84. unsigned left, tc;
  85. left = 16 - hs->count; /** 1..16 **/
  86. tc = (unsigned)MIN(left, len);
  87. memcpy(hs->buf+hs->count, buf, tc);
  88. hs->count += tc;
  89. buf += tc;
  90. len -= tc;
  91. if (hs->count==16) {
  92. uint8_t L, t;
  93. unsigned j;
  94. hs->count = 0;
  95. L = hs->C[15];
  96. for(j=0; j<16; j++) {
  97. hs->X[16+j] = hs->buf[j];
  98. hs->X[32+j] = hs->X[16+j] ^ hs->X[j];
  99. /** Update checksum **/
  100. hs->C[j] ^= S[hs->buf[j] ^ L];
  101. L = hs->C[j];
  102. }
  103. t = 0;
  104. for(j=0; j<18; j++) {
  105. unsigned k;
  106. for(k=0; k<48; k++) {
  107. hs->X[k] ^= S[t];
  108. t = hs->X[k];
  109. }
  110. t = (t+j) & 0xFF;
  111. }
  112. }
  113. }
  114. return 0;
  115. }
  116. EXPORT_SYM int md2_digest(const hash_state *hs, uint8_t digest[16])
  117. {
  118. uint8_t padding[16];
  119. unsigned padlen, i;
  120. hash_state temp;
  121. assert(hs->count < 16);
  122. if (NULL==hs || digest==NULL)
  123. return ERR_NULL;
  124. temp = *hs;
  125. padlen = 16 - hs->count; /** 1..16 **/
  126. for(i=0; i<padlen; i++) {
  127. padding[i] = (uint8_t)padlen;
  128. }
  129. md2_update(&temp, padding, padlen);
  130. md2_update(&temp, temp.C, 16);
  131. memcpy(digest, temp.X, 16);
  132. return 0;
  133. }