About the choice of the irreducible polynomials for the SEA algorithm
Автор: Babenko M.G., Chervaykov N.I.
Журнал: Инфокоммуникационные технологии @ikt-psuti
Рубрика: Теоретические основы технологий передачи и обработки информации и сигналов
Статья в выпуске: 4 т.8, 2010 года.
Бесплатный доступ
The SEA algorithm for fi nding the number of points of an elliptic curve defi ned over a prime fi eld is analyzed in the article. In the case of «prime Atkin» is proposed to construct quadratic fi elds, the authors recommend the use of irreducible binomials, which allow the most effi cient to implement arithmetic in quadratic Galois fi eld.
Elliptic curve, алгоритм sea, algorithm sea, modular polynomials, polynomials division, irreducible binomials, primitive elements of a quadratic galois fi eld, quadratic galois fi eld
Короткий адрес: https://sciup.org/140191430
IDR: 140191430
