|
|
|
|
ЛИТЕРАТУРА
|
|
| |
| 1. |
Coppersmith D., “Fast evaluation of logarithms in fields of characteristic two”, IEEE Trans. Inform. Theory, IT-30:4 (1984), 587–594    |
| 2. |
Montgomery P. L., “A block Lanczos algorithm for finding dependencies over $\mathrm{GF}(2)$”, EUROCRYPT' 95, LNCS, 921, 1995, 106–120 |
| 3. |
Coppersmith D., “Solving linear equations over $\mathrm{GF}(2)$ via block Wiedemann algorithm”, Math. Comp., 62:205 (1994), 333–350   |
| 4. |
Wiedemann D. H., “Solving sparse linear equations over finite fields”, IEEE Trans. Inform. Theory, IT-32:1 (1986), 54–62 |
| 5. |
Thomé E., “Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm”, J. Symbolic Comput., 33 (2002), 757–775 |
| 6. |
Ахо А., Хопкрофт Д., Ульман Дж., Построение и анализ вычислительных алгоритмов, Мир, М., 1979, 536 с. |
| 7. |
Beckerman B., Labahn G., “A uniform approach for the fast computation of matrix-type Padé approximants”, SIAM J. Matrix Anal. Appl., 15:3 (1994), 804–823 |
