{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:37:01Z","timestamp":1776760621193,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540510833","type":"print"},{"value":"9783540461524","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51083-4_68","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:41:06Z","timestamp":1330202466000},"page":"310-323","source":"Crossref","is-referenced-by-count":1,"title":["A primality test using cyclotomic extensions"],"prefix":"10.1007","author":[{"given":"Preda","family":"Mihailescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.2307\/2006975","volume":"117","author":"L.M. Adleman","year":"1983","unstructured":"L.M. Adleman, C. Pomerance, R.S. Rumely: \"On Distinguishing Prime Numbers from Composite Numbers\" Ann. of. Math. v. 117, 1983, pp. 173\u2013206","journal-title":"Ann. of. Math."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"L.M.Adleman, M.A.Huang:\"Recognizing Primes in Random Polynomial Time\", STOC 1987, pp. 462\u2013469","DOI":"10.1145\/28395.28445"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"E.Bach, J.Shallit: \"Factoring with Cyclotomic Polynomials\", FOCS, 1985, pp. 443\u2013450","DOI":"10.1109\/SFCS.1985.24"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"H. Cohn: \"A Classical Invitation to Algebraic Numbers and Class Fields\", Springer Universitext,1978","DOI":"10.1007\/978-1-4612-9950-9"},{"key":"26_CR5","unstructured":"H. Cohen: \"Atkin's Primality Test\", lecture in Bonn Workshop of Foundation of Computing, Bonn, June 28-July 3, 1987"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1984-0726006-X","volume":"42","author":"H. Cohen","year":"1984","unstructured":"H. Cohen, H.W. Lenstra,Jr.: \"Primality Testing and Jacobi Sums\", Math of Comp., vol 42, 1984, pp. 297\u2013330","journal-title":"Math of Comp."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"S.Goldwasser, J.Killian: \"Almost all Primes Can Be Quickly Certified\", STOC 1986, pp. 316\u2013329","DOI":"10.1145\/12130.12162"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"M.A.Huang: \" Riemann Hypothesis and Finding Roots over Finite Fields\", STOC 1984, pp. 121\u2013130","DOI":"10.1145\/22145.22159"},{"key":"26_CR9","unstructured":"S.Lang: \"Algebra\", Addison & Wesley"},{"key":"26_CR10","unstructured":"H.W.Lenstra,Jr.: \"Primality Testing Algorithms\", in Lecture Notes in Mathematics vol 901, pp. 243\u2013258"},{"key":"26_CR11","unstructured":"H.W.Lenstra,Jr.: \"Galois Theory and Primality Testing\", in Lecture Notes in Mathematics vol 1142, pp. 243\u2013258"},{"key":"26_CR12","unstructured":"H.W.Lenstra,Jr.: \"Elliptic Curves and Number Theoretic Algorithms\", Report nr. 86-19, University of Amsterdam, Dept. of mathematics"},{"key":"26_CR13","unstructured":"A.K.Lenstra, H.W.Lenstra,Jr.: \"Algorithms in Number Theory\", University of Chicago, Technical Report 87-008, May 1987"},{"key":"26_CR14","volume-title":"\"Computaional Methods in Number Theory', Mathematical Centre Tracts, 154\/155","year":"1986","unstructured":"H.W. Lenstra,Jr. and R. Tijdeman (eds), \"Computaional Methods in Number Theory', Mathematical Centre Tracts, 154\/155, Mathematisch Centrum, Amsterdam 1986"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"M.O. Rabin: \"Probabilistic Algorithms for Testing Primality\", J. of Number Theory vol. 12, 1980, pp. 128\u2013138","journal-title":"J. of Number Theory"},{"key":"26_CR16","unstructured":"H.Riesel: \"Prime Numbers and Computer Methods for Factorization\", Birkh\u00e4user Progr. Math. vol. 57\/85"},{"key":"26_CR17","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"R. Solovay, V. Strassen: \"A fast Monte-Carlo Test for Primarlity\" SIAM J. of Comput. vol. 6, 1977, pp. 84\u201385. erratum, ibid., vol. 7,1978, p. 118","journal-title":"SIAM J. of Comput."},{"key":"26_CR18","first-page":"127","volume":"5","author":"H.C. Williams","year":"1978","unstructured":"H.C. Williams: \"Primality Testing on a Computer\", Ars Combin. 5 (1978) pp.127\u2013185","journal-title":"Ars Combin."}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51083-4_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:46Z","timestamp":1605647986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51083-4_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510833","9783540461524"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-51083-4_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}