| anz_dft | polynomial::CDFT_chinrem | [protected] |
| calc_field_and_roots_and_inverse() | polynomial::CDFT_chinrem | [private] |
| calc_max_size(const unsigned int x_size) | polynomial::CDFT_base0 | [inline, static] |
| CDFT_base0(const unsigned int x_size) | polynomial::CDFT_base0 | [inline, explicit] |
| CDFT_chinrem(const unsigned int x_size, const mpz_t x_N) | polynomial::CDFT_chinrem | [inline] |
| create_nodes(tnode &node, int &count, int depth=1) | polynomial::CDFT_chinrem | [protected] |
| delete_nodes(tnode &node) | polynomial::CDFT_chinrem | [protected] |
| dft | polynomial::CDFT_chinrem | [protected] |
| get_N(void) const | polynomial::CDFT_chinrem | [inline] |
| internal_mul(const TPolynom R, const int kR, const TconstPolynom P1, const int k1, const TconstPolynom P2, const int k2, const bool reduce_result_modN) | polynomial::CDFT_chinrem | [protected] |
| max_size | polynomial::CDFT_base0 | |
| Ms | polynomial::CDFT_chinrem | [protected] |
| mul(const TPolynom R, const int kR, const TconstPolynom P1, const int k1, const TconstPolynom P2, const int k2) | polynomial::CDFT_chinrem | [inline] |
| mulmod(const TPolynom R, const int kR, const TconstPolynom P1, const int k1, const TconstPolynom P2, const int k2) | polynomial::CDFT_chinrem | [inline] |
| N | polynomial::CDFT_chinrem | [private] |
| recurse_dftmul(tnode &node, const TPolynom R, const int kR, const TconstPolynom P1, const int k1, const TconstPolynom P2, const int k2) | polynomial::CDFT_chinrem | [protected] |
| root_node | polynomial::CDFT_chinrem | [protected] |
| square(const TPolynom R, const int kR, const TconstPolynom P, const int k) | polynomial::CDFT_chinrem | [inline] |
| squaremod(const TPolynom R, const int kR, const TconstPolynom P, const int k) | polynomial::CDFT_chinrem | [inline] |
| use_size(const unsigned int input_size) const | polynomial::CDFT_base0 | [inline] |
| ~CDFT_chinrem() | polynomial::CDFT_chinrem | [inline, virtual] |