{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:29:04Z","timestamp":1776846544152,"version":"3.51.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf01212964","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T08:00:21Z","timestamp":1109318421000},"page":"360-394","source":"Crossref","is-referenced-by-count":21,"title":["Efficient and optimal exponentiation in finite fields"],"prefix":"10.1007","volume":"1","author":[{"given":"Joachim","family":"von zur Gathen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/3-540-45961-8_22","volume-title":"Advances in Cryptology?EUROCRYPT'88","author":"G. B. Agnew","year":"1988","unstructured":"G. B. Agnew, R. C. Mullin, andS. A. Vanstone, Fast exponentiation inGF(2 n ). InAdvances in Cryptology?EUROCRYPT'88, ed.C. G. G\u00fcnther, vol. 330 ofLecture Notes in Computer Science. Springer (Berlin), 1988, 251?255."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(87)90031-7","volume":"26","author":"J. Berstel","year":"1987","unstructured":"J. Berstel andS. Brlek, On the length of word chains.Inform. Process. Lett. 26 (1987), 23?28.","journal-title":"Inform. Process. Lett."},{"key":"CR3","series-title":"Lecture Notes in Computer Science","first-page":"302","volume-title":"Advances in Cryptology?CRYPTO'86","author":"T. Beth","year":"1986","unstructured":"T. Beth, B. M. Cook, andD. Gollmann, Architectures for exponentiation inGF(2 n ). InAdvances in Cryptology?CRYPTO'86, ed.A. M. Odlyzko, vol. 263 ofLecture Notes in Computer Science. Springer (Berlin), 1986, 302?310."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/44483.44496","volume":"35","author":"F. Fich","year":"1988","unstructured":"F. Fich andM. Tompa, The parallel complexity of exponentiating polynomials over finite fields.J. Assoc. Comput. Mach. 35 (1988), 651?667.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1137\/0216060","volume":"16","author":"J. Gathen von zur","year":"1987","unstructured":"J. von zur Gathen, Computing powers in parallel.SIAM J. Comput. 16 (1987), 930?945.","journal-title":"SIAM J. Comput."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0747-7171(08)80028-4","volume":"9","author":"J. Gathen von zur","year":"1990","unstructured":"J. von zur Gathen, Inversion in finite fields using logarithmic depth.J. Symb. Comp. 9 (1990), 175?183.","journal-title":"J. Symb. Comp."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"J. von zur Gathen, Processor-efficient exponentiation in finite fields. Inform. Process. Lett., to appear, 1992.","DOI":"10.1016\/0020-0190(92)90259-X"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0747-7171(08)80158-7","volume":"10","author":"J. Gathen von zur","year":"1990","unstructured":"J. von zur Gathen andM. Giesbrecht, Constructing normal bases in finite fields.J. Symb. Comp. 10 (1990), 547?570.","journal-title":"J. Symb. Comp."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(91)90078-G","volume":"91","author":"J. Gathen von zur","year":"1991","unstructured":"J. von zur Gathen andG. Seroussi, Boolean circuits versus arithmetic circuits.Inform. and Comput. 91 (1991), 142?154.","journal-title":"Inform. and Comput."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1007\/BF01137457","volume":"42","author":"P. N. Golovanov","year":"1987","unstructured":"P. N. Golovanov andV. I. Solodovnikov, Rapid parallel calculation of degrees in a quotient ring of polynomials over a finite field.Mathematical Notes 42 (1987), 987?992.","journal-title":"Mathematical Notes"},{"key":"CR11","volume-title":"The Art of Computer Programming, Vol. 2, Seminumerical Algorithms","author":"D. E. Knuth","year":"1981","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. Addison-Wesley (Reading MA), 2 edition, 1981.","edition":"2 edition"},{"key":"CR12","unstructured":"Th. Lengauer and K. Mehlhorn, VLSI complexity, efficient VLSI algorithms and the HILL design system. InAlgorithmics for VLSI, ed.C. Trullemans. Academic Press, 1986, 33?89."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G. W. Reitwiesner","year":"1960","unstructured":"G. W. Reitwiesner, Binary arithmetic.Advances in computers, ed. F. L. Alt 1 (1960), 231?308.","journal-title":"Advances in computers, ed. F. L. Alt"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1137\/0219049","volume":"19","author":"D. R. Stinson","year":"1990","unstructured":"D. R. Stinson, Some observations on parallel algorithms for fast exponentiation inGF(2 n ).SIAM J. Comput. 19 (1990), 711?717.","journal-title":"SIAM J. Comput."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TC.1985.1676616","volume":"34","author":"C. C. Wang","year":"1985","unstructured":"C. C. Wang, T. K. Truong, H. M. Shao, L. J. Deutsch, J. K. Omura, andI. S. Reed, VLSI architectures for computing multiplications and inverses inGF(2 m ).IEEE Trans. Comput. C-34 (1985), 709?717.","journal-title":"IEEE Trans. Comput. C"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01212964.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01212964\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01212964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:47:12Z","timestamp":1556776032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01212964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01212964"],"URL":"https:\/\/doi.org\/10.1007\/bf01212964","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}