An analysis of the vector decomposition problem

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

Volumn 4939 LNCS, Issue , 2008, Pages 308-327

  Galbraith, Steven D ^a   Verheul, Eric R ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Diffie Hellman problem; Elliptic curves; Generalised discrete logarithm problem; Vector decomposition problem

Indexed keywords

ALGEBRA; COBALT; COBALT COMPOUNDS; COMPUTATIONAL METHODS; COMPUTER PRIVACY; CURVES (ROAD); PUBLIC KEY CRYPTOGRAPHY; VECTORS;

(E ,2E) THEORY; COMPUTATIONAL PROBLEMS; CYCLIC GROUPS; DIFFIE-HELLMAN PROBLEM; DISCRETE LOGARITHM PROBLEM (DLP); ELLIPTIC CURVES (EC); HEIDELBERG (CO); INTERNATIONAL (CO); PUBLIC KEY (PK); PUBLIC KEY CRYPTOSYSTEMS (PKC); SPRINGER (CO);

CRYPTOGRAPHY;

EID: 40249088251     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78440-1_18     Document Type: Conference Paper

References (23)

1. Balasubramanian, R., Koblitz, N.: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. J. Cryptology 11(2), 141-145 (1998)
2. Bao, F., Deng, R.H., Zhu, H.: Variations of Diffie-Hellman Problem. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 301-312. Springer, Heidelberg (2003)
3. 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)
4. Blake, L, Seroussi, G., Smart, N.P. (eds.): Advances in elliptic curve cryptography. Cambridge University Press, Cambridge (2005)
5. Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. Journal of Cryptology 7, 297-319 (2004)
6. Brands, S.: An efficient off-line electronic cash system based on the representation problem, CWI Technical Report CS-R9323 (1993)
7. Charles, D.: On the existence of distortion maps on ordinary elliptic curves, arXiv:math/0603724 (2006)
8. Cohen, H., Frey, G. (eds.): Handbook of elliptic and hypereiliptic curve cryptography. CRC Press, Boca Raton (2006)
9. Duursma, I., Kiyavash, N.: The vector decomposition problem for elliptic and hypereiliptic curves. J. Ramanujan Math. Soc. 20(1), 59-76 (2005)
10. Duursma, I.M., Park, S.K.: ElGamal type signature schemes for n-dimensional vector spaces, eprint 2006/311
11. Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves (2006)
12. 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, 865-874 (1994)
13. Galbraith, S.D.: Supersingular curves in cryptography. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 495-513. Springer, Heidelberg (2001)
14. Galbraith, S.D., Rotger, V.: Easy decision Diffie-Hellman groups. LMS J. Comput. Math. 7, 201-218 (2004)
15. Maurer, U.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 271-281. Springer, Heidelberg (1994)
16. Maurer, U., Wolf, S.: The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM Journal on Computing 28(5), 1689-1721 (1999)
17. McKee, J.F., Pinch, R.G.E.: Further attacks on server-aided RSA cryptosystems, unpublished manuscript (1998)
18. Menezes, A. J.: Elliptic curve public key cryptosystems. Springer, Heidelberg (1993)
19. Silverman, J.FL: The arithmetic of elliptic curves. Springer, Heidelberg (1986)
20. Verheul, E.R.: Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems. J. Cryptology 17(4), 277-296 (2004)
21. Waterhouse, W.C.: Abelian varieties over finite fields. Annales Scientifiques de l'Ecole Normale Supérieure 4 (1969)
22. Yoshida, M., Mitsunari, S., Fujiwara, T.: Vector decomposition problem and the trapdoor inseparable multiplex transmission scheme based the problem. In: Proceedings of the 2003 Symposium on Cryptography and Information Security (SCIS), pp. 491-496 (2003)
23. Yoshida, M.: Inseparable multiplex transmission using the pairing on elliptic curves and its application to watermarking. In: Proc. Fifth Conference on Algebraic Geometry, Number Theory, Coding Theory and Cryptography, University of Tokyo (2003), http://www.math.uiuc.edu/~duursma/pub/yoshida_paper.pdf