{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:38:09Z","timestamp":1649029089880},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":[[1993,12]]},"DOI":"10.1007\/bf01275488","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T08:08:55Z","timestamp":1111651735000},"page":"355-367","source":"Crossref","is-referenced-by-count":6,"title":["Primality testing with fewer random bits"],"prefix":"10.1007","volume":"3","author":[{"given":"Ren\ufffd","family":"Peralta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0022-0000(91)90038-7","volume":"42","author":"E. Bach","year":"1991","unstructured":"E. Bach. Realistic analysis of some randomized algorithms.J. Comput. System Sci. 42 (1991), 30?53.","journal-title":"J. Comput. System Sci."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0747-7171(08)80011-9","volume":"9","author":"E. Bach","year":"1990","unstructured":"E. Bach andV. Shoup. Factoring polynomials with fewer random bits.J. Symbolic Comput 9 (1990), 229?239.","journal-title":"J. Symbolic Comput"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"A. Cohen and A. Wigderson. Dispersers, deterministic amplifications, and weak random sources. In30th Annual Symposium on Foundations of Computer Science, 1989, 14?19.","DOI":"10.1109\/SFCS.1989.63449"},{"key":"CR4","unstructured":"G. H. Hardy and E. M. Wright.An Introduction to the Theory of Numbers. Oxford University Press, fifth edition, 1984."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and D. Zuckermann. How to recycle random bits. In30th Annual Symposium on Foundations of Computer Science, 1989, 248?253.","DOI":"10.1109\/SFCS.1989.63486"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1145\/174130.174132","volume":"40","author":"H. J. Karloff","year":"1993","unstructured":"H. J. Karloff andP. Raghavan. Randomized algorithms and pseudorandom numbers.Journal of the Association for Computing Machinery 40 (1993), 454?476.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR7","unstructured":"R. Lidl and H. Niederreiter.Finite Fields. Addison-Wesley, 1983."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G. Miller","year":"1976","unstructured":"G. Miller. Riemann's hypothesis and tests for primality.J. Comput. System Sci. 13 (1976), 300?317.","journal-title":"J. Comput. System Sci."},{"key":"CR9","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 12 (1980), 128?138.","journal-title":"J. of Number Theory"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"R. Solovay andV. Strassen. A fast Monte-Carlo test for primality.SIAM J. Comput. 6 (1977), 84?85.","journal-title":"SIAM J. Comput."}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01275488.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01275488\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01275488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:15:04Z","timestamp":1556648104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01275488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF01275488"],"URL":"https:\/\/doi.org\/10.1007\/bf01275488","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}