{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:00:02Z","timestamp":1776844802120,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540681595","type":"print"},{"value":"9783540681649","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68164-9_26","type":"book-chapter","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T10:48:34Z","timestamp":1212144514000},"page":"389-405","source":"Crossref","is-referenced-by-count":261,"title":["Twisted Edwards Curves"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[]},{"given":"Peter","family":"Birkner","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Joye","sequence":"additional","affiliation":[]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[]},{"given":"Christiane","family":"Peters","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"D.J. Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: New Diffie-Hellman Speed Records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 207\u2013228. Springer, Heidelberg (2006), http:\/\/cr.yp.to\/papers.html#curve25519"},{"key":"26_CR2","unstructured":"Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: ECM using Edwards curves (2007) (Citations in this document: \u00a71), http:\/\/eprint.iacr.org\/2008\/016"},{"key":"26_CR3","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database (2007) (Citations in this document: \u00a75, \u00a76), http:\/\/hyperelliptic.org\/EFD"},{"key":"26_CR4","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Asiacrypt 2007 [19], pp. 29\u201350 (2007) (Citations in this document: \u00a71, \u00a71, \u00a72, \u00a72, \u00a72, \u00a73, \u00a73, \u00a73, \u00a73, \u00a73, \u00a73, \u00a74, \u00a76, \u00a76, \u00a76, \u00a77, \u00a77), http:\/\/cr.yp.to\/papers.html#newelliptic"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Inverted Edwards coordinates. In: AAECC 2007 [8], pp. 20\u201327 (2007) (Citations in this document: \u00a71, \u00a76, \u00a77), http:\/\/cr.yp.to\/papers.html#inverted","DOI":"10.1007\/978-3-540-77224-8_4"},{"key":"26_CR6","unstructured":"Billet, O., Joye, M.: The Jacobi model of an elliptic curve and side-channel analysis. In: AAECC 2003 [14], pp. 34\u201342 (2003) MR 2005c:94045 (Citations in this document: \u00a75), http:\/\/eprint.iacr.org\/2002\/125"},{"key":"26_CR7","volume-title":"Elliptic curves in cryptography","author":"I.F. Blake","year":"2000","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic curves in cryptography. Cambridge University Press, Cambridge (2000) (Citations in this document: \u00a75)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","year":"2007","unstructured":"Bozta\u015f, S., Lu, H.-F(F.) (eds.): AAECC 2007. LNCS, vol.\u00a04851. Springer, Heidelberg (2007)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Brier, \u00c9., Joye, M.: Fast point multiplication on elliptic curves through isogenies. In: AAECC 2003 [14], pp. 43\u201350 (2003) (Citations in this document: \u00a75)","DOI":"10.1007\/3-540-44828-4_6"},{"key":"26_CR10","volume-title":"Handbook of elliptic and hyperelliptic curve cryptography","year":"2005","unstructured":"Cohen, H., Frey, G. (eds.): Handbook of elliptic and hyperelliptic curve cryptography. CRC Press, Boca Raton (2005) See [11]"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Doche, C., Lange, T.: Arithmetic of elliptic curves. In: [10] (2005), pp. 267\u2013 302. MR 2162729 (Citations in this document: \u00a73)","DOI":"10.1201\/9781420034981.pt3"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ipl.2007.05.012","volume":"104","author":"S. Duquesne","year":"2007","unstructured":"Duquesne, S.: Improving the arithmetic of elliptic curves in the Jacobi model. Information Processing Letters\u00a0104, 101\u2013105 (2007) (Citations in this document: \u00a75)","journal-title":"Information Processing Letters"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"H.M. Edwards","year":"2007","unstructured":"Edwards, H.M.: A normal form for elliptic curves. Bulletin of the American Mathematical Society\u00a044, 393\u2013422 (2007) (Citations in this document: \u00a71), http:\/\/www.ams.org\/bull\/2007-44-03\/S0273-0979-07-01153-6\/home.html","journal-title":"Bulletin of the American Mathematical Society"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","year":"2003","unstructured":"Fossorier, M.P.C., H\u00f8holdt, T., Poli, A. (eds.): AAECC 2003. LNCS, vol.\u00a02643. Springer, Heidelberg (2003) See [6], [9]"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1112\/S0024610700001502","volume":"62","author":"S.D. Galbraith","year":"2000","unstructured":"Galbraith, S.D., McKee, J.: The probability that the number of points on an elliptic curve over a finite field is prime. Journal of the London Mathematical Society\u00a062, 671\u2013684 (2000) (Citations in this document: \u00a74), http:\/\/www.isg.rhul.ac.uk\/~sdg\/pubs.html","journal-title":"Journal of the London Mathematical Society"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Hisil, H., Carter, G., Dawson, E.: New formulae for efficient elliptic curve arithmetic. In: INDOCRYPT 2007 [23] (2007) (Citations in this document: \u00a75)","DOI":"10.1007\/978-3-540-77026-8_11"},{"key":"26_CR17","unstructured":"Hisil, H., Wong, K., Carter, G., Dawson, E.: Faster group operations on elliptic curves. 25 Feb 2008 version (2008) (Citations in this document: \u00a75), http:\/\/eprint.iacr.org\/2007\/441"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography","year":"2000","unstructured":"Imai, H., Zheng, Y. (eds.): PKC 2000. LNCS, vol.\u00a01751. Springer, Heidelberg (2000) see [21]"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","year":"2007","unstructured":"Kurosawa, K. (ed.): ASIACRYPT 2007. LNCS, vol.\u00a04833. Springer, Heidelberg (2007)"},{"key":"26_CR20","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048, 243\u2013264 (1987), (Citations in this document: \u00a73, \u00a77), http:\/\/links.jstor.org\/sici?sici=0025-571819870148:177243:STPAEC2.0.CO;2-3"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Okeya, K., Kurumatani, H., Sakurai, K.: Elliptic curves with the Montgomery-form and their cryptographic applications. In: PKC 2000, pp. 238\u2013257 (2000) (Citations in this document: \u00a73 \u00a73)","DOI":"10.1007\/978-3-540-46588-1_17"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves. Graduate Texts in Mathematics\u00a0106 (1986)","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","year":"2007","unstructured":"Srinathan, K., Rangan, C.P., Yung, M. (eds.): INDOCRYPT 2007. LNCS, vol.\u00a04859. Springer, Heidelberg (2007) See [16]"},{"key":"26_CR24","unstructured":"Stein, W. (ed.): Sage Mathematics Software (Version 2.8.12), The Sage Group (2008) (Citations in this document: \u00a73), http:\/\/www.sagemath.org"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography - PKC 2006","year":"2006","unstructured":"Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.): PKC 2006. LNCS, vol.\u00a03958. Springer, Heidelberg (2006) See [1]"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68164-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:38:56Z","timestamp":1620016736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68164-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681595","9783540681649"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68164-9_26","relation":{},"subject":[]}}