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.
 
 
 
 
 

69 lines
1.9 KiB

  1. /* Copyright (c) 2014-2016 Cryptography Research, Inc.
  2. * Released under the MIT License. See LICENSE.txt for license information.
  3. */
  4. void gf_add_RAW (gf out, const gf a, const gf b) {
  5. for (unsigned int i=0; i<sizeof(*out)/sizeof(uint64xn_t); i++) {
  6. ((uint64xn_t*)out)[i] = ((const uint64xn_t*)a)[i] + ((const uint64xn_t*)b)[i];
  7. }
  8. /*
  9. unsigned int i;
  10. for (i=0; i<sizeof(*out)/sizeof(out->limb[0]); i++) {
  11. out->limb[i] = a->limb[i] + b->limb[i];
  12. }
  13. */
  14. }
  15. void gf_sub_RAW (gf out, const gf a, const gf b) {
  16. for (unsigned int i=0; i<sizeof(*out)/sizeof(uint64xn_t); i++) {
  17. ((uint64xn_t*)out)[i] = ((const uint64xn_t*)a)[i] - ((const uint64xn_t*)b)[i];
  18. }
  19. /*
  20. unsigned int i;
  21. for (i=0; i<sizeof(*out)/sizeof(out->limb[0]); i++) {
  22. out->limb[i] = a->limb[i] - b->limb[i];
  23. }
  24. */
  25. }
  26. void gf_copy (gf out, const gf a) {
  27. for (unsigned int i=0; i<sizeof(*out)/sizeof(big_register_t); i++) {
  28. ((big_register_t *)out)[i] = ((const big_register_t *)a)[i];
  29. }
  30. }
  31. void gf_bias (
  32. gf a, int amt
  33. ) {
  34. uint64_t co1 = ((1ull<<60)-1)*amt, co2 = co1-amt;
  35. #if __AVX2__
  36. uint64x4_t lo = {co1,co1,co1,co1}, hi = {co2,co1,co1,co1};
  37. uint64x4_t *aa = (uint64x4_t*) a;
  38. aa[0] += lo;
  39. aa[1] += hi;
  40. #elif __SSE2__
  41. uint64x2_t lo = {co1,co1}, hi = {co2,co1};
  42. uint64x2_t *aa = (uint64x2_t*) a;
  43. aa[0] += lo;
  44. aa[1] += lo;
  45. aa[2] += hi;
  46. aa[3] += lo;
  47. #else
  48. for (unsigned int i=0; i<sizeof(*a)/sizeof(uint64_t); i++) {
  49. a->limb[i] += (i==4) ? co2 : co1;
  50. }
  51. #endif
  52. }
  53. void gf_weak_reduce (gf a) {
  54. /* PERF: use pshufb/palignr if anyone cares about speed of this */
  55. uint64_t mask = (1ull<<60) - 1;
  56. uint64_t tmp = a->limb[7] >> 60;
  57. a->limb[4] += tmp;
  58. for (unsigned int i=7; i>0; i--) {
  59. a->limb[i] = (a->limb[i] & mask) + (a->limb[i-1]>>60);
  60. }
  61. a->limb[0] = (a->limb[0] & mask) + tmp;
  62. }