{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:42:25Z","timestamp":1776847345711,"version":"3.51.2"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1988,1]]},"DOI":"10.1007\/bf00206325","type":"journal-article","created":{"date-parts":[[2004,9,3]],"date-time":"2004-09-03T00:02:49Z","timestamp":1094169769000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["The generation of random numbers that are probably prime"],"prefix":"10.1007","volume":"1","author":[{"given":"Pierre","family":"Beauchemin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Brassard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Cr\u00e9peau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Goutier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Pomerance","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00206325_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., and M.-D. Huang, Recognizing primes in random polynomial time, Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pp. 462\u2013469, 1987.","DOI":"10.1145\/28395.28445"},{"key":"BF00206325_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.2307\/2006975","volume":"vol. 117","author":"L. Adleman","year":"1983","unstructured":"Adleman, L., C. Pomerance, and R. Rumely, On distinguishing prime numbers from composite numbers, Annals of Mathematics, vol. 117, pp. 173\u2013206, 1983.","journal-title":"Annals of Mathematics"},{"key":"BF00206325_CR3","unstructured":"Babai, L., Monte Carlo algorithms in graph isomorphism testing, Rapport de Recherches du D\u00e9partement de Math\u00e9matiques et de Statistiques, D.M.S. # 79-10, Universit\u00e9 de Montr\u00e9al, 1979."},{"issue":"no. 152","key":"BF00206325_CR4","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1090\/S0025-5718-1980-0583518-6","volume":"vol. 35","author":"R. Baillie","year":"1980","unstructured":"Baillie, R., and S. S. Wagstaff, Jr., Lucas pseudoprimes, Mathematics of Computation, vol. 35, no. 152, pp. 1392\u20131417, 1980.","journal-title":"Mathematics of Computation"},{"key":"BF00206325_CR5","first-page":"443","volume-title":"Advances in Cryptology\u2014Crypto 86 Proceedings","author":"P. Beauchemin","year":"1987","unstructured":"Beauchemin, P., G. Brassard, C. Cr\u00e9peau, and C. Goutier, Two observations on probabilistic primality testing, Advances in Cryptology\u2014Crypto 86 Proceedings, Springer-Verlag, New York, pp. 443\u2013450, 1987."},{"key":"BF00206325_CR6","volume-title":"Algorithmics: Theory and Practice","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., and P. Bratley, Algorithmics: Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey, 1988."},{"issue":"no. 177","key":"BF00206325_CR7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1090\/S0025-5718-1987-0866102-2","volume":"vol. 48","author":"H. Cohen","year":"1987","unstructured":"Cohen, H., and A. K. Lenstra, Implementation of a new primality test, Mathematics of Computation, vol. 48, no. 177, pp. 103\u2013121, 1987.","journal-title":"Mathematics of Computation"},{"issue":"nos. 5\/6","key":"BF00206325_CR8","first-page":"231","volume":"vol. 37","author":"C. Couvreur","year":"1982","unstructured":"Couvreur, C., and J.-J. Quisquater, An introduction to fast generation of large prime numbers, Philips Journal of Research, vol. 37, nos. 5\/6, pp. 231\u2013264, 1982.","journal-title":"Philips Journal of Research"},{"issue":"no. 173","key":"BF00206325_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1090\/S0025-5718-1986-0815848-X","volume":"vol. 46","author":"P. Erd\u00f6s","year":"1986","unstructured":"Erd\u00f6s, P., and C. Pomerance, On the number of false witnesses for a composite number, Mathematics of Computation, vol. 46, no. 173, pp. 259\u2013279, 1986.","journal-title":"Mathematics of Computation"},{"issue":"no. 4","key":"BF00206325_CR10","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","volume":"vol. 6","author":"J. Gill","year":"1977","unstructured":"Gill, J., Computational complexity of probabilistic Turing machines, SIAM Journal on Computing, vol. 6, no. 4, pp. 675\u2013695, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"BF00206325_CR11","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., and J. Kilian, Almost all primes can be quickly certified, Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, pp. 316\u2013329,1986.","DOI":"10.1145\/12130.12162"},{"key":"BF00206325_CR12","unstructured":"Hardy, G. H., and E. M. Wright, An Introduction to the Theory of Numbers, Fifth edition, Oxford Science Publications, 1979."},{"key":"BF00206325_CR13","volume-title":"The Art of Computer Programming, Volume 2","author":"D. E. Knuth","year":"1981","unstructured":"Knuth, D. E., The Art of Computer Programming, Volume 2, Second edition, Addison-Wesley, Reading, Massachusetts, 1981.","edition":"Second edition"},{"key":"BF00206325_CR14","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Primality and Cryptography, Wiley-Teubner Series in Computer Science, 1986.","DOI":"10.1007\/978-3-322-96647-6"},{"key":"BF00206325_CR15","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"vol. 13","author":"G. L. Miller","year":"1976","unstructured":"Miller, G. L., Riemann's hypothesis and tests for primality, Journal of Computer and System Sciences, vol. 13, pp. 300\u2013317, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF00206325_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(80)90007-9","volume":"vol. 11","author":"L. Monier","year":"1980","unstructured":"Monier, L., Evaluation and comparison of two efficient probabilistic primality testing algorithms, Theoretical Computer Science, vol. 11, pp. 97\u2013108, 1980.","journal-title":"Theoretical Computer Science"},{"issue":"no. 6","key":"BF00206325_CR17","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1038\/scientificamerican1282-136","volume":"vol. 247","author":"C. Pomerance","year":"1982","unstructured":"Pomerance, C., The search for prime numbers, Scientific American, vol. 247, no. 6, pp. 136\u2013147, 1982.","journal-title":"Scientific American"},{"issue":"no. 151","key":"BF00206325_CR18","first-page":"1003","volume":"vol. 35","author":"C. Pomerance","year":"1980","unstructured":"Pomerance, C., J. L. Selfridge, and S. S. Wagstaff, Jr., The pseudoprimes to 25.109, Mathematics of Computation, vol. 35, no. 151, pp. 1003\u20131026, 1980.","journal-title":"Mathematics of Computation"},{"issue":"no. 3","key":"BF00206325_CR19","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","volume":"vol. 4","author":"V. Pratt","year":"1975","unstructured":"Pratt, V., Every prime has a succinct certificate, SIAM Journal on Computing, vol. 4, no. 3, pp. 214\u2013220, 1975.","journal-title":"SIAM Journal on Computing"},{"key":"BF00206325_CR20","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"vol. 12","author":"M. O. Rabin","year":"1980","unstructured":"Rabin, M. O., Probabilistic algorithm for testing primality, Journal of Number Theory, vol. 12, pp. 128\u2013138, 1980.","journal-title":"Journal of Number Theory"},{"issue":"no. 2","key":"BF00206325_CR21","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"vol. 21","author":"R. L. Rivest","year":"1978","unstructured":"Rivest, R. L., A. Shamir, and L. Adleman, A method for obtaining digital signatures and publickey cryptosystems, Communications of the Association for Computing Machinery, vol. 21, no. 2, pp. 120\u2013126, 1978.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"BF00206325_CR22","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","volume":"vol. 6","author":"R. Solovay","year":"1977","unstructured":"Solovay, R., and V. Strassen, A fast Monte Carlo test for primality, SIAM Journal on Computing, vol. 6, pp. 84\u201385, 1977; erratum in vol. 7, p. 118,1978.","journal-title":"SIAM Journal on Computing"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00206325.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00206325\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00206325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00206325.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:31:28Z","timestamp":1586334688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00206325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["BF00206325"],"URL":"https:\/\/doi.org\/10.1007\/bf00206325","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,1]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}