Lookup table based multiplication technique for GF(2m) with cryptographic significance

IEE Proceedings: Communications

Volumn 152, Issue 6, 2005, Pages 965-974

  Mahboob, A ^a   Ikram, N ^a  

^a NATIONAL UNIVERSITY OF SCIENCES AND TECHNOLOGY   (Pakistan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CRYPTOGRAPHY; POLYNOMIALS; PROBLEM SOLVING;

DISCRETE LOGARITHM PROBLEMS (DLP); ELLIPTIC CURVES; FINITE FIELD MULTIPLICATION; SOFTWARE ENVIRONMENTS;

TABLE LOOKUP;

EID: 29144468921     PISSN: 13502425     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1049/ip-com:20050022     Document Type: Conference Paper

References (16)

1. IEEE P1363. Standard specifications for public-key cryptography, 2000
2. m) using normal bases', Inf. Comput., 1988, 78, pp. 171-177
3. Schroeppel, R., Orman, H., Malley, S.O., and Spatscheck, O.: 'Fast key exchange with elliptic curve systems', Coppersmith, D. (Ed.) 'Advances in cryptology' CRYPTO 95, LNCS 963 (Springer-Verlag, pp. 43-56)
4. Blake, I., Smart, N., and Seroussi, G.: 'Elliptic curves in cryptography' (University Press, Cambridge, 1999)
5. NIST. Recommended elliptic curves for federal government use. Available from http://csrc.nist.gov/encryption 1999 May
6. SEC. Gec1: Recommended elliptic curve domain parameters. Available at http://www.secg.org
7. k)'. Des. Codes Crypto., 1998, 14, (1), pp. 57-69
8. Hasan, M.A.: 'Lookup table-based large finite field multiplication in memory constrained cryptosystems', IEEE Trans. Comput., 2000, 49, (7), pp. 749-758
9. Harper, G., Menezes, A., and Vanstone, S.: 'Public key cryptosystems with very small key lengths' (Springer-Verlag, 1992), pp. 163-173, (Proc. of Adv. Cryptol. Eurocrypt 92)
10. n)' (Springer-Verlag, 1996), pp. 65-76. (in Adv. in Cryptol. ASLACRYPT 96, LNCS 1163)
11. Hankerson, D., Hernandez, J.L., and Menezes, A.: 'Software implementation of elliptic curve cryptography over binary fields' (Springer-Verlag, 2000), (In CHES 2000, LNCS 1965)
12. m) arithmetic in software and its application to ecc'. In ACISP 2003, Wollongong, Australia, 9-11 July, 2003
13. 2m' (Spring-Verlag, 2000), pp. 203-212 (In Indocrypt 2000, LNCS 1977)
14. Han, Y., Leong, P.-C., Tan, P.-C., and Zhang, J.: 'Fast algorithms for elliptic curve cryptosystems over binary finite field' (Springer-Verlag, 1999), (In Adv. in Cryptol. Asiacrypt 1999)
15. Rosing, M.: 'Implementing elliptic curve cryptography' (Manning Publications, 1999)
16. Li, Z., Higgins, J., and Clement, M.: 'Performance of finite field arithmetic in an elliptic curve cryptosystem'. In Ninth Int. Symp. in Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS' 01) IEEE Computer Society, Washington, DC, USA, 15-18 August, 2001, p. 249