{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:37:37Z","timestamp":1648874257645},"reference-count":14,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10151,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0012-365x(85)90017-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:31:50Z","timestamp":1027654310000},"page":"101-109","source":"Crossref","is-referenced-by-count":5,"title":["Algebraic algorithms in GF(q)"],"prefix":"10.1016","volume":"56","author":[{"given":"J.","family":"Calmet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(85)90017-2_BIB1","unstructured":"ALDES\/SAC2 Documentation. Available from either R. Loos (Univ. Karlsruhe) or G.E. Collins (Univ. Wisconsin-Madison)."},{"key":"10.1016\/0012-365X(85)90017-2_BIB2","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","article-title":"Factoring polynomials over large finite fields","volume":"24","author":"Berlekamp","year":"1970","journal-title":"Math. Comp."},{"key":"10.1016\/0012-365X(85)90017-2_BIB3","series-title":"Computer Algebra\u2014EUROCAM 82","first-page":"117","volume":"144","author":"Calmet","year":"1982"},{"key":"10.1016\/0012-365X(85)90017-2_BIB4","first-page":"1","article-title":"Can Rabin's probabilistic factorization algorithm for large finite fields replace the Hensel construction?","volume":"2","author":"Calmet","year":"1982","journal-title":"Bull. CALSYF"},{"key":"10.1016\/0012-365X(85)90017-2_BIB5","article-title":"A SAC2 implementation of GF(q) algorithms","author":"Calmet","year":"1983","journal-title":"Univ. Karlsruhe Report"},{"key":"10.1016\/0012-365X(85)90017-2_BIB6","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0020-0190(80)90011-3","article-title":"An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)","volume":"11","author":"Calmet","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(85)90017-2_BIB7","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1109\/TIT.1983.1056666","article-title":"Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials","volume":"29","author":"Camion","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(85)90017-2_BIB8","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","article-title":"A new algorithm for factorizing polynomials over finite fields","volume":"36","author":"Cantor","year":"1981","journal-title":"Math. Comp."},{"key":"10.1016\/0012-365X(85)90017-2_BIB9","first-page":"221","article-title":"Computer algebra systems","volume":"4","author":"van Hulzen","year":"1983"},{"key":"10.1016\/0012-365X(85)90017-2_BIB10","series-title":"The Art of Computer Programming","author":"Knuth","year":"1981"},{"key":"10.1016\/0012-365X(85)90017-2_BIB11","series-title":"Computer algebra\u2014EUROCAM 82","first-page":"126","volume":"144","author":"Lazard","year":"1982"},{"key":"10.1016\/0012-365X(85)90017-2_BIB12","series-title":"Proc. Symp. on Algorithms and complexity","first-page":"21","article-title":"Probabilistic Algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0012-365X(85)90017-2_BIB13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","article-title":"Probabilistic algorithms for testing primality","volume":"12","author":"Rabin","year":"1980","journal-title":"J. Number Theory"},{"key":"10.1016\/0012-365X(85)90017-2_BIB14","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","article-title":"Probabilistic algorithms in finite fields","volume":"9","author":"Rabin","year":"1980","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900172?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85900172?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:27:21Z","timestamp":1555154841000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X85900172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0012365X85900172"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(85)90017-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}