Poly1305.cpp 2.7 KB

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