Biblio KOHEL David

Institut de Mathématiques de Luminy

BIBLIOGRAPHIE - David KOHEL

Année

Publications
Files Type

2011 Kohel David R.
Addition law structure of elliptic curves.
J. Number Theory 131, no. 5, 894--919, 2011. arXiv ACL

2010 Kohel David, Rolland Robert.
Arithmetic, Geometry, Cryptography and Coding Theory 2009.
Contemporary Mathematics, AMS, Vol. 521, Kohel David, Rolland Robert (Editors), 2010. AMS DO

2009 Doche Christophe, Kohel David R., Sica F.
Double-base number system for multi-scalar multiplications.
Advances in Cryptology – EUROCRYPT 2009, 502-519, Lecture Notes in Comput. Sci., 5479, 2009. ACTI

2008 Joyner David, Kohel David.
Group theory in SAGE.
Computational group theory and the theory of groups, 115--139, Contemp. Math., 470, Amer. Math. Soc., Providence, RI, 2008. ACTI

Kohel David R.
Complex multiplication and canonical lifts.
Algebraic geometry and its applications, 67--83, Ser. Number Theory Appl., 5, World Sci. Publ., Hackensack, NJ, 2008. ACTI

Carls Robert, Kohel David, Lubicz David.
Higher-dimensional 3-adic CM construction.
J. Algebra 319, no. 3, 971--1006, 2008. ACL

2006 Gaudry Pierrick, Houtmann Thomas, Kohel David, Ritzenthaler Christophe, Weng Annegret.
The 2-adic CM method for genus 2 curves with application to cryptography.
Advances in cryptology---ASIACRYPT 2006, 114--129, Lecture Notes in Comput. Sci., 4284, Springer, Berlin, 2006. ACTI

Doche Christophe, Icart Thomas, Kohel David R.
Efficient scalar multiplication by isogeny decompositions.
Public key cryptography---PKC 2006, 191--206, Lecture Notes in Comput. Sci., 3958, Springer, Berlin, 2006. ACTI

Kohel David R., Smith Benjamin A.
Efficiently computable endomorphisms for hyperelliptic curves.
Algorithmic number theory, 495--509, Lecture Notes in Comput. Sci., 4076, Springer, Berlin, 2006.
ACL

Girard Martine, Kohel David R.
Classification of genus 3 curves in special strata of the moduli space.
Algorithmic number theory, 346--360, Lecture Notes in Comput. Sci., 4076, Springer, Berlin, 2006. ACL

Girard Martine, Kohel David R., Ritzenthaler Christophe.
The Weierstrass subgroup of a curve has maximal rank.
Bull. London Math. Soc. 38, no. 6, 925--931, 2006. ACL

2003 Kohel David R.
The AGM-$X\sb 0(N)$ Heegner point lifting algorithm and elliptic curve point counting.
Advances in cryptology---ASIACRYPT 2003, 124--136, Lecture Notes in Comput. Sci., 2894, Springer, Berlin, 2003.

Kohel David R., Verrill Helena A.
Fundamental domains for Shimura curves.
Les XXIIèmes Journées Arithmetiques (Lille, 2001). J. Théor. Nombres Bordeaux 15, no. 1, 205--222, 2003.

2002 Fieker Claus, Kohel David R.
Algorithmic number theory.
Proceedings of the 5th International Symposium (ANTS-V) held at the University of Sydney, Sydney, July 7--12, 2002. Edited by Claus Fieker and David R. Kohel. Lecture Notes in Computer Science, 2369. Springer-Verlag, Berlin. x+517 pp. ISBN: 3-540-43863-7, 2002

2001 Kohel David R.
Rational groups of elliptic curves suitable for cryptography.
Cryptography and computational number theory (Singapore, 1999), 69--80, Progr. Comput. Sci. Appl. Logic, 20, Birkhäuser, Basel, 2001.

Ding Cunsheng, Kohel David, Ling San.
Counting the number of points on affine diagonal curves.
Cryptography and computational number theory (Singapore, 1999), 15--24, Progr. Comput. Sci. Appl. Logic, 20, Birkhäuser, Basel, 2001.

Kohel David R.
Hecke module structure of quaternions.
Class field theory---its centenary and prospect (Tokyo, 1998), 177--195, Adv. Stud. Pure Math., 30, Math. Soc. Japan, Tokyo, 2001.

2000 Kohel David R., Stein William A.
Component groups of quotients of $J\sb 0(N)$.
Algorithmic number theory (Leiden, 2000), 405--412, Lecture Notes in Comput. Sci., 1838, Springer, Berlin, 2000.

Kohel David R., Shparlinski Igor E.
On exponential sums and group generators for elliptic curves over finite fields.
Algorithmic number theory (Leiden, 2000), 395--404, Lecture Notes in Comput. Sci., 1838, Springer, Berlin, 2000.

Ding Cunsheng, Kohel David, Ling San.
Secret-sharing with a class of ternary codes.
Theoret. Comput. Sci. 246, no. 1-2, 285--298, 2000.

Ding Cunsheng, Kohel David, Ling San.
Split group codes.
IEEE Trans. Inform. Theory 46, no. 2, 485--495, 2000.

Ding Cunsheng, Kohel David, Ling San.
Elementary 2-group character codes.
IEEE Trans. Inform. Theory 46, no. 1, 280--284, 2000.

1999
Kohel David, Ling San, Xing Chaoping.
Explicit sequence expansions.
Sequences and their applications (Singapore, 1998), 308--317, Springer Ser. Discrete Math. Theor. Comput. Sci., Springer, London, 1999.

