Poly1305.cpp 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126
  1. /*
  2. 20080912
  3. D. J. Bernstein
  4. Public domain.
  5. */
  6. #include "Constants.hpp"
  7. #include "Poly1305.hpp"
  8. #ifdef __WINDOWS__
  9. #pragma warning(disable: 4146)
  10. #endif
  11. namespace ZeroTier {
  12. //////////////////////////////////////////////////////////////////////////////
  13. //////////////////////////////////////////////////////////////////////////////
  14. static void add(unsigned int h[17],const unsigned int c[17])
  15. {
  16. unsigned int j;
  17. unsigned int u;
  18. u = 0;
  19. for (j = 0;j < 17;++j) { u += h[j] + c[j]; h[j] = u & 255; u >>= 8; }
  20. }
  21. static void squeeze(unsigned int h[17])
  22. {
  23. unsigned int j;
  24. unsigned int u;
  25. u = 0;
  26. for (j = 0;j < 16;++j) { u += h[j]; h[j] = u & 255; u >>= 8; }
  27. u += h[16]; h[16] = u & 3;
  28. u = 5 * (u >> 2);
  29. for (j = 0;j < 16;++j) { u += h[j]; h[j] = u & 255; u >>= 8; }
  30. u += h[16]; h[16] = u;
  31. }
  32. static const unsigned int minusp[17] = {
  33. 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 252
  34. } ;
  35. static void freeze(unsigned int h[17])
  36. {
  37. unsigned int horig[17];
  38. unsigned int j;
  39. unsigned int negative;
  40. for (j = 0;j < 17;++j) horig[j] = h[j];
  41. add(h,minusp);
  42. negative = -(h[16] >> 7);
  43. for (j = 0;j < 17;++j) h[j] ^= negative & (horig[j] ^ h[j]);
  44. }
  45. static void mulmod(unsigned int h[17],const unsigned int r[17])
  46. {
  47. unsigned int hr[17];
  48. unsigned int i;
  49. unsigned int j;
  50. unsigned int u;
  51. for (i = 0;i < 17;++i) {
  52. u = 0;
  53. for (j = 0;j <= i;++j) u += h[j] * r[i - j];
  54. for (j = i + 1;j < 17;++j) u += 320 * h[j] * r[i + 17 - j];
  55. hr[i] = u;
  56. }
  57. for (i = 0;i < 17;++i) h[i] = hr[i];
  58. squeeze(h);
  59. }
  60. static inline int crypto_onetimeauth(unsigned char *out,const unsigned char *in,unsigned long long inlen,const unsigned char *k)
  61. {
  62. unsigned int j;
  63. unsigned int r[17];
  64. unsigned int h[17];
  65. unsigned int c[17];
  66. r[0] = k[0];
  67. r[1] = k[1];
  68. r[2] = k[2];
  69. r[3] = k[3] & 15;
  70. r[4] = k[4] & 252;
  71. r[5] = k[5];
  72. r[6] = k[6];
  73. r[7] = k[7] & 15;
  74. r[8] = k[8] & 252;
  75. r[9] = k[9];
  76. r[10] = k[10];
  77. r[11] = k[11] & 15;
  78. r[12] = k[12] & 252;
  79. r[13] = k[13];
  80. r[14] = k[14];
  81. r[15] = k[15] & 15;
  82. r[16] = 0;
  83. for (j = 0;j < 17;++j) h[j] = 0;
  84. while (inlen > 0) {
  85. for (j = 0;j < 17;++j) c[j] = 0;
  86. for (j = 0;(j < 16) && (j < inlen);++j) c[j] = in[j];
  87. c[j] = 1;
  88. in += j; inlen -= j;
  89. add(h,c);
  90. mulmod(h,r);
  91. }
  92. freeze(h);
  93. for (j = 0;j < 16;++j) c[j] = k[j + 16];
  94. c[16] = 0;
  95. add(h,c);
  96. for (j = 0;j < 16;++j) out[j] = h[j];
  97. return 0;
  98. }
  99. //////////////////////////////////////////////////////////////////////////////
  100. //////////////////////////////////////////////////////////////////////////////
  101. void Poly1305::compute(void *auth,const void *data,unsigned int len,const void *key)
  102. throw()
  103. {
  104. crypto_onetimeauth((unsigned char *)auth,(const unsigned char *)data,len,(const unsigned char *)key);
  105. }
  106. } // namespace ZeroTier