Pairings on hyperelliptic curves with a real model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5209 LNCS, Issue , 2008, Pages 265-281

  Galbraith, Steven D ^a   Lin, Xibin ^a,b   Mireles Morales, David J ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

HYPERELLIPTIC CURVES; INTERNATIONAL CONFERENCES; OPTIMISATIONS; PAIRING-BASED CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 52149120956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85538-5_18     Document Type: Conference Paper

References (18)

1. Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354-368. Springer, Heidelberg (2002)
2. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3-4), 235-265 (1997)
3. Devegili, A.J., Ó'hÉigeartaigh, C., Scott, M., Dahab, R.: Multiplication and squaring on pairing-friendly fields (2006); Cryptology ePrint Archive: Report 2006/471
4. Erickson, S., Jacobson, M.J., Shang, N., Shen, S., Stein, A.: Explicit formulas for real hyperelliptic curves of genus 2 in affine representation. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 202-218. Springer, Heidelberg (2007)
5. Frey, G., R̈ck, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp. 62(206), 865-874 (1994)
6. Galbraith, S.D., Harrison, M., Mireles Morales, D.J.: Efficient hyperelliptic arithmetic using balanced representation for divisors. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol. 5011, pp. 342-356. Springer, Heidelberg (2008)
7. Galbraith, S.D., Pujolas, J., Ritzenthaler, C., Smith, B.: Distortion maps for genus two curves (2006); Arxiv/math.NT/0611471
8. Galbraith, S.D., Verheul, E.R.: An analysis of the vector decomposition problem. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 308-327. Springer, Heidelberg (2008)
9. Granger, R., Hess, F., Oyono, R., Thériault, N., Vercauteren, F.: Ate pairing on hyperelliptic curves. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 430-447. Springer, Heidelberg (2007)
10. Hess, F., Smart, N.P., Vercauteren, F.: The eta pairing revisited. IEEE Transactions on Information Theory 52(10), 4595-4602 (2006)
11. Hu, L., Dong, J.-W., Pei, D.: Implementation of cryptosystems based on tate pairing. J. Comput. Sci. Technol. 20(2), 264-269 (2005)
12. Lee, E., Lee, H.-S., and Park, C.-M. Efficient and generalized pairing computation on abelian varieties. Cryptology ePrint Archive, Report 2008/040 (2008), http://eprint.iacr.org/
13. 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)
14. Ó'hÉigeartaigh, C., Scott, M.: Pairing calculation on supersingular genus 2 curves. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol. 4356, pp. 302-316. Springer, Heidelberg (2007)
15. Paulus, S., Rück, H.-G.: Real and imaginary quadratic representations of hyperelliptic function fields. Math. Comp. 68(227), 1233-1241 (1999)
16. Granger, R., Page, D., Stam, M.: On small characteristic algebraic tori in pairing-based cryptography. LMS Journal of Computation and Mathematics 9, 64-85 (2006)
17. Rubin, K., Silverberg, A.: Torus-based cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 349-365. Springer, Heidelberg (2003)
18. 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)