{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:59:48Z","timestamp":1774335588966,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,7,1]],"date-time":"1979-07-01T00:00:00Z","timestamp":299635200000},"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":12435,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979,7]]},"DOI":"10.1016\/0304-3975(79)90002-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"1-16","source":"Crossref","is-referenced-by-count":19,"title":["Fast verification, testing, and generation of large primes"],"prefix":"10.1016","volume":"9","author":[{"given":"David A.","family":"Plaisted","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90002-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(79)90002-1_BIB2","first-page":"89","article-title":"Some factorizations of 2n \u00b1 1 and related results","volume":"21","author":"Brillhart","year":"1967","journal-title":"Math. Comp."},{"key":"10.1016\/0304-3975(79)90002-1_BIB3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.2307\/2972687","article-title":"On the composite numbers p which satisfy the Fermat congruence ap\u22121 \u2261 1 mod p","volume":"19","author":"Carmichael","year":"1912","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/0304-3975(79)90002-1_BIB4","author":"Hardy","year":"1954","journal-title":"An Introduction to the Theory of Numbers"},{"key":"10.1016\/0304-3975(79)90002-1_BIB5","volume":"Vol. 2","author":"Knuth","year":"1969"},{"key":"10.1016\/0304-3975(79)90002-1_BIB6","series-title":"STAN-CS-76-538","article-title":"Analysis of a simple factorization algorithm","author":"Knuth","year":"1976"},{"key":"10.1016\/0304-3975(79)90002-1_BIB7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1090\/S0002-9904-1927-04368-3","article-title":"Tests for primality by the converse of Fermat's theorem","volume":"33","author":"Lehmer","year":"1927","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/0304-3975(79)90002-1_BIB8","doi-asserted-by":"crossref","first-page":"302","DOI":"10.2307\/2369308","article-title":"Th\u00e9orie des fonctions num\u00e9riques simplement p\u00e9riodiques","volume":"1","author":"Lucas","year":"1878","journal-title":"Am. J. Math."},{"key":"10.1016\/0304-3975(79)90002-1_BIB9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0025-5718-1975-0366796-6","article-title":"On factorisation, with a suggested new approach","volume":"29","author":"Miller","year":"1975","journal-title":"Math. Comp."},{"key":"10.1016\/0304-3975(79)90002-1_BIB10","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1972"},{"key":"10.1016\/0304-3975(79)90002-1_BIB11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succint certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(79)90002-1_BIB12","series-title":"Algorithms and Complexity: New Directions and Recent Results","first-page":"21","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0304-3975(79)90002-1_BIB13","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte Carlo tests for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:23:44Z","timestamp":1555125824000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,7]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,7]]}},"alternative-id":["0304397579900021"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90002-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,7]]}}}