{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:02:00Z","timestamp":1760061720697},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf02124680","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T12:19:53Z","timestamp":1126700393000},"page":"199-206","source":"Crossref","is-referenced-by-count":18,"title":["Factoring polynomials modulo special primes"],"prefix":"10.1007","volume":"9","author":[{"given":"L.","family":"R\u00f3nyai","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02124680_CR1","doi-asserted-by":"crossref","unstructured":"L.Adleman, G.Miller and K.Manders, On taking roots in finite fields;Proc. 18th IEEE Symp. on Foundations of Computer Science, (1977), 175\u2013178.","DOI":"10.1109\/SFCS.1977.18"},{"key":"BF02124680_CR2","unstructured":"E. R.Berlekamp,Algebraic coding theory; McGraw-Hill, 1968."},{"key":"BF02124680_CR3","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E. R. Berlekamp","year":"1970","unstructured":"E. R. Berlekamp, Factoring polynomials over large finite fields;Math. Computation,24 (1970), 713\u2013735.","journal-title":"Math. Computation"},{"key":"BF02124680_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(87)90081-8","volume":"52","author":"J. Gathen von zur","year":"1987","unstructured":"J. von zur Gathen, Factoring polynomials and primitive elements for special primes;Theoretical Computer Science,52 (1987), 77\u201389.","journal-title":"Theoretical Computer Science"},{"key":"BF02124680_CR5","doi-asserted-by":"crossref","unstructured":"M. A.Huang, Riemann Hypothesis and finding roots over finite fields;Proc. 17th ACM Symp. on Theory of Computing, (1985), 121\u2013130.","DOI":"10.1145\/22145.22159"},{"key":"BF02124680_CR6","unstructured":"D. E.Knuth,The art of computer programming; Vol. 2, Seminumerical algorithms Addison-Wesley Publishing Co., 1981."},{"key":"BF02124680_CR7","unstructured":"R.Lidl and H.Niederreiter,Finite fields; Addison-Wesley Publishing Co., 1983."},{"key":"BF02124680_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1977-0422193-8","volume":"31","author":"R. T. Moenck","year":"1977","unstructured":"R. T. Moenck, On the efficiency of algorithms for polynomial factoring;Mathematics of Computation,31 (1977), 235\u2013250.","journal-title":"Mathematics of Computation"},{"key":"BF02124680_CR9","doi-asserted-by":"crossref","unstructured":"L.R\u00f3nyai, Factoring polynomials over finite fields;Proc. 28th IEEE Symp. on Foundations of Computer Science, (1987), 132\u2013137.","DOI":"10.1109\/SFCS.1987.25"},{"key":"BF02124680_CR10","first-page":"483","volume":"44","author":"R. J. Schoof","year":"1985","unstructured":"R. J. Schoof, Elliptic curves over finite fields and the computation of square roots modp;Mathematics of Computation,44 (1985), 483\u2013494.","journal-title":"Mathematics of Computation"},{"key":"BF02124680_CR11","first-page":"217","volume-title":"Proc. 1972 Number Theory Conference","author":"D. Shanks","year":"1972","unstructured":"D. Shanks, Five number-theoretic algorithms; inProc. 1972 Number Theory Conference, University of Colorado, Boulder, 1972, 217\u2013224."},{"key":"BF02124680_CR12","unstructured":"A.Tonelli,G\u00f6ttinger Nachrichten, (1891), 344\u2013346. Also in L. E.Dickson,History of the theory of numbers, Chelsea, New York, Vol. I, 215."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02124680.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02124680\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02124680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:31:09Z","timestamp":1557783069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02124680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF02124680"],"URL":"https:\/\/doi.org\/10.1007\/bf02124680","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}