Du kannst nicht mehr als 25 Themen auswählen Themen müssen entweder mit einem Buchstaben oder einer Ziffer beginnen. Sie können Bindestriche („-“) enthalten und bis zu 35 Zeichen lang sein.
 
 
 

148 Zeilen
3.6 KiB

  1. /*
  2. This file is for Benes network related functions
  3. */
  4. #include "benes.h"
  5. #include "params.h"
  6. #include "transpose.h"
  7. #include "util.h"
  8. #include "vec.h"
  9. /* middle layers of the benes network */
  10. static void layer_in(uint64_t data[2][64], uint64_t *bits, int lgs) {
  11. int i, j, s;
  12. uint64_t d;
  13. s = 1 << lgs;
  14. for (i = 0; i < 64; i += s * 2) {
  15. for (j = i; j < i + s; j++) {
  16. d = (data[0][j + 0] ^ data[0][j + s]);
  17. d &= (*bits++);
  18. data[0][j + 0] ^= d;
  19. data[0][j + s] ^= d;
  20. d = (data[1][j + 0] ^ data[1][j + s]);
  21. d &= (*bits++);
  22. data[1][j + 0] ^= d;
  23. data[1][j + s] ^= d;
  24. }
  25. }
  26. }
  27. /* first and last layers of the benes network */
  28. static void layer_ex(uint64_t *data, uint64_t *bits, int lgs) {
  29. int i, j, s;
  30. uint64_t d;
  31. s = 1 << lgs;
  32. for (i = 0; i < 128; i += s * 2) {
  33. for (j = i; j < i + s; j++) {
  34. d = (data[j + 0] ^ data[j + s]);
  35. d &= (*bits++);
  36. data[j + 0] ^= d;
  37. data[j + s] ^= d;
  38. }
  39. }
  40. }
  41. /* input: r, sequence of bits to be permuted */
  42. /* bits, condition bits of the Benes network */
  43. /* rev, 0 for normal application; !0 for inverse */
  44. /* output: r, permuted bits */
  45. void PQCLEAN_MCELIECE6960119_VEC_benes(vec *r, const unsigned char *bits, int rev) {
  46. int i, iter, inc;
  47. const unsigned char *bits_ptr;
  48. uint64_t r_int_v[2][64];
  49. uint64_t r_int_h[2][64];
  50. uint64_t b_int_v[64];
  51. uint64_t b_int_h[64];
  52. //
  53. if (rev) {
  54. bits_ptr = bits + 12288;
  55. inc = -1024;
  56. } else {
  57. bits_ptr = bits;
  58. inc = 0;
  59. }
  60. for (i = 0; i < 64; i++) {
  61. r_int_v[0][i] = r[i * 2 + 0];
  62. r_int_v[1][i] = r[i * 2 + 1];
  63. }
  64. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(r_int_h[0], r_int_v[0]);
  65. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(r_int_h[1], r_int_v[1]);
  66. for (iter = 0; iter <= 6; iter++) {
  67. for (i = 0; i < 64; i++) {
  68. b_int_v[i] = PQCLEAN_MCELIECE6960119_VEC_load8(bits_ptr);
  69. bits_ptr += 8;
  70. }
  71. bits_ptr += inc;
  72. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(b_int_h, b_int_v);
  73. layer_ex(r_int_h[0], b_int_h, iter);
  74. }
  75. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(r_int_v[0], r_int_h[0]);
  76. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(r_int_v[1], r_int_h[1]);
  77. for (iter = 0; iter <= 5; iter++) {
  78. for (i = 0; i < 64; i++) {
  79. b_int_v[i] = PQCLEAN_MCELIECE6960119_VEC_load8(bits_ptr);
  80. bits_ptr += 8;
  81. }
  82. bits_ptr += inc;
  83. layer_in(r_int_v, b_int_v, iter);
  84. }
  85. for (iter = 4; iter >= 0; iter--) {
  86. for (i = 0; i < 64; i++) {
  87. b_int_v[i] = PQCLEAN_MCELIECE6960119_VEC_load8(bits_ptr);
  88. bits_ptr += 8;
  89. }
  90. bits_ptr += inc;
  91. layer_in(r_int_v, b_int_v, iter);
  92. }
  93. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(r_int_h[0], r_int_v[0]);
  94. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(r_int_h[1], r_int_v[1]);
  95. for (iter = 6; iter >= 0; iter--) {
  96. for (i = 0; i < 64; i++) {
  97. b_int_v[i] = PQCLEAN_MCELIECE6960119_VEC_load8(bits_ptr);
  98. bits_ptr += 8;
  99. }
  100. bits_ptr += inc;
  101. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(b_int_h, b_int_v);
  102. layer_ex(r_int_h[0], b_int_h, iter);
  103. }
  104. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(r_int_v[0], r_int_h[0]);
  105. PQCLEAN_MCELIECE6960119_VEC_transpose_64x64(r_int_v[1], r_int_h[1]);
  106. for (i = 0; i < 64; i++) {
  107. r[i * 2 + 0] = r_int_v[0][i];
  108. r[i * 2 + 1] = r_int_v[1][i];
  109. }
  110. }