{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:53:44Z","timestamp":1776848024962,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,26]],"date-time":"2013-06-26T00:00:00Z","timestamp":1372204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,26]]},"DOI":"10.1145\/2465506.2465956","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"165-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Fast algorithms for\n            <i>l<\/i>\n            -adic towers over finite fields"],"prefix":"10.1145","author":[{"given":"Luca","family":"De Feo","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Versailles, Paris, France"}]},{"given":"Javad","family":"Doliskani","sequence":"additional","affiliation":[{"name":"Western University, London, ON, Canada"}]},{"given":"Eric","family":"Schost","sequence":"additional","affiliation":[{"name":"Western University, London, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2013,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"169","volume-title":"Congressus Numerantium","volume":"200","author":"Benjamin A. T.","year":"2010","unstructured":"A. T. Benjamin . The Lucas triangle recounted . In Congressus Numerantium , volume 200 , pages 169 -- 177 , 2010 . A. T. Benjamin. The Lucas triangle recounted. In Congressus Numerantium, volume 200, pages 169--177, 2010."},{"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\/0097-3165(89)90020-4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-00-01193-5"},{"key":"e_1_3_2_1_6_1","volume-title":"July","author":"Couveignes J.-M.","year":"2011","unstructured":"J.-M. Couveignes and R. Lercier . Fast construction of irreducible polynomials over finite fields. To appear in the Israel Journal of Mathematics , July 2011 . J.-M. Couveignes and R. Lercier. Fast construction of irreducible polynomials over finite fields. To appear in the Israel Journal of Mathematics, July 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnt.2010.07.003"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.008"},{"key":"e_1_3_2_1_9_1","volume-title":"A note on computations in degree 2k-extensions of finite fields","author":"Doliskani J.","year":"2012","unstructured":"J. Doliskani and \u00c9. Schost. A note on computations in degree 2k-extensions of finite fields , 2012 . Manuscript . J. Doliskani and \u00c9. Schost. A note on computations in degree 2k-extensions of finite fields, 2012. Manuscript."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-09-02199-1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.09.003"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-2011-11196-1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888390.1888413"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"key":"e_1_3_2_1_15_1","first-page":"79","volume-title":"Computer Algebra Systems: A Practical Guide.","author":"Koepf W.","year":"1999","unstructured":"W. Koepf . Efficient computation of chebyshev polynomials in computer algebra . Computer Algebra Systems: A Practical Guide. , pages 79 -- 99 , 1999 . W. Koepf. Efficient computation of chebyshev polynomials in computer algebra. Computer Algebra Systems: A Practical Guide., pages 79--99, 1999."},{"key":"e_1_3_2_1_17_1","volume-title":"Springer","author":"Lang S.","year":"2002","unstructured":"S. Lang . Algebra. Springer , 3 rd edition, Jan. 2002 . S. Lang. Algebra. Springer, 3rd edition, Jan. 2002.","edition":"3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442864"},{"key":"e_1_3_2_1_19_1","volume-title":"Conics - a Poor Man's Elliptic Curves","author":"Lemmermeyer F.","year":"2003","unstructured":"F. Lemmermeyer . Conics - a Poor Man's Elliptic Curves , 2003 . F. Lemmermeyer. Conics - a Poor Man's Elliptic Curves, 2003."},{"issue":"2","key":"e_1_3_2_1_20_1","first-page":"182","article-title":"Solving the Pell equation","volume":"49","author":"Lenstra H. W.","year":"2002","unstructured":"H. W. Lenstra . Solving the Pell equation . Notices of the AMS , 49 ( 2 ): 182 -- 192 , 2002 . H. W. Lenstra. Solving the Pell equation. Notices of the AMS, 49(2):182--192, 2002.","journal-title":"Notices of the AMS"},{"key":"e_1_3_2_1_21_1","volume-title":"Standard models for finite fields: the definition","author":"Lenstra H. W.","year":"2008","unstructured":"H. W. Lenstra and B. De Smit . Standard models for finite fields: the definition , 2008 . H. W. Lenstra and B. De Smit. Standard models for finite fields: the definition, 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.0427"},{"key":"e_1_3_2_1_23_1","volume-title":"Speeding the pollard and elliptic curve methods of factorization. Math. Comp., 48(177)","author":"Montgomery P. L.","year":"1987","unstructured":"P. L. Montgomery . Speeding the pollard and elliptic curve methods of factorization. Math. Comp., 48(177) , 1987 . P. L. Montgomery. Speeding the pollard and elliptic curve methods of factorization. Math. Comp., 48(177), 1987."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258792"},{"key":"e_1_3_2_1_25_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/978-3-540-45146-4_21","volume-title":"Advances in Cryptology - CRYPTO","author":"Rubin K.","year":"2003","unstructured":"K. Rubin and A. Silverberg . Torus-Based cryptography . In D. Boneh, editor, Advances in Cryptology - CRYPTO 2003 , volume 2729 of Lecture Notes in Computer Science , pages 349 -- 365 , Berlin, Heidelberg , 2003. Springer Berlin \/ Heidelberg . K. Rubin and A. Silverberg. Torus-Based cryptography. In D. Boneh, editor, Advances in Cryptology - CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 349--365, Berlin, Heidelberg, 2003. Springer Berlin \/ Heidelberg."},{"key":"e_1_3_2_1_26_1","series-title":"Fields Institute Communications","volume-title":"High Primes and Misdemeanours: Lectures in Honour of the 60th birthday of Hugh Cowie Williams","author":"Rubin K.","year":"2004","unstructured":"K. Rubin and A. Silverberg . Algebraic tori in cryptography . In High Primes and Misdemeanours: Lectures in Honour of the 60th birthday of Hugh Cowie Williams , volume 41 of Fields Institute Communications . AMS , 2004 . K. Rubin and A. Silverberg. Algebraic tori in cryptography. In High Primes and Misdemeanours: Lectures in Honour of the 60th birthday of Hugh Cowie Williams, volume 41 of Fields Institute Communications. AMS, 2004."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1990-0993933-0"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1025"},{"key":"e_1_3_2_1_29_1","unstructured":"V. Shoup. NTL: A library for doing number theory. http:\/\/www.shoup.net\/ntl 2003.  V. Shoup. NTL: A library for doing number theory. http:\/\/www.shoup.net\/ntl 2003."},{"key":"e_1_3_2_1_30_1","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69904-2","volume-title":"The arithmetic of dynamical systems","author":"Silverman J. H.","year":"2007","unstructured":"J. H. Silverman . The arithmetic of dynamical systems , volume 241 of Graduate Texts in Mathematics . Springer , 2007 . J. H. Silverman. The arithmetic of dynamical systems, volume 241 of Graduate Texts in Mathematics. Springer, 2007."},{"key":"e_1_3_2_1_31_1","volume-title":"Sage Mathematics Software (Version 5.5)","author":"Stein W. A.","year":"2013","unstructured":"W. A. Stein and Others. Sage Mathematics Software (Version 5.5) . The Sage Development Team , 2013 . W. A. Stein and Others. Sage Mathematics Software (Version 5.5). The Sage Development Team, 2013."},{"key":"e_1_3_2_1_32_1","first-page":"238","article-title":"Isog\u00e9nies entre courbes elliptiques","volume":"273","author":"V\u00e9lu J.","year":"1971","unstructured":"J. V\u00e9lu . Isog\u00e9nies entre courbes elliptiques . Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris , 273 : 238 -- 241 , 1971 . J. V\u00e9lu. Isog\u00e9nies entre courbes elliptiques. Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris, 273:238--241, 1971.","journal-title":"Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris"},{"key":"e_1_3_2_1_33_1","volume-title":"Modern computer algebra","author":"von zur Gathen J.","year":"1999","unstructured":"J. von zur Gathen and J. Gerhard . Modern computer algebra . Cambridge University Press , New York, NY, USA , 1999 . J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, New York, NY, USA, 1999."},{"key":"e_1_3_2_1_34_1","volume-title":"Algebraic groups and their birational invariants","author":"Voskresenski\u012d V. E.","year":"1998","unstructured":"V. E. Voskresenski\u012d . Algebraic groups and their birational invariants , volume 179 . American Mathematical Society , 1998 . V. E. Voskresenski\u012d. Algebraic groups and their birational invariants, volume 179. American Mathematical Society, 1998."}],"event":{"name":"ISSAC'13: International Symposium on Symbolic and Algebraic Computation","location":"Boston Maine USA","acronym":"ISSAC'13","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465956","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2465506.2465956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:36Z","timestamp":1750234716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2465506.2465956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,26]]},"references-count":33,"alternative-id":["10.1145\/2465506.2465956","10.1145\/2465506"],"URL":"https:\/\/doi.org\/10.1145\/2465506.2465956","relation":{},"subject":[],"published":{"date-parts":[[2013,6,26]]},"assertion":[{"value":"2013-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}