{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:08Z","timestamp":1750221008923,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T00:00:00Z","timestamp":1562544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"OpenDreamKit Horizon 2020","award":["676541"],"award-info":[{"award-number":["676541"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,8]]},"DOI":"10.1145\/3326229.3326251","type":"proceedings-article","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T12:53:20Z","timestamp":1562676800000},"page":"122-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Standard Lattices of Compatibly Embedded Finite Fields"],"prefix":"10.1145","author":[{"given":"Luca","family":"De Feo","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris Saclay - UVSQ, LMV, Versailles, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugues","family":"Randriam","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9douard","family":"Rousseau","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com ParisTech, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/ffta.2001.0344"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0138"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.07.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860870"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/322092.322099"},{"key":"e_1_3_2_1_7_1","volume-title":"Javad Doliskani, Jean-Pierre Flori, and \u00c9ric Schost.","author":"Brieulle Ludovic","year":"2017","unstructured":"Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, and \u00c9ric Schost. 2017. Computing isomorphisms and embeddings of finite fields (extended version). arXiv preprint arXiv:1705.01221 (2017). https:\/\/arxiv.org\/abs\/1705.01221"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3363"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"P. B\u00fcrgisser M. Clausen and M. A. Shokrollahi. 1997. Algebraic Complexity Theory. Springer.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-012-0070-8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465506.2465956"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608672"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.008"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9875-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087611"},{"key":"e_1_3_2_1_16_1","volume-title":"FLINT: Fast Library for Number Theory","author":"Hart William","year":"2013","unstructured":"William Hart, Fredrik Johansson, and Sebastian Pancratz. 2013. FLINT: Fast Library for Number Theory. http:\/\/flintlib.org Version 2.4.0."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/314500.314596"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1991-1052099-2"},{"volume-title":"Standard models for finite fields","author":"Lenstra Hendrick W.","key":"e_1_3_2_1_20_1","unstructured":"Hendrick W. Lenstra Jr. and Bart de Smit. 2013. Standard models for finite fields. Chapman and Hall\/CRC, Chapter 11.7 in Handbook of Finite Fields, 401--404."},{"volume-title":"WAIFI 2018 (LNCS)","author":"Narayanan Anand Kumar","key":"e_1_3_2_1_21_1","unstructured":"Anand Kumar Narayanan. 2018. Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves. In WAIFI 2018 (LNCS), Vol. 11321. Springer."},{"key":"e_1_3_2_1_22_1","unstructured":"Werner Nickel. 1988. Endliche K\u00f6rper in dem gruppentheoretischen Programmsystem GAP. (1988). https:\/\/www2.mathematik.tu-darmstadt.de\/~nickel\/"},{"key":"e_1_3_2_1_23_1","volume-title":"Implement pseudo-Conway polynomials. Trac ticket #14958. (Oct","author":"Roe David","year":"2013","unstructured":"David Roe, Jean-Pierre Flori, and Peter Bruin. 2013. Implement pseudo-Conway polynomials. Trac ticket #14958. (Oct. 2013). https:\/\/trac.sagemath.org\/ticket\/ 14958"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1025"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/309831.309859"},{"issue":"9","key":"e_1_3_2_1_26_1","first-page":"2","article-title":"GAP -- Groups, Algorithms, and Programming","volume":"4","author":"The GAP Group","year":"2018","unstructured":"The GAP Group 2018. GAP -- Groups, Algorithms, and Programming, Version 4.9.2. The GAP Group. https:\/\/www.gap-system.org","journal-title":"Version"},{"volume-title":"the Sage Mathematics Software System (Version 8.7)","author":"SageMath The Sage","key":"e_1_3_2_1_27_1","unstructured":"The Sage Developers 2019. SageMath, the Sage Mathematics Software System (Version 8.7). The Sage Developers. https:\/\/www.sagemath.org"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/304952"}],"event":{"name":"ISSAC '19: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Beijing China","acronym":"ISSAC '19"},"container-title":["Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326251","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3326229.3326251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:59Z","timestamp":1750206359000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3326229.3326251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,8]]},"references-count":28,"alternative-id":["10.1145\/3326229.3326251","10.1145\/3326229"],"URL":"https:\/\/doi.org\/10.1145\/3326229.3326251","relation":{},"subject":[],"published":{"date-parts":[[2019,7,8]]},"assertion":[{"value":"2019-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}