Last update : november 16, 2011, EL.

Année	Publications	Files	Type
2011	Kohel David R. Addition law structure of elliptic curves. J. Number Theory 131, no. 5, 894--919, 2011.	arXiv	ACL
2010	Kohel David, Rolland Robert. Arithmetic, Geometry, Cryptography and Coding Theory 2009. Contemporary Mathematics, AMS, Vol. 521, Kohel David, Rolland Robert (Editors), 2010.	AMS	DO
2009	Doche Christophe, Kohel David R., Sica F. Double-base number system for multi-scalar multiplications. Advances in Cryptology – EUROCRYPT 2009, 502-519, Lecture Notes in Comput. Sci., 5479, 2009.		ACTI
2008	Joyner David, Kohel David. Group theory in SAGE. Computational group theory and the theory of groups, 115--139, Contemp. Math., 470, Amer. Math. Soc., Providence, RI, 2008.		ACTI
	Kohel David R. Complex multiplication and canonical lifts. Algebraic geometry and its applications, 67--83, Ser. Number Theory Appl., 5, World Sci. Publ., Hackensack, NJ, 2008.		ACTI
	Carls Robert, Kohel David, Lubicz David. Higher-dimensional 3-adic CM construction. J. Algebra 319, no. 3, 971--1006, 2008.		ACL
2006	Gaudry Pierrick, Houtmann Thomas, Kohel David, Ritzenthaler Christophe, Weng Annegret. The 2-adic CM method for genus 2 curves with application to cryptography. Advances in cryptology---ASIACRYPT 2006, 114--129, Lecture Notes in Comput. Sci., 4284, Springer, Berlin, 2006.		ACTI
	Doche Christophe, Icart Thomas, Kohel David R. Efficient scalar multiplication by isogeny decompositions. Public key cryptography---PKC 2006, 191--206, Lecture Notes in Comput. Sci., 3958, Springer, Berlin, 2006.		ACTI
	Kohel David R., Smith Benjamin A. Efficiently computable endomorphisms for hyperelliptic curves. Algorithmic number theory, 495--509, Lecture Notes in Comput. Sci., 4076, Springer, Berlin, 2006.		ACL
	Girard Martine, Kohel David R. Classification of genus 3 curves in special strata of the moduli space. Algorithmic number theory, 346--360, Lecture Notes in Comput. Sci., 4076, Springer, Berlin, 2006.		ACL
	Girard Martine, Kohel David R., Ritzenthaler Christophe. The Weierstrass subgroup of a curve has maximal rank. Bull. London Math. Soc. 38, no. 6, 925--931, 2006.		ACL
2003	Kohel David R. The AGM-$X\sb 0(N)$ Heegner point lifting algorithm and elliptic curve point counting. Advances in cryptology---ASIACRYPT 2003, 124--136, Lecture Notes in Comput. Sci., 2894, Springer, Berlin, 2003.
	Kohel David R., Verrill Helena A. Fundamental domains for Shimura curves. Les XXIIèmes Journées Arithmetiques (Lille, 2001). J. Théor. Nombres Bordeaux 15, no. 1, 205--222, 2003.
2002	Fieker Claus, Kohel David R. Algorithmic number theory. Proceedings of the 5th International Symposium (ANTS-V) held at the University of Sydney, Sydney, July 7--12, 2002. Edited by Claus Fieker and David R. Kohel. Lecture Notes in Computer Science, 2369. Springer-Verlag, Berlin. x+517 pp. ISBN: 3-540-43863-7, 2002
2001	Kohel David R. Rational groups of elliptic curves suitable for cryptography. Cryptography and computational number theory (Singapore, 1999), 69--80, Progr. Comput. Sci. Appl. Logic, 20, Birkhäuser, Basel, 2001.
	Ding Cunsheng, Kohel David, Ling San. Counting the number of points on affine diagonal curves. Cryptography and computational number theory (Singapore, 1999), 15--24, Progr. Comput. Sci. Appl. Logic, 20, Birkhäuser, Basel, 2001.
	Kohel David R. Hecke module structure of quaternions. Class field theory---its centenary and prospect (Tokyo, 1998), 177--195, Adv. Stud. Pure Math., 30, Math. Soc. Japan, Tokyo, 2001.
2000	Kohel David R., Stein William A. Component groups of quotients of $J\sb 0(N)$. Algorithmic number theory (Leiden, 2000), 405--412, Lecture Notes in Comput. Sci., 1838, Springer, Berlin, 2000.
	Kohel David R., Shparlinski Igor E. On exponential sums and group generators for elliptic curves over finite fields. Algorithmic number theory (Leiden, 2000), 395--404, Lecture Notes in Comput. Sci., 1838, Springer, Berlin, 2000.
	Ding Cunsheng, Kohel David, Ling San. Secret-sharing with a class of ternary codes. Theoret. Comput. Sci. 246, no. 1-2, 285--298, 2000.
	Ding Cunsheng, Kohel David, Ling San. Split group codes. IEEE Trans. Inform. Theory 46, no. 2, 485--495, 2000.
	Ding Cunsheng, Kohel David, Ling San. Elementary 2-group character codes. IEEE Trans. Inform. Theory 46, no. 1, 280--284, 2000.
1999	Kohel David, Ling San, Xing Chaoping. Explicit sequence expansions. Sequences and their applications (Singapore, 1998), 308--317, Springer Ser. Discrete Math. Theor. Comput. Sci., Springer, London, 1999.