{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:31:07Z","timestamp":1739338267398,"version":"3.37.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:00:00Z","timestamp":1731369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:00:00Z","timestamp":1731369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00145-024-09529-y","type":"journal-article","created":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T19:25:40Z","timestamp":1731439540000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SwiftEC: Shallue\u2013van de Woestijne Indifferentiable Function To Elliptic Curves"],"prefix":"10.1007","volume":"38","author":[{"given":"Jorge","family":"Ch\u00e1vez-Saab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Rodr\u00edguez-Henr\u00edquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,12]]},"reference":[{"key":"9529_CR1","unstructured":"Certicom research, standards for efficient cryptography 2: Recommended elliptic curve domain parameters, January 2010."},{"key":"9529_CR2","unstructured":"Diego F. Aranha and Conrado P. L. Gouv\u00eaa. RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic\/blob\/symbol-asm\/src\/fp\/relic_fp_smb.c, 2021."},{"key":"9529_CR3","doi-asserted-by":"crossref","unstructured":"Diego F. Aranha, Benjamin Salling Hvass, Bas Spitters, and Mehdi Tibouchi. Faster constant-time evaluation of the kronecker symbol with application to elliptic curve hashing. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201923, page 3228-3238, New York, NY, USA, 2023. Association for Computing Machinery.","DOI":"10.1145\/3576915.3616597"},{"key":"9529_CR4","doi-asserted-by":"crossref","unstructured":"Paulo S. L. M. Barreto, Ben Lynn, and Michael Scott. Constructing elliptic curves with prescribed embedding degrees. In Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano, editors, SCN 02, volume 2576 of LNCS, pages 257\u2013267. Springer, Heidelberg, September 2003.","DOI":"10.1007\/3-540-36413-7_19"},{"key":"9529_CR5","doi-asserted-by":"crossref","unstructured":"Paulo S. L. M. Barreto and Michael Naehrig. Pairing-friendly elliptic curves of prime order. In Bart Preneel and Stafford Tavares, editors, SAC 2005, volume 3897 of LNCS, pages 319\u2013331. Springer, Heidelberg, August 2006.","DOI":"10.1007\/11693383_22"},{"key":"9529_CR6","doi-asserted-by":"crossref","unstructured":"Daniel J. Bernstein. Curve25519: New Diffie-Hellman speed records. In Moti Yung, Yevgeniy Dodis, Aggelos Kiayias, and Tal Malkin, editors, PKC 2006, volume 3958 of LNCS, pages 207\u2013228. Springer, Heidelberg, April 2006.","DOI":"10.1007\/11745853_14"},{"key":"9529_CR7","doi-asserted-by":"crossref","unstructured":"Daniel J. Bernstein, Mike Hamburg, Anna Krasnova, and Tanja Lange. Elligator: elliptic-curve points indistinguishable from uniform random strings. In Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 967\u2013980. ACM Press, November 2013.","DOI":"10.1145\/2508859.2516734"},{"issue":"3","key":"9529_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.46586\/tches.v2019.i3.340-398","volume":"2019","author":"Daniel J Bernstein","year":"2019","unstructured":"Daniel J. Bernstein and Bo-Yin Yang. Fast constant-time gcd computation and modular inversion. IACR TCHES, 2019(3):340\u2013398, 2019. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8298.","journal-title":"IACR TCHES"},{"key":"9529_CR9","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Matthew K. Franklin. Identity-based encryption from the Weil pairing. In Joe Kilian, editor, CRYPTO 2001, volume 2139 of LNCS, pages 213\u2013229. Springer, Heidelberg, August 2001.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"9529_CR10","doi-asserted-by":"crossref","unstructured":"Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the Weil pairing. In Colin Boyd, editor, ASIACRYPT 2001, volume 2248 of LNCS, pages 514\u2013532. Springer, Heidelberg, December 2001.","DOI":"10.1007\/3-540-45682-1_30"},{"key":"9529_CR11","unstructured":"Sean Bowe. BLS12-381: New zk-SNARK elliptic curve construction. https:\/\/electriccoin.co\/blog\/new-snark-curve\/, 2017."},{"key":"9529_CR12","doi-asserted-by":"crossref","unstructured":"Eric Brier, Jean-S\u00e9bastien Coron, Thomas Icart, David Madore, Hugues Randriam, and Mehdi Tibouchi. Efficient indifferentiable hashing into ordinary elliptic curves. In Tal Rabin, editor, CRYPTO 2010, volume 6223 of LNCS, pages 237\u2013254. Springer, Heidelberg, August 2010.","DOI":"10.1007\/978-3-642-14623-7_13"},{"issue":"9","key":"9529_CR13","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1090\/S0002-9939-00-05441-1","volume":"128","author":"Francis N Castro","year":"2000","unstructured":"Francis N. Castro and Carlos J. Moreno. Mixed exponential sums over finite fields. Proc. Amer. Math. Soc., 128(9):2529\u20132537, 2000.","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"9529_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s11139-012-9444-0","volume":"30","author":"Wouter Castryck","year":"2013","unstructured":"Wouter Castryck and Hendrick Hubrechts. The distribution of the number of points modulo an integer on elliptic curves over finite fields. The Ramanujan Journal, 30(2):223\u2013242, 2013.","journal-title":"The Ramanujan Journal"},{"key":"9529_CR15","doi-asserted-by":"crossref","unstructured":"Reza Rezaeian Farashahi. Hashing into Hessian curves. In Abderrahmane Nitaj and David Pointcheval, editors, AFRICACRYPT 11, volume 6737 of LNCS, pages 278\u2013289. Springer, Heidelberg, July 2011.","DOI":"10.1007\/978-3-642-21969-6_17"},{"issue":"281","key":"9529_CR16","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1090\/S0025-5718-2012-02606-8","volume":"82","author":"Reza Rezaeian Farashahi","year":"2013","unstructured":"Reza Rezaeian Farashahi, Pierre-Alain Fouque, Igor E. Shparlinski, Mehdi Tibouchi, and Jos\u00e9 Felipe Voloch. Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comput., 82(281):491\u2013512, 2013.","journal-title":"Math. Comput."},{"key":"9529_CR17","doi-asserted-by":"crossref","unstructured":"Armando Faz-Hernandez, Sam Scott, Nick Sullivan, Riad S. Wahby, and Christopher A. Wood. Hashing to Elliptic Curves. RFC 9380, August 2023.","DOI":"10.17487\/RFC9380"},{"key":"9529_CR18","doi-asserted-by":"crossref","unstructured":"Pierre-Alain Fouque, Antoine Joux, and Mehdi Tibouchi. Injective encodings to elliptic curves. In Colin Boyd and Leonie Simpson, editors, ACISP 13, volume 7959 of LNCS, pages 203\u2013218. Springer, Heidelberg, July 2013.","DOI":"10.1007\/978-3-642-39059-3_14"},{"key":"9529_CR19","doi-asserted-by":"crossref","unstructured":"Pierre-Alain Fouque and Mehdi Tibouchi. Deterministic encoding and hashing to odd hyperelliptic curves. In Marc Joye, Atsuko Miyaji, and Akira Otsuka, editors, PAIRING 2010, volume 6487 of LNCS, pages 265\u2013277. Springer, Heidelberg, December 2010.","DOI":"10.1007\/978-3-642-17455-1_17"},{"key":"9529_CR20","doi-asserted-by":"crossref","unstructured":"Pierre-Alain Fouque and Mehdi Tibouchi. Indifferentiable hashing to Barreto-Naehrig curves. In Alejandro Hevia and Gregory Neven, editors, LATINCRYPT 2012, volume 7533 of LNCS, pages 1\u201317. Springer, Heidelberg, October 2012.","DOI":"10.1007\/978-3-642-33481-8_1"},{"key":"9529_CR21","unstructured":"Mike Hamburg. Fast and compact elliptic-curve cryptography. Cryptology ePrint Archive, Report 2012\/309, 2012. https:\/\/eprint.iacr.org\/2012\/309."},{"key":"9529_CR22","unstructured":"Mike Hamburg. Ed448-goldilocks, a new elliptic curve. Cryptology ePrint Archive, Report 2015\/625, 2015. https:\/\/eprint.iacr.org\/2015\/625."},{"key":"9529_CR23","unstructured":"Mike Hamburg. Computing the Jacobi symbol using Bernstein\u2013Yang. Cryptology ePrint Archive, Paper 2021\/1271, 2021. https:\/\/eprint.iacr.org\/2021\/1271."},{"key":"9529_CR24","doi-asserted-by":"crossref","unstructured":"Thomas Icart. How to hash into elliptic curves. In Shai Halevi, editor, CRYPTO 2009, volume 5677 of LNCS, pages 303\u2013316. Springer, Heidelberg, August 2009.","DOI":"10.1007\/978-3-642-03356-8_18"},{"key":"9529_CR25","doi-asserted-by":"crossref","unstructured":"Jean-Gabriel Kammerer, Reynald Lercier, and Gu\u00e9na\u00ebl Renault. Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time. In Marc Joye, Atsuko Miyaji, and Akira Otsuka, editors, PAIRING 2010, volume 6487 of LNCS, pages 278\u2013297. Springer, Heidelberg, December 2010.","DOI":"10.1007\/978-3-642-17455-1_18"},{"issue":"3","key":"9529_CR26","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10623-022-01012-8","volume":"90","author":"Dmitrii Koshelev","year":"2022","unstructured":"Dmitrii Koshelev. Indifferentiable hashing to ordinary elliptic $${\\mathbb{F}}_{q}$$-curves of $$j=0$$ with the cost of one exponentiation in $${\\mathbb{F}}_{q}$$. Des. Codes Cryptogr., 90(3):801\u2013812, 2022.","journal-title":"Des. Codes Cryptogr."},{"key":"9529_CR27","doi-asserted-by":"crossref","unstructured":"Ueli M. Maurer, Renato Renner, and Clemens Holenstein. Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In Moni Naor, editor, TCC 2004, volume 2951 of LNCS, pages 21\u201339. Springer, Heidelberg, February 2004.","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"9529_CR28","unstructured":"Dhruv Mehta, Tim Ruffing, Jonas Schnelli, and Pieter Wuille. BIP 324: Version 2 P2P encrypted transport protocol. https:\/\/bips.dev\/324\/, March 2019."},{"key":"9529_CR29","doi-asserted-by":"publisher","first-page":"279","DOI":"10.4064\/aa-59-3-279-290","volume":"59","author":"Marc Perret","year":"1991","unstructured":"Marc Perret. Multiplicative character sums and Kummer coverings. Acta Arith., 59:279\u2013290, 1991.","journal-title":"Acta Arith."},{"key":"9529_CR30","unstructured":"Thomas Pornin. Faster modular inversion and Legendre symbol, and an X25519 speed record. https:\/\/research.nccgroup.com\/2020\/09\/28\/faster-modular-inversion-and-legendre-symbol-and-an-x25519-speed-record\/, September 2020."},{"key":"9529_CR31","doi-asserted-by":"crossref","unstructured":"Thomas Ristenpart, Hovav Shacham, and Thomas Shrimpton. Careful with composition: Limitations of the indifferentiability framework. In Kenneth G. Paterson, editor, EUROCRYPT 2011, volume 6632 of LNCS, pages 487\u2013506. Springer, Heidelberg, May 2011.","DOI":"10.1007\/978-3-642-20465-4_27"},{"key":"9529_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6046-0","volume-title":"Number Theory in Function Fields","author":"Michael Rosen","year":"2002","unstructured":"Michael Rosen. Number Theory in Function Fields. Springer New York, NY, 2002."},{"key":"9529_CR33","doi-asserted-by":"crossref","unstructured":"Andrew Shallue and Christiaan E. van de Woestijne. Construction of rational points on elliptic curves over finite fields. In Florian Hess, Sebastian Pauli, and Michael E. Pohst, editors, Algorithmic Number Theory, 7th International Symposium, ANTS-VII, volume 4076 of Lecture Notes in Computer Science, pages 510\u2013524. Springer, 2006.","DOI":"10.1007\/11792086_36"},{"key":"9529_CR34","doi-asserted-by":"crossref","unstructured":"Mehdi Tibouchi. Elligator squared: Uniform points on elliptic curves of prime order as uniform random strings. In Nicolas Christin and Reihaneh Safavi-Naini, editors, FC 2014, volume 8437 of LNCS, pages 139\u2013156. Springer, Heidelberg, March 2014.","DOI":"10.1007\/978-3-662-45472-5_10"},{"key":"9529_CR35","doi-asserted-by":"crossref","unstructured":"Mehdi Tibouchi. Impossibility of surjective Icart-like encodings. In Sherman S. M. Chow, Joseph K. Liu, Lucas C. K. Hui, and Siu-Ming Yiu, editors, ProvSec 2014, volume 8782 of LNCS, pages 29\u201339. Springer, Heidelberg, October 2014.","DOI":"10.1007\/978-3-319-12475-9_3"},{"issue":"1\u20132","key":"9529_CR36","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10623-016-0288-2","volume":"82","author":"Mehdi Tibouchi","year":"2017","unstructured":"Mehdi Tibouchi and Taechan Kim. Improved elliptic curve hashing and point representation. Des. Codes Cryptogr., 82(1-2):161\u2013177, 2017.","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"9529_CR37","doi-asserted-by":"publisher","first-page":"97","DOI":"10.4064\/ba55-2-1","volume":"55","author":"Maciej Ulas","year":"2007","unstructured":"Maciej Ulas. Rational points on certain hyperelliptic curves over finite fields. Bull. Pol. Acad. Sci. Math., 55(2):97\u2013104, 2007.","journal-title":"Bull. Pol. Acad. Sci. Math."},{"issue":"3","key":"9529_CR38","doi-asserted-by":"publisher","first-page":"595","DOI":"10.5802\/jtnb.560","volume":"18","author":"Mark van Hoeij","year":"2006","unstructured":"Mark van Hoeij and John Cremona. Solving conics over function fields. Journal de Th\u00e9orie des Nombres de Bordeaux, 18(3):595\u2013606, 2006.","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"key":"9529_CR39","doi-asserted-by":"crossref","unstructured":"Riad S. Wahby and Dan Boneh. Fast and simple constant-time hashing to the BLS12-381 elliptic curve. IACR TCHES, 2019(4):154\u2013179, 2019. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8348.","DOI":"10.46586\/tches.v2019.i4.154-179"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09529-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09529-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09529-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:32:56Z","timestamp":1739309576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09529-y"}},"subtitle":["Faster Indifferentiable Hashing to Elliptic Curves"],"short-title":[],"issued":{"date-parts":[[2024,11,12]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["9529"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09529-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2024,11,12]]},"assertion":[{"value":"7 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"3"}}