{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:52:57Z","timestamp":1764996777785},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,4,22]],"date-time":"2006-04-22T00:00:00Z","timestamp":1145664000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s00200-006-0013-x","type":"journal-article","created":{"date-parts":[[2006,4,21]],"date-time":"2006-04-21T08:06:46Z","timestamp":1145606806000},"page":"141-150","source":"Crossref","is-referenced-by-count":1,"title":["A Simple Point Counting Algorithm for Hessian Elliptic Curves in Characteristic Three"],"prefix":"10.1007","volume":"17","author":[{"given":"Trond St\u00f8len","family":"Gustavsen","sequence":"first","affiliation":[]},{"given":"Kristian","family":"Ranestad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,22]]},"reference":[{"key":"13_CR1","unstructured":"Carls, R.: A generalized arithmetic geometric mean. PhD Thesis (2004). http:\/\/www.maths.usyd.edu.au\/u\/carls\/thesis.pdf"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02940746","volume":"14","author":"M. Deuring","year":"1941","unstructured":"Deuring M. (1941). Die Typen der Multiplikatorringe Elliptischer Funktionenk\u00f6rper. Abh. Math. Sem. Univ. Hamburg 14:197\u2013272","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Frium H.R. The group law on elliptic curves on Hesse form. In: Finite fields with applications to coding theory, cryptography and related areas (Oaxaca, 2001), pp. 123\u2013151. Berlin Heidelberg New York: Springer 2002","DOI":"10.1007\/978-3-642-59435-9_10"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1112\/S1461157000000747","volume":"5","author":"K. Harrison","year":"2002","unstructured":"Harrison K., Page D., Smart N.P. (2002). Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS J Comput Math 5:181\u2013193 (electronic)","journal-title":"LMS J Comput Math"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Joye, M., Quisquater, J.J.: Hessian elliptic curves and side-channel attacks. In: Cryptographic hardware and embedded systems \u2013 CHES 2001 (Paris), Lecture Notes in Comput Sci, vol. 2162, pp. 402\u2013410. Berlin Heidelberg New York: Springer 2001","DOI":"10.1007\/3-540-44709-1_33"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Kohel, D.R.: The AGM-X 0(N) Heegner point lifting algorithm and elliptic curve point counting. In: Advances in cryptology \u2013 ASIACRYPT 2003 (Taipei, Taiwan), Lecture Notes in Comput Sci, vol. 2894, pp. 124\u2013136. Berlin Heidelberg New York: Springer 2003","DOI":"10.1007\/978-3-540-40061-5_8"},{"key":"13_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4752-4","volume-title":"Elliptic Functions","author":"S. Lang","year":"1987","unstructured":"Lang S. (1987). Elliptic Functions, 2nd edn. Springer, Berlin Heildelberg New York","edition":"2"},{"key":"13_CR8","unstructured":"Madsen, M.S.: The AGM-method of point counting on ordinary elliptic curves over finite fields of characteristic 2. (2002). http:\/\/home.imf.au.dk\/marc"},{"key":"13_CR9","unstructured":"Mestre, J.F.: Lettre adress\u00e9e \u00e0 Gaudry et Harley. http:\/\/www.math.jussieu.fr\/mestre (2000)"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/3-540-36400-5_38","volume-title":"Cryptographic hardware and embedded systems \u2013 CHES 2002","author":"D. Page","year":"2003","unstructured":"Page D., Smart N.P. (2003). Hardware implementation of finite fields of characteristic three. In: Kaliski B.S Jr., Ko\u00e7 C.K., Paar C. (eds) Cryptographic hardware and embedded systems \u2013 CHES 2002. Springer, Berlin Heidelberg New York, pp. 529\u2013539"},{"issue":"4","key":"13_CR11","first-page":"247","volume":"115","author":"T. Satoh","year":"2000","unstructured":"Satoh T. (2000). The canonical lift of an ordinary elliptic curve over a finite field and its point counting. J Ramanujan Math Soc 115(4):247\u2013270","journal-title":"J Ramanujan Math Soc"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1071-5797(02)00013-8","volume":"9","author":"T. Satoh","year":"2003","unstructured":"Satoh T., Skjernaa B., Taguchi Y. (2003). Fast computation of canonical lifts of elliptic curves and its application to point counting. Finite Fields Appl 9:89\u2013101","journal-title":"Finite Fields Appl"},{"issue":"170","key":"13_CR13","first-page":"483","volume":"44","author":"R. Schoof","year":"1985","unstructured":"Schoof R. (1985). Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp. 44(170): 483\u2013494","journal-title":"Math. Comp."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Smart N.P. (2001). The Hessian form of an elliptic curve. In: C.P. C.K. Koc D. Naccache (ed.) Cryptographic hardware and embedded systems CHES 2001, no. 2162 in Lecture Notes in Comput. Sci., pp. 118\u2013126. Berlin Heidelberg New York: Springer","DOI":"10.1007\/3-540-44709-1_11"},{"issue":"6","key":"13_CR15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s00200-002-0114-0","volume":"13","author":"N.P. Smart","year":"2003","unstructured":"Smart N.P., Westwood E.J. (2003). Point multiplication on ordinary elliptic curves over fields of characteristic three. Appl Algebra Eng Comm Comput 13(6):485\u2013497","journal-title":"Appl Algebra Eng Comm Comput"},{"key":"13_CR16","unstructured":"The PARI Group, Bordeaux: PARI\/GP, Version 2.1.5 (2000). http:\/\/www.parigp-home.de\/"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Vercauteren, F., Preneel, B., Vandewalle, J.: A memory efficient version of Satoh\u2019s algorithm. In: Advances in cryptology \u2013 EUROCRYPT 2001 (Innsbruck), Lecture Notes in Comput Sci, vol. 2045, pp. 1\u201313. Berlin Heidelberg New York: Springer 2001","DOI":"10.1007\/3-540-44987-6_1"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-006-0013-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-006-0013-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-006-0013-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:24:19Z","timestamp":1558610659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-006-0013-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,22]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s00200-006-0013-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,22]]}}}