共 35 条
- [24] Fast algorithms for elliptic curve cryptosystems over binary finite field ADVANCES IN CRYPTOLOGY - ASIACRYPT'99, PROCEEDINGS, 1999, 1716 : 75 - 85
- [25] Algorithms and the multiplicative complexity of the reduction a modulo arbitrary polynomial, generalized K-N-convolution and fast Vandermonde transform DSP 97: 1997 13TH INTERNATIONAL CONFERENCE ON DIGITAL SIGNAL PROCESSING PROCEEDINGS, VOLS 1 AND 2: SPECIAL SESSIONS, 1997, : 893 - 897
- [27] Implementing the multiplication of polynomial matrices over the field GF (2) by means of the fast Fourier transform DISCRETE MATHEMATICS AND APPLICATIONS, 2013, 23 (02): : 183 - 194