* @brief Converts a number into the Montgomery domain. * @param a A standard number. * @return The number in Montgomery form (a * R mod N). */

* @brief Adds two 512-bit numbers. res = a + b. */

Berlekamp–Massey algorithm: given syndromes, compute the error locator polynomial σ(x). The returned polynomial is of the form σ(x) = 1 + σ₁x + … + σₜ

Compute the error evaluator polynomial Ω(x) = [σ(x) * S(x)] mod x^(2t), where S(x) is the syndrome polynomial.

Computes the evaluations of the round polynomial `s_i(c)` for `c` in `{0, 1, ..., d}`.

Computes the evaluations of the round polynomial `s_i(c)` for `c` in `{0, 1, ..., d}`.

Correct errors in a received codeword (with unknown errors) using syndrome computation, the Berlekamp–Massey algorithm, and Forney’s formula. Returns

Corresponds to the `eval_folded_poly` CUDA kernel. Evaluates a partially folded polynomial at a specific point for the current variable. The evaluati

Find error locations by searching for roots of σ(x). In our RS code the error locator polynomial is defined so that if an error occurred at position

Corresponds to the `fold_into_half` CUDA kernel. Performs one round of folding by binding the current variable to a challenge. The update rule is `p'

* @brief Multiplies two numbers that are already in the Montgomery domain. * @param a_mont A number in Montgomery form (a * R mod N). * @param b_mon