Publication Search Results

Matches for:

  • Author=Kohel DR

1. Carls R, Kohel DR, Lubicz D. Higher-dimensional 3-adic CM construction, Journal of Algebra, 319 (2008), no. 3, 971–10006.


2. Kohel DR, Smith BA. Efficiently computable endomorphisms for hyperelliptic curves, Algorithmic Number Theory: ANTS-VII, 7th International Symposium, ANTS-VII, Florian Hess, Sebastian Pauli, Michael Post (eds.), Lecture Notes in Computer Science, 4076 Springer-Verlag, Berlin, (2006), 495–509. ISBN 3-540-36075-1 MR2282945


3. Girard M, Kohel DR. Classification of genus 3 curves in special strata of the moduli space, Algorithmic Number Theory: ANTS-VII, 7th International Symposium, ANTS-VII, Florian Hess, Sebastian Pauli, Michael Post (eds.), Lecture Notes in Computer Science, 4076 Springer-Verlag, Berlin, (2006), 346–360. ISBN 3-540-36075-1 MR2282935


4. Doche C, Icart T, Kohel DR. Efficient scalar multiplication by isogeny decompositions, Public Key Cryptography - PKC 2006, 9th International Conference on Theory and Practice of Public-Key Cryptography, M. Yung et al. (ed.), Lecture Notes in Computer Science 3958/2006, Springer, Berlin / Heidelberg, (2006), 191–206. ISBN 978-3-540-33851-2 MR2423190


5. Gaudry P, Houtmann T, Kohel DR. The 2-adic CM method for genus 2 curves with application to cryptography, Advances in Cryptology – ASIACRYPT 2006, Asiacrypt 2006, Lai, Xuejia; Chen, Kefei (eds.), Lecture Notes in Computer Science, Springer, Berlin, (2006), UNKNOWN. ISBN 3-540-49475-8 MR2282945


6. Girard M, Kohel DR, Ritzenthaler C. The Weierstrass subgroup of a curve has maximal rank, Bulletin of the London Mathematical Society, 38 (2006), no. 6, 925–931. MR2285246


7. Kohel DR, Verrill HA. Fundamental Domains for Shimura Curves, Journal de Théorie des Nombres, 15 (2003), 205–222. MR2019012


8. Kohel DR. The AGM-\(X_0(N)\) Heegner Point Lifting Algorithm and Elliptic Curve Point Counting, Advances in Cryptology – Asiacrypt 2003, Asiacrypt 2003, Chi Sung Laih (ed.), Lecture Notes in Computer Science, Springer, Berlin, (2003), 124–136. ISBN 3-540-20592-6 MR2093256


9. Fieker C, Kohel DR. ANTS-V Proceedings, Lecture Notes in Computer Science, Springer, Berlin Heidelberg, (2002), 515.


10. Kohel DR. Rational groups of elliptic curves suitable for cryptography, Progress in Computer Science and Applied Logic, 20 (2001), 69–80. 2003j:14030


11. Kohel DR. Hecke module structure of quaternions, Advanced Studies in Pure Mathematics, 30 (2001), 177–195. 2002i:11059


12. Ding C, Kohel DR, Ling S. Counting the number of points on affine diagonal curves, Cryptography and computational number theory, CNNT workshop, John Cherniavsky (ed.), Progress in computer science and applied logic, Birkhauser Verlag, Germany, (2001), 15–24. ISBN 3-7643-6510-2 2003i:11081


13. Ding C, Kohel DR, Ling S. Secret-sharing with a class of ternary codes, Theoretical Computer Science, 246 (1-2) (2000), 285–298. 2002g:94040


14. Ding C, Kohel DR, Ling S. Split group codes, IEEE Transactions on Information Theory, 46 (2000), no. 2, 485–495. 2001d:94040


15. Ding C, Kohel DR, Ling S. Elementary 2-group character codes, IEEE Transactions on Information Theory, 46 (2000), no. 1, 280–284. 2000j:94030


16. Kohel DR, Stein WA. Component groups of quotients of J0(N), Algorithmic Number Theory, 4th International Symposium, ANTS-IV, Wieb Bosma (ed.), Lecture Notes in Computer Science, 412, Berlin, Germany, (2000), 405. ISBN 3-540-67695-3 MR1850621


17. Kohel DR, Shparlinski IE. On exponential sums and group generators for elliptic curves over Finite Fields, Algorithmic Number Theory, 4th International Symposium, ANTS-IV, Wieb Bosma (ed.), Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, (2000), 395–404. ISBN 3 540 67695 3 2003c:11094


Number of matches:  17   Page 1 of 1   Select page: 1 
For questions or comments please contact webmaster@maths.usyd.edu.au