poly1305_arm.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307
  1. /* Copyright (c) 2014, Google Inc.
  2. *
  3. * Permission to use, copy, modify, and/or distribute this software for any
  4. * purpose with or without fee is hereby granted, provided that the above
  5. * copyright notice and this permission notice appear in all copies.
  6. *
  7. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  8. * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  9. * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  10. * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  11. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
  12. * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
  13. * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
  14. // This implementation was taken from the public domain, neon2 version in
  15. // SUPERCOP by D. J. Bernstein and Peter Schwabe.
  16. #include <GFp/poly1305.h>
  17. #include "internal.h"
  18. #include "../internal.h"
  19. #if defined(OPENSSL_POLY1305_NEON)
  20. #pragma GCC diagnostic ignored "-Wsign-conversion"
  21. #pragma GCC diagnostic ignored "-Wcast-align"
  22. typedef struct {
  23. uint32_t v[12]; // for alignment; only using 10
  24. } fe1305x2;
  25. #define addmulmod GFp_poly1305_neon2_addmulmod
  26. #define blocks GFp_poly1305_neon2_blocks
  27. extern void addmulmod(fe1305x2 *r, const fe1305x2 *x, const fe1305x2 *y,
  28. const fe1305x2 *c);
  29. extern int blocks(fe1305x2 *h, const fe1305x2 *precomp, const uint8_t *in,
  30. size_t inlen);
  31. static void freeze(fe1305x2 *r) {
  32. int i;
  33. uint32_t x0 = r->v[0];
  34. uint32_t x1 = r->v[2];
  35. uint32_t x2 = r->v[4];
  36. uint32_t x3 = r->v[6];
  37. uint32_t x4 = r->v[8];
  38. uint32_t y0;
  39. uint32_t y1;
  40. uint32_t y2;
  41. uint32_t y3;
  42. uint32_t y4;
  43. uint32_t swap;
  44. for (i = 0; i < 3; ++i) {
  45. x1 += x0 >> 26;
  46. x0 &= 0x3ffffff;
  47. x2 += x1 >> 26;
  48. x1 &= 0x3ffffff;
  49. x3 += x2 >> 26;
  50. x2 &= 0x3ffffff;
  51. x4 += x3 >> 26;
  52. x3 &= 0x3ffffff;
  53. x0 += 5 * (x4 >> 26);
  54. x4 &= 0x3ffffff;
  55. }
  56. y0 = x0 + 5;
  57. y1 = x1 + (y0 >> 26);
  58. y0 &= 0x3ffffff;
  59. y2 = x2 + (y1 >> 26);
  60. y1 &= 0x3ffffff;
  61. y3 = x3 + (y2 >> 26);
  62. y2 &= 0x3ffffff;
  63. y4 = x4 + (y3 >> 26);
  64. y3 &= 0x3ffffff;
  65. swap = -(y4 >> 26);
  66. y4 &= 0x3ffffff;
  67. y0 ^= x0;
  68. y1 ^= x1;
  69. y2 ^= x2;
  70. y3 ^= x3;
  71. y4 ^= x4;
  72. y0 &= swap;
  73. y1 &= swap;
  74. y2 &= swap;
  75. y3 &= swap;
  76. y4 &= swap;
  77. y0 ^= x0;
  78. y1 ^= x1;
  79. y2 ^= x2;
  80. y3 ^= x3;
  81. y4 ^= x4;
  82. r->v[0] = y0;
  83. r->v[2] = y1;
  84. r->v[4] = y2;
  85. r->v[6] = y3;
  86. r->v[8] = y4;
  87. }
  88. static void store32(uint8_t out[4], uint32_t v) { GFp_memcpy(out, &v, 4); }
  89. // load32 exists to avoid breaking strict aliasing rules in
  90. // fe1305x2_frombytearray.
  91. static uint32_t load32(const uint8_t t[4]) {
  92. uint32_t tmp;
  93. GFp_memcpy(&tmp, t, sizeof(tmp));
  94. return tmp;
  95. }
  96. static void fe1305x2_tobytearray(uint8_t r[16], fe1305x2 *x) {
  97. uint32_t x0 = x->v[0];
  98. uint32_t x1 = x->v[2];
  99. uint32_t x2 = x->v[4];
  100. uint32_t x3 = x->v[6];
  101. uint32_t x4 = x->v[8];
  102. x1 += x0 >> 26;
  103. x0 &= 0x3ffffff;
  104. x2 += x1 >> 26;
  105. x1 &= 0x3ffffff;
  106. x3 += x2 >> 26;
  107. x2 &= 0x3ffffff;
  108. x4 += x3 >> 26;
  109. x3 &= 0x3ffffff;
  110. store32(r, x0 + (x1 << 26));
  111. store32(r + 4, (x1 >> 6) + (x2 << 20));
  112. store32(r + 8, (x2 >> 12) + (x3 << 14));
  113. store32(r + 12, (x3 >> 18) + (x4 << 8));
  114. }
  115. static void fe1305x2_frombytearray(fe1305x2 *r, const uint8_t *x, size_t xlen) {
  116. size_t i;
  117. uint8_t t[17];
  118. for (i = 0; (i < 16) && (i < xlen); i++) {
  119. t[i] = x[i];
  120. }
  121. xlen -= i;
  122. x += i;
  123. t[i++] = 1;
  124. for (; i < 17; i++) {
  125. t[i] = 0;
  126. }
  127. r->v[0] = 0x3ffffff & load32(t);
  128. r->v[2] = 0x3ffffff & (load32(t + 3) >> 2);
  129. r->v[4] = 0x3ffffff & (load32(t + 6) >> 4);
  130. r->v[6] = 0x3ffffff & (load32(t + 9) >> 6);
  131. r->v[8] = load32(t + 13);
  132. if (xlen) {
  133. for (i = 0; (i < 16) && (i < xlen); i++) {
  134. t[i] = x[i];
  135. }
  136. t[i++] = 1;
  137. for (; i < 17; i++) {
  138. t[i] = 0;
  139. }
  140. r->v[1] = 0x3ffffff & load32(t);
  141. r->v[3] = 0x3ffffff & (load32(t + 3) >> 2);
  142. r->v[5] = 0x3ffffff & (load32(t + 6) >> 4);
  143. r->v[7] = 0x3ffffff & (load32(t + 9) >> 6);
  144. r->v[9] = load32(t + 13);
  145. } else {
  146. r->v[1] = r->v[3] = r->v[5] = r->v[7] = r->v[9] = 0;
  147. }
  148. }
  149. static const alignas(16) fe1305x2 zero;
  150. struct poly1305_state_st {
  151. uint8_t data[sizeof(fe1305x2[5]) + 128];
  152. uint8_t buf[32];
  153. size_t buf_used;
  154. uint8_t key[16];
  155. };
  156. OPENSSL_STATIC_ASSERT(sizeof(struct poly1305_state_st) <= sizeof(poly1305_state),
  157. "poly1305_state isn't large enough to hold aligned poly1305_state_st");
  158. void GFp_poly1305_init_neon(poly1305_state *state, const uint8_t key[32]) {
  159. struct poly1305_state_st *st = (struct poly1305_state_st *)(state);
  160. fe1305x2 *const r = (fe1305x2 *)(st->data + (15 & (-(int)st->data)));
  161. fe1305x2 *const h = r + 1;
  162. fe1305x2 *const c = h + 1;
  163. fe1305x2 *const precomp = c + 1;
  164. r->v[1] = r->v[0] = 0x3ffffff & load32(key);
  165. r->v[3] = r->v[2] = 0x3ffff03 & (load32(key + 3) >> 2);
  166. r->v[5] = r->v[4] = 0x3ffc0ff & (load32(key + 6) >> 4);
  167. r->v[7] = r->v[6] = 0x3f03fff & (load32(key + 9) >> 6);
  168. r->v[9] = r->v[8] = 0x00fffff & (load32(key + 12) >> 8);
  169. for (size_t j = 0; j < 10; j++) {
  170. h->v[j] = 0; // XXX: should fast-forward a bit
  171. }
  172. addmulmod(precomp, r, r, &zero); // precompute r^2
  173. addmulmod(precomp + 1, precomp, precomp, &zero); // precompute r^4
  174. GFp_memcpy(st->key, key + 16, 16);
  175. st->buf_used = 0;
  176. }
  177. void GFp_poly1305_update_neon(poly1305_state *state, const uint8_t *in,
  178. size_t in_len) {
  179. struct poly1305_state_st *st = (struct poly1305_state_st *)(state);
  180. fe1305x2 *const r = (fe1305x2 *)(st->data + (15 & (-(int)st->data)));
  181. fe1305x2 *const h = r + 1;
  182. fe1305x2 *const c = h + 1;
  183. fe1305x2 *const precomp = c + 1;
  184. if (st->buf_used) {
  185. size_t todo = 32 - st->buf_used;
  186. if (todo > in_len) {
  187. todo = in_len;
  188. }
  189. for (size_t i = 0; i < todo; i++) {
  190. st->buf[st->buf_used + i] = in[i];
  191. }
  192. st->buf_used += todo;
  193. in_len -= todo;
  194. in += todo;
  195. if (st->buf_used == sizeof(st->buf) && in_len) {
  196. addmulmod(h, h, precomp, &zero);
  197. fe1305x2_frombytearray(c, st->buf, sizeof(st->buf));
  198. for (size_t i = 0; i < 10; i++) {
  199. h->v[i] += c->v[i];
  200. }
  201. st->buf_used = 0;
  202. }
  203. }
  204. while (in_len > 32) {
  205. size_t tlen = 1048576;
  206. if (in_len < tlen) {
  207. tlen = in_len;
  208. }
  209. tlen -= blocks(h, precomp, in, tlen);
  210. in_len -= tlen;
  211. in += tlen;
  212. }
  213. if (in_len) {
  214. for (size_t i = 0; i < in_len; i++) {
  215. st->buf[i] = in[i];
  216. }
  217. st->buf_used = in_len;
  218. }
  219. }
  220. void GFp_poly1305_finish_neon(poly1305_state *state, uint8_t mac[16]) {
  221. struct poly1305_state_st *st = (struct poly1305_state_st *)(state);
  222. fe1305x2 *const r = (fe1305x2 *)(st->data + (15 & (-(int)st->data)));
  223. fe1305x2 *const h = r + 1;
  224. fe1305x2 *const c = h + 1;
  225. fe1305x2 *const precomp = c + 1;
  226. addmulmod(h, h, precomp, &zero);
  227. if (st->buf_used > 16) {
  228. fe1305x2_frombytearray(c, st->buf, st->buf_used);
  229. precomp->v[1] = r->v[1];
  230. precomp->v[3] = r->v[3];
  231. precomp->v[5] = r->v[5];
  232. precomp->v[7] = r->v[7];
  233. precomp->v[9] = r->v[9];
  234. addmulmod(h, h, precomp, c);
  235. } else if (st->buf_used > 0) {
  236. fe1305x2_frombytearray(c, st->buf, st->buf_used);
  237. r->v[1] = 1;
  238. r->v[3] = 0;
  239. r->v[5] = 0;
  240. r->v[7] = 0;
  241. r->v[9] = 0;
  242. addmulmod(h, h, r, c);
  243. }
  244. h->v[0] += h->v[1];
  245. h->v[2] += h->v[3];
  246. h->v[4] += h->v[5];
  247. h->v[6] += h->v[7];
  248. h->v[8] += h->v[9];
  249. freeze(h);
  250. fe1305x2_frombytearray(c, st->key, 16);
  251. c->v[8] ^= (1 << 24);
  252. h->v[0] += c->v[0];
  253. h->v[2] += c->v[2];
  254. h->v[4] += c->v[4];
  255. h->v[6] += c->v[6];
  256. h->v[8] += c->v[8];
  257. fe1305x2_tobytearray(mac, h);
  258. }
  259. #endif // OPENSSL_POLY1305_NEON