Efficient Characteristic 3 Galois Field Operations for Elliptic Curve Cryptographic Applications

Vinay S. Iyengar

Abstract

Galois fields of characteristic 3, where the number of field elements is a power of 3, have a distinctive application in building high-security elliptic curve cryptosystems. However, they are not typically used because of their relative inefficiency in computing polynomial operations when compared to conventional prime or binary Galois fields. The purpose of this research was to design and implement characteristic 3 Galois field arithmetic algorithms with greater overall efficiency than those presented in current literature, and to evaluate their applicability to elliptic curve cryptography. The algorithms designed were tested in a C++ program and using a mapping of field element logarithms, were able to simplify the operations of polynomial multiplication, division, cubing, and modular reduction to that of basic integer operations. They thus significantly outperformed the best characteristic 3 algorithms presented in literature and showed a distinct applicability to elliptic curve cryptosystems. In conclusion, this research presents a novel method of optimizing the performance of characteristic 3 Galois fields and has major implications for the field of elliptic curve cryptography.

References

  1. Ahmadi, O., Hankerson, D., & Menezes, A. (2007). Software implementation of arithmetic in. Arithmetic of Finite Fields, 85-102.
  2. Barreto, P., Kim, H., Lynn, B., & Scott, M. (2002). Efficient algorithms for pairing-based cryptosystems. Advances in Cryptology-CRYPTO 2002, 354-369.
  3. Bernstein, D., & Lange, T. (2007). Faster addition and doubling on elliptic curves. Advances in Cryptology, 13, 29-50. Retrieved from http://cr.yp.to/newelliptic/ - 20070906.pdf
  4. Blake, I., Seroussi, G., & Smart, N. (1999). Elliptic curves in cryptography. (1st ed.). London: Cambridge University Press.
  5. Boneh, D., & Franklin, M. (2001). Identity-based encryption from the Weil pairing. In Advances in Cryptology-CRYPTO 2001 (pp. 213-229). Springer Berlin/Heidelberg.
  6. Das, A., & Madhavan, C. E. V. (2009). Public-key cryptography: theory and practice. (1st ed.). New Delhi: Dorling Kindersley.
  7. Galbraith, S. (2001). Supersingular curves in cryptography. Advances in Cryptology-ASIACRYPT 2001, 495-513.
  8. Hankerson, D., Menezes, A., & Vanstone, S. (2004). Guide to elliptic curve cryptography. (1st ed.). Springer.
  9. Harrison, K., Page, D., & Smart, N. P. (2002). Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems.LMS Journal of Computation and Mathematics, 5(1), 181-193.
  10. Iyengar, V. S. (2012). Novel elliptic curve scalar multiplication algorithms for faster and safer publickey cryptosystems. International Journal on Cryptography and Information Security, 2(3), 57-66. doi: 10.5121/ijcis.2012.2305
  11. Koblitz, N. (1994). A course in number theory and cryptography. (2 ed.). New York, NY: Springer
  12. Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of Computation, 48(177). 203-209. Retrieved from http://www.ams.org/ journals/mcom/1987-48-177/S0025-5718-1987- 0866109-5/S0025-5718-1987-0866109-5.pdf
  13. Lawson, N. (2009). Side-channel attacks. IEEE, 7(6), 65- 68. Retrieved from http://rootlabs.com/articles/ IEEE_SideChannelAttacks.pdf
  14. Lidl, R. and Niederreiter, H. Introduction to Finite Fields and Their Applications, rev. ed. Cambridge, England: Cambridge University Press, 1994.
  15. Lidl, R. and Niederreiter, H. (Eds.). Finite Fields, 2nd ed. Cambridge, England: Cambridge University Press, 1997.
  16. O'Connor, S.E. (2013) Primpoly (Version 11.0) [Computer Software] Available from: http://www. seanerikoconnor.freeservers.com/Mathematics/Abstrac tAlgebra/PrimitivePolynomials/overview.html
  17. Partow, A. (2006) Galois Field Arithmetic Library (Version 5.0) [Computer Software] Available from: http://www.partow.net/projects/galois/#GFALLice nse
  18. Silverman, J. H. (2006). A friendly introduction to number theory. (3rd ed., Vol. 3). Pearson Prentice Hall.
  19. What is diffie-hellman (n.d.). RSA Labs: PKCS, 7, Retrieved from http://www.rsa.com/rsalabs/ node.asp?id=2248
  20. (2012). Edwards Curve. Wikipedia, the free encyclopedia, Retrieved from http://en.wikipedia.org/wiki/ File:Edward-curves.svg
Download


Paper Citation


in Harvard Style

S. Iyengar V. (2013). Efficient Characteristic 3 Galois Field Operations for Elliptic Curve Cryptographic Applications . In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 531-536. DOI: 10.5220/0004528105310536


in Bibtex Style

@conference{secrypt13,
author={Vinay S. Iyengar},
title={Efficient Characteristic 3 Galois Field Operations for Elliptic Curve Cryptographic Applications},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={531-536},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004528105310536},
isbn={978-989-8565-73-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - Efficient Characteristic 3 Galois Field Operations for Elliptic Curve Cryptographic Applications
SN - 978-989-8565-73-0
AU - S. Iyengar V.
PY - 2013
SP - 531
EP - 536
DO - 10.5220/0004528105310536