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.
 
 
 

262 line
9.5 KiB

  1. #include "poly.h"
  2. #include "cbd.h"
  3. #include "fips202.h"
  4. #include "ntt.h"
  5. #include "polyvec.h"
  6. #include "reduce.h"
  7. #include <stdio.h>
  8. /*************************************************
  9. * Name: poly_compress
  10. *
  11. * Description: Compression and subsequent serialization of a polynomial
  12. *
  13. * Arguments: - unsigned char *r: pointer to output byte array
  14. * - const poly *a: pointer to input polynomial
  15. **************************************************/
  16. void PQCLEAN_KYBER768_poly_compress(unsigned char *r, const poly *a) {
  17. uint32_t t[8];
  18. unsigned int i, j, k = 0;
  19. for (i = 0; i < KYBER_N; i += 8) {
  20. for (j = 0; j < 8; j++) {
  21. t[j] = (((PQCLEAN_KYBER768_freeze(a->coeffs[i + j]) << 3) +
  22. KYBER_Q / 2) /
  23. KYBER_Q) &
  24. 7;
  25. }
  26. r[k] = t[0] | (t[1] << 3) | (t[2] << 6);
  27. r[k + 1] = (t[2] >> 2) | (t[3] << 1) | (t[4] << 4) | (t[5] << 7);
  28. r[k + 2] = (t[5] >> 1) | (t[6] << 2) | (t[7] << 5);
  29. k += 3;
  30. }
  31. }
  32. /*************************************************
  33. * Name: poly_decompress
  34. *
  35. * Description: De-serialization and subsequent decompression of a polynomial;
  36. * approximate inverse of poly_compress
  37. *
  38. * Arguments: - poly *r: pointer to output polynomial
  39. * - const unsigned char *a: pointer to input byte array
  40. **************************************************/
  41. void PQCLEAN_KYBER768_poly_decompress(poly *r, const unsigned char *a) {
  42. unsigned int i;
  43. for (i = 0; i < KYBER_N; i += 8) {
  44. r->coeffs[i + 0] = (((a[0] & 7) * KYBER_Q) + 4) >> 3;
  45. r->coeffs[i + 1] = ((((a[0] >> 3) & 7) * KYBER_Q) + 4) >> 3;
  46. r->coeffs[i + 2] =
  47. ((((a[0] >> 6) | ((a[1] << 2) & 4)) * KYBER_Q) + 4) >> 3;
  48. r->coeffs[i + 3] = ((((a[1] >> 1) & 7) * KYBER_Q) + 4) >> 3;
  49. r->coeffs[i + 4] = ((((a[1] >> 4) & 7) * KYBER_Q) + 4) >> 3;
  50. r->coeffs[i + 5] =
  51. ((((a[1] >> 7) | ((a[2] << 1) & 6)) * KYBER_Q) + 4) >> 3;
  52. r->coeffs[i + 6] = ((((a[2] >> 2) & 7) * KYBER_Q) + 4) >> 3;
  53. r->coeffs[i + 7] = ((((a[2] >> 5)) * KYBER_Q) + 4) >> 3;
  54. a += 3;
  55. }
  56. }
  57. /*************************************************
  58. * Name: poly_tobytes
  59. *
  60. * Description: Serialization of a polynomial
  61. *
  62. * Arguments: - unsigned char *r: pointer to output byte array
  63. * - const poly *a: pointer to input polynomial
  64. **************************************************/
  65. void PQCLEAN_KYBER768_poly_tobytes(unsigned char *r, const poly *a) {
  66. int i, j;
  67. uint16_t t[8];
  68. for (i = 0; i < KYBER_N / 8; i++) {
  69. for (j = 0; j < 8; j++) {
  70. t[j] = PQCLEAN_KYBER768_freeze(a->coeffs[8 * i + j]);
  71. }
  72. r[13 * i + 0] = t[0] & 0xff;
  73. r[13 * i + 1] = (t[0] >> 8) | ((t[1] & 0x07) << 5);
  74. r[13 * i + 2] = (t[1] >> 3) & 0xff;
  75. r[13 * i + 3] = (t[1] >> 11) | ((t[2] & 0x3f) << 2);
  76. r[13 * i + 4] = (t[2] >> 6) | ((t[3] & 0x01) << 7);
  77. r[13 * i + 5] = (t[3] >> 1) & 0xff;
  78. r[13 * i + 6] = (t[3] >> 9) | ((t[4] & 0x0f) << 4);
  79. r[13 * i + 7] = (t[4] >> 4) & 0xff;
  80. r[13 * i + 8] = (t[4] >> 12) | ((t[5] & 0x7f) << 1);
  81. r[13 * i + 9] = (t[5] >> 7) | ((t[6] & 0x03) << 6);
  82. r[13 * i + 10] = (t[6] >> 2) & 0xff;
  83. r[13 * i + 11] = (t[6] >> 10) | ((t[7] & 0x1f) << 3);
  84. r[13 * i + 12] = (t[7] >> 5);
  85. }
  86. }
  87. /*************************************************
  88. * Name: poly_frombytes
  89. *
  90. * Description: De-serialization of a polynomial;
  91. * inverse of poly_tobytes
  92. *
  93. * Arguments: - poly *r: pointer to output polynomial
  94. * - const unsigned char *a: pointer to input byte array
  95. **************************************************/
  96. void PQCLEAN_KYBER768_poly_frombytes(poly *r, const unsigned char *a) {
  97. int i;
  98. for (i = 0; i < KYBER_N / 8; i++) {
  99. r->coeffs[8 * i + 0] =
  100. a[13 * i + 0] | (((uint16_t)a[13 * i + 1] & 0x1f) << 8);
  101. r->coeffs[8 * i + 1] = (a[13 * i + 1] >> 5) |
  102. (((uint16_t)a[13 * i + 2]) << 3) |
  103. (((uint16_t)a[13 * i + 3] & 0x03) << 11);
  104. r->coeffs[8 * i + 2] =
  105. (a[13 * i + 3] >> 2) | (((uint16_t)a[13 * i + 4] & 0x7f) << 6);
  106. r->coeffs[8 * i + 3] = (a[13 * i + 4] >> 7) |
  107. (((uint16_t)a[13 * i + 5]) << 1) |
  108. (((uint16_t)a[13 * i + 6] & 0x0f) << 9);
  109. r->coeffs[8 * i + 4] = (a[13 * i + 6] >> 4) |
  110. (((uint16_t)a[13 * i + 7]) << 4) |
  111. (((uint16_t)a[13 * i + 8] & 0x01) << 12);
  112. r->coeffs[8 * i + 5] =
  113. (a[13 * i + 8] >> 1) | (((uint16_t)a[13 * i + 9] & 0x3f) << 7);
  114. r->coeffs[8 * i + 6] = (a[13 * i + 9] >> 6) |
  115. (((uint16_t)a[13 * i + 10]) << 2) |
  116. (((uint16_t)a[13 * i + 11] & 0x07) << 10);
  117. r->coeffs[8 * i + 7] =
  118. (a[13 * i + 11] >> 3) | (((uint16_t)a[13 * i + 12]) << 5);
  119. }
  120. }
  121. /*************************************************
  122. * Name: poly_getnoise
  123. *
  124. * Description: Sample a polynomial deterministically from a seed and a nonce,
  125. * with output polynomial close to centered binomial distribution
  126. * with parameter KYBER_ETA
  127. *
  128. * Arguments: - poly *r: pointer to output polynomial
  129. * - const unsigned char *seed: pointer to input seed
  130. * - unsigned char nonce: one-byte input nonce
  131. **************************************************/
  132. void PQCLEAN_KYBER768_poly_getnoise(poly *r, const unsigned char *seed,
  133. unsigned char nonce) {
  134. unsigned char buf[KYBER_ETA * KYBER_N / 4];
  135. unsigned char extseed[KYBER_SYMBYTES + 1];
  136. int i;
  137. for (i = 0; i < KYBER_SYMBYTES; i++) {
  138. extseed[i] = seed[i];
  139. }
  140. extseed[KYBER_SYMBYTES] = nonce;
  141. shake256(buf, KYBER_ETA * KYBER_N / 4, extseed, KYBER_SYMBYTES + 1);
  142. PQCLEAN_KYBER768_cbd(r, buf);
  143. }
  144. /*************************************************
  145. * Name: poly_ntt
  146. *
  147. * Description: Computes negacyclic number-theoretic transform (NTT) of
  148. * a polynomial in place;
  149. * inputs assumed to be in normal order, output in bitreversed
  150. *order
  151. *
  152. * Arguments: - uint16_t *r: pointer to in/output polynomial
  153. **************************************************/
  154. void PQCLEAN_KYBER768_poly_ntt(poly *r) {
  155. PQCLEAN_KYBER768_ntt(r->coeffs);
  156. }
  157. /*************************************************
  158. * Name: poly_invntt
  159. *
  160. * Description: Computes inverse of negacyclic number-theoretic transform (NTT)
  161. *of a polynomial in place; inputs assumed to be in bitreversed order, output in
  162. *normal order
  163. *
  164. * Arguments: - uint16_t *a: pointer to in/output polynomial
  165. **************************************************/
  166. void PQCLEAN_KYBER768_poly_invntt(poly *r) {
  167. PQCLEAN_KYBER768_invntt(r->coeffs);
  168. }
  169. /*************************************************
  170. * Name: poly_add
  171. *
  172. * Description: Add two polynomials
  173. *
  174. * Arguments: - poly *r: pointer to output polynomial
  175. * - const poly *a: pointer to first input polynomial
  176. * - const poly *b: pointer to second input polynomial
  177. **************************************************/
  178. void PQCLEAN_KYBER768_poly_add(poly *r, const poly *a, const poly *b) {
  179. int i;
  180. for (i = 0; i < KYBER_N; i++) {
  181. r->coeffs[i] =
  182. PQCLEAN_KYBER768_barrett_reduce(a->coeffs[i] + b->coeffs[i]);
  183. }
  184. }
  185. /*************************************************
  186. * Name: poly_sub
  187. *
  188. * Description: Subtract two polynomials
  189. *
  190. * Arguments: - poly *r: pointer to output polynomial
  191. * - const poly *a: pointer to first input polynomial
  192. * - const poly *b: pointer to second input polynomial
  193. **************************************************/
  194. void PQCLEAN_KYBER768_poly_sub(poly *r, const poly *a, const poly *b) {
  195. int i;
  196. for (i = 0; i < KYBER_N; i++) {
  197. r->coeffs[i] = PQCLEAN_KYBER768_barrett_reduce(
  198. a->coeffs[i] + 3 * KYBER_Q - b->coeffs[i]);
  199. }
  200. }
  201. /*************************************************
  202. * Name: poly_frommsg
  203. *
  204. * Description: Convert 32-byte message to polynomial
  205. *
  206. * Arguments: - poly *r: pointer to output polynomial
  207. * - const unsigned char *msg: pointer to input message
  208. **************************************************/
  209. void PQCLEAN_KYBER768_poly_frommsg(poly *r,
  210. const unsigned char msg[KYBER_SYMBYTES]) {
  211. uint16_t i, j, mask;
  212. for (i = 0; i < KYBER_SYMBYTES; i++) {
  213. for (j = 0; j < 8; j++) {
  214. mask = -((msg[i] >> j) & 1);
  215. r->coeffs[8 * i + j] = mask & ((KYBER_Q + 1) / 2);
  216. }
  217. }
  218. }
  219. /*************************************************
  220. * Name: poly_tomsg
  221. *
  222. * Description: Convert polynomial to 32-byte message
  223. *
  224. * Arguments: - unsigned char *msg: pointer to output message
  225. * - const poly *a: pointer to input polynomial
  226. **************************************************/
  227. void PQCLEAN_KYBER768_poly_tomsg(unsigned char msg[KYBER_SYMBYTES],
  228. const poly *a) {
  229. uint16_t t;
  230. int i, j;
  231. for (i = 0; i < KYBER_SYMBYTES; i++) {
  232. msg[i] = 0;
  233. for (j = 0; j < 8; j++) {
  234. t = (((PQCLEAN_KYBER768_freeze(a->coeffs[8 * i + j]) << 1) +
  235. KYBER_Q / 2) /
  236. KYBER_Q) &
  237. 1;
  238. msg[i] |= t << j;
  239. }
  240. }
  241. }