참고문헌
- Mathematics of Computation v.61 A subexponential algorithm for discrete logarithms over all finite fields L. M. Adleman;Jonathan DeMarrais https://doi.org/10.2307/2152932
- Crypto'98, LNCS 1462 Optimal extension fields for fast arithmetic in public-key algorithms D. V. Bailey;Christof Paar
- Conference on The Mathematics of Public Key Cryptography Inversion in Optional Extension Fields D. V. Bailey;Christof Paar
-
Asiacrypt '96, LNCS 1163
A fast software implementation for arithmetic operations in
$GF(2^{t})$ E. De Win;A. Bosselaers;S. Vandenberghe;P. De Gersem;J. Vandewalle -
IEEE Trans. Computers
v.51
no.1
A new Hardware architecture for operations in
$GF(2^{m})$ C. H. Kim;S. Oh;J. Lim https://doi.org/10.1109/12.980019 - Eurocrypt '96 New modular multiplication algorithms for fast modular exponentiation S. M. Hong;S. Y. Oh;H. S. Yoon
- Handbook of applied cryptography A. J. Menezes;P. C. van Oorschot;S. A. Vanstone
- Applications of finite fields A. J. Menezes
- Mathematics of Computation v.44 Modular multiplication without trial division P. L. Montgomery https://doi.org/10.2307/2007970
- Contribution to IEEE P1363 Proposing the use of non-conventional basis of finite fields S. Oh;C. H. Kim
-
Information and Computation
v.78
A fast algorithm for computing multiplicative inverses in
$GF(2^{m})$ using normal bases T. Itoh;S. Tsujii https://doi.org/10.1016/0890-5401(88)90024-7