{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T04:35:11Z","timestamp":1776832511476,"version":"3.51.2"},"reference-count":8,"publisher":"American Mathematical Society (AMS)","issue":"232","license":[{"start":{"date-parts":[[2001,4,13]],"date-time":"2001-04-13T00:00:00Z","timestamp":987120000000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>\n                    We give a method for efficiently computing isomorphisms between towers of Artin-Schreier extensions over a finite field. We find that isomorphisms between towers of degree\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"p Superscript n\">\n                        <mml:semantics>\n                          <mml:msup>\n                            <mml:mi>p<\/mml:mi>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:msup>\n                          <mml:annotation encoding=\"application\/x-tex\">p^n<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    over a fixed field\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"double-struck upper F Subscript q\">\n                        <mml:semantics>\n                          <mml:msub>\n                            <mml:mrow class=\"MJX-TeXAtom-ORD\">\n                              <mml:mi mathvariant=\"double-struck\">F<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mi>q<\/mml:mi>\n                          <\/mml:msub>\n                          <mml:annotation encoding=\"application\/x-tex\">\\mathbb {F}_q<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    can be computed, composed, and inverted in time essentially linear in\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"p Superscript n\">\n                        <mml:semantics>\n                          <mml:msup>\n                            <mml:mi>p<\/mml:mi>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:msup>\n                          <mml:annotation encoding=\"application\/x-tex\">p^n<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . The method relies on an approximation process.\n                  <\/p>","DOI":"10.1090\/s0025-5718-00-01193-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T18:17:31Z","timestamp":1027707451000},"page":"1625-1631","source":"Crossref","is-referenced-by-count":11,"title":["Isomorphisms between Artin-Schreier towers"],"prefix":"10.1090","volume":"69","author":[{"given":"Jean-Marc","family":"Couveignes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2000,4,13]]},"reference":[{"issue":"2","key":"1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0097-3165(89)90020-4","article-title":"On arithmetical algorithms over finite fields","volume":"50","author":"Cantor, David G.","year":"1989","journal-title":"J. Combin. Theory Ser. A","ISSN":"https:\/\/id.crossref.org\/issn\/0097-3165","issn-type":"print"},{"key":"2","isbn-type":"print","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-61581-4_41","article-title":"Computing \ud835\udc59-isogenies using the \ud835\udc5d-torsion","author":"Couveignes, Jean-Marc","year":"1996","ISBN":"https:\/\/id.crossref.org\/isbn\/3540615814"},{"key":"3","isbn-type":"print","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/amsip\/007\/03","article-title":"Elliptic and modular curves over finite fields and related computational issues","author":"Elkies, Noam D.","year":"1998","ISBN":"https:\/\/id.crossref.org\/isbn\/082180880X"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Reynald Lercier and Fran\u00e7ois Morain, Counting the number of points on elliptic curves over finite fields: strategies and performances, Advances in Cryptology, EUROCRYPT 95 (L.C. Guillou and J.-J. Quisquater, eds.), Lecture Notes in Computer Science, vol. 921, Springer, 1995, pp. 79\u201394.","DOI":"10.1007\/3-540-49264-X_7"},{"key":"5","isbn-type":"print","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-49264-X_7","article-title":"Counting the number of points on elliptic curves over finite fields: strategies and performances","author":"Lercier, Reynald","year":"1995","ISBN":"https:\/\/id.crossref.org\/isbn\/3540594094"},{"issue":"1","key":"6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.5802\/jtnb.142","article-title":"Counting points on elliptic curves over finite fields","volume":"7","author":"Schoof, Ren\u00e9","year":"1995","journal-title":"J. Th\\'{e}or. Nombres Bordeaux","ISSN":"https:\/\/id.crossref.org\/issn\/1246-7405","issn-type":"print"},{"key":"7","series-title":"Publications de l'Institut de Math\\'{e}matique de l'Universit\\'{e} de Nancago, VII","volume-title":"Groupes alg\\'{e}briques et corps de classes","author":"Serre, Jean-Pierre","year":"1959"},{"key":"8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01404549","article-title":"Endomorphisms of abelian varieties over finite fields","volume":"2","author":"Tate, John","year":"1966","journal-title":"Invent. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0020-9910","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2000-69-232\/S0025-5718-00-01193-5\/S0025-5718-00-01193-5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2000-69-232\/S0025-5718-00-01193-5\/S0025-5718-00-01193-5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T22:27:13Z","timestamp":1776724033000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2000-69-232\/S0025-5718-00-01193-5\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4,13]]},"references-count":8,"journal-issue":{"issue":"232","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0025-5718-00-01193-5"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-00-01193-5","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4,13]]}}}