Abstract
XTR appeared in 2000 is a very promising alternative to elliptic curve cryptosystem. Though the basic idea behind XTR is very elegant and universal, one needs to restrict the primes p such as p ≡ 2 mod3 for optimal normal bases since it involves many multiplications in GF(p 2). Moreover the restriction p ≡ 2 mod3 is consistently used to improve the time complexity for irreducibility testing for XTR polynomials. In this paper, we propose that a Gaussian normal basis of type (2,k) for small k can also be used for efficient field arithmetic for XTR when p ≢ 2(mod 3). Furthermore we give a new algorithm for fast irreducibility testing and finding a generator of XTR group when p ≡ 1 mod 3. Also we present an explicit generator of XTR group which does not need any irreducibility testing when there is a Gaussian normal basis of type (2,3) in GF(p 2). We show that our algorithms are simple to implement and the time complexity of our methods are comparable to the best ones proposed so far.
Chapter PDF
Similar content being viewed by others
References
Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1–19. Springer, Heidelberg (2000)
Lenstra, A.K., Verheul, E.R.: Key improvements to XTR. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 220–233. Springer, Heidelberg (2000)
Lenstra, A.K., Verheul, E.R.: Fast irreducibility and subgroup membership testing in XTR. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 73–86. Springer, Heidelberg (2001)
Stam, M., Lenstra, A.K.: Speeding up XTR. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 125–143. Springer, Heidelberg (2001)
Stam, M., Lenstra, A.K.: Efficient subgroup exponentiation in quadratic and sixth degree extensions. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 318–332. Springer, Heidelberg (2003)
Bosma, W., Hutton, J., Verheul, E.R.: Looking beyond XTR. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 46–63. Springer, Heidelberg (2002)
Brouwer, A.E., Pellikaan, R., Verheul, E.R.: Doing more with fewer bits. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 321–332. Springer, Heidelberg (1999)
Verheul, E.R.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 195–210. Springer, Heidelberg (2001)
Gong, G., Harn, L.: Public key cryptosystems based on cubic finite field extensions. IEEE Trans. Information Theory 45, 2601–2605 (1999)
Gong, G., Harn, L., Wu, H.: The GH Public key cryptosystem. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 284–300. Springer, Heidelberg (2001)
Lim, S., Kim, S., Yie, I., Kim, J., Lee, H.: XTR extended to GF(p 6m). In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 301–312. Springer, Heidelberg (2001)
Kim, J., Yie, I., Oh, S., Kim, H., Ryu, J.: Fast generation of cubic irreducible polynomials for XTR. In: Pandu Rangan, C., Ding, C. (eds.) INDOCRYPT 2001. LNCS, vol. 2247, pp. 73–78. Springer, Heidelberg (2001)
Han, D., Yoon, K., Park, Y., Kim, C., Lim, J.: Optimal extension fields for XTR. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 369–384. Springer, Heidelberg (2003)
Li, W.W., Naslund, M., Shparlinski, I.: Hidden number problem with the trace and bit security of XTR and LUC. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 433–448. Springer, Heidelberg (2002)
Shparlinski, I.: On the generalized hidden number problem and bit security of XTR. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 268–277. Springer, Heidelberg (2001)
Menezes, A.J., Blake, I.F., Gao, S., Mullin, R.C., Vanstone, S.A., Yaghoobian, T.: Applications of Finite Fields. Kluwer Academic Publishers, Dordrecht (1993)
Gao, S., von zur Gathen, J., Panario, D.: Gauss periods and fast exponentiation in finite fields. In: Baeza-Yates, R., Poblete, P.V., Goles, E. (eds.) LATIN 1995. LNCS, vol. 911, pp. 311–322. Springer, Heidelberg (1995)
Knuth, D.E.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol. 2. Addison Wesley, Reading (1997)
Gordon, D.M.: A survey of fast exponentiation methods. J. of Algorithms 27, 129–146 (1998)
Feisel, S., von zur Gathen, J., Shokrollahi, M.: Normal bases via general Gauss periods. Math. Comp. 68, 271–290 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwon, S., Kim, C.H., Hong, C.P. (2004). Fast Irreducibility Testing for XTR Using a Gaussian Normal Basis of Low Complexity. In: Handschuh, H., Hasan, M.A. (eds) Selected Areas in Cryptography. SAC 2004. Lecture Notes in Computer Science, vol 3357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30564-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24327-4
Online ISBN: 978-3-540-30564-4
eBook Packages: Computer ScienceComputer Science (R0)