Publisher
Springer Science and Business Media LLC
Reference32 articles.
1. L. Batina, N. Mentens, S.B. Ors, B. Preneel, Serial multiplier architectures over GF($$2^m$$) for elliptic curve cryptosystems, in Proceedings of the$$12{th}$$IEEE Mediterranean Electrotechnical Conference (IEEE Cat. No. 04CH37521), vol. 2 (2004), pp. 779–782
2. T. Beth, D. Gollmann, Algorithm engineering for public key algorithms. IEEE J. Sel. Areas Commun. 7(4), 458–466 (1989)
3. M.A. García-Martínez, R. Posada-Gómez, G. Morales-Luna, F. Rodríguez-Henríquez, FPGA implementation of an efficient multiplier over finite fields GF ($$2^m$$), in 2005 International Conference on Reconfigurable Computing and FPGAs (ReConFig’05) (2005), pp. 5–26.https://doi.org/10.1109/RECONFIG.2005.18
4. J.-H. Guo, C.-L. Wang, Digit-serial systolic multiplier for finite fields GF($$2^m$$). IEE Proc.-Comput. Digit. Tech. 145(2), 143–148 (1998)
5. D. Hankerson, A.J. Menezes, S. Vanstone, Guide to Elliptic Curve Cryptography (Springer, Berlin, 2003)