{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:33:29Z","timestamp":1776764009044,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540180470","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47721-7_32","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T06:32:57Z","timestamp":1175754777000},"page":"443-450","source":"Crossref","is-referenced-by-count":2,"title":["Two Observations on Probabilistic Primality Testing"],"prefix":"10.1007","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"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L. and M.-D. Huang, \u201cRecognizing primes in random polynomial time\u201d, presented at CRYPTO 86, 1986.","DOI":"10.1145\/28395.28445"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.2307\/2006975","volume":"117","author":"L. Adleman","year":"1983","unstructured":"Adleman, L., C. Pomerance and R. Rumeley, \u201cOn distinguishing prime numbers from composite numbers\u201d, Annals of Mathematics, vol. 117, pp. 173\u2013206, 1983.","journal-title":"Annals of Mathematics"},{"key":"32_CR3","unstructured":"Babai, L., \u201cMonte Carlo algorithms in graph isomorphism testing\u201d, Rapport de Recherches du D\u00e9partement de Math\u00e9matiques et de Statistiques, Universit\u00e9 de Montr\u00e9al, D.M.S. #79-10, 1979."},{"key":"32_CR4","unstructured":"Brassard, G. and P. Bratley, Introduction to Algorithmics, Prentice-Hall, Englewood Cliffs, New Jersey, to appear."},{"issue":"5\/6","key":"32_CR5","first-page":"231","volume":"37","author":"C. Couvreur","year":"1982","unstructured":"Couvreur, C. and J. J. Quisquater, \u201cAn introduction to fast generation of large prime numbers\u201d, Philips Journal of Research, vol. 37, nos. 5\/6, pp. 231\u2013264, 1982.","journal-title":"Philips Journal of Research"},{"issue":"4","key":"32_CR6","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"Gill, J., \u201cComputational complexity of probabilistic Turing machines\u201d, SIAM Journal on Computing, vol. 6, no. 4, pp. 675\u2013695, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"32_CR7","unstructured":"Goldwasser, S. and J. Killian, \u201cA provably correct and probably fast primality test\u201d, Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, 1986."},{"key":"32_CR8","unstructured":"Hardy, G. H. and E. M. Wright, An Introduction to the Theory of Numbers, Fifth edition, Oxford Science Publications, 1979."},{"key":"32_CR9","volume-title":"The Art of Computer Programming, volume 2: Seminumerical Algorithms","author":"D. E. Knuth","year":"1981","unstructured":"Knuth, D. E., The Art of Computer Programming, volume 2: Seminumerical Algorithms, Second edition, Addison-Wesley, Reading, Massachusetts, 1981.","edition":"Second edition"},{"key":"32_CR10","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":"32_CR11","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G. L. Miller","year":"1976","unstructured":"Miller, G. L., \u201cRiemann\u2019s hypothesis and tests for primality\u201d, Journal of Computer and System Sciences, vol. 13, pp. 300\u2013317, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(80)90007-9","volume":"11","author":"L. Monier","year":"1980","unstructured":"Monier, L., \u201cEvaluation and comparison of two efficient probabilistic primality testing algorithms\u201d, Theoretical Computer Science, vol. 11, pp. 97\u2013108, 1980.","journal-title":"Theoretical Computer Science"},{"issue":"151","key":"32_CR13","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.2307\/2006210","volume":"35","author":"C. Pomerance","year":"1980","unstructured":"Pomerance, C., J. L. Selfridge and S. Wagstaff, Jr., \u201cThe pseudoprimes to 25.109\u201d, Mathematics of Computation, vol. 35, no. 151, pp. 1003\u20131026, July 1980.","journal-title":"Mathematics of Computation"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Pratt, V., \u201cEvery prime has a succinct certificate\u201d, SIAM Journal on Computing, pp. 214\u2013220, 1975.","DOI":"10.1137\/0204018"},{"key":"32_CR15","first-page":"21","volume-title":"Algorithms and Their Complexity: Recent Results and New Directions","author":"M. O. Rabin","year":"1976","unstructured":"Rabin, M. O., \u201cProbabilistic algorithms\u201d, in Algorithms and Their Complexity: Recent Results and New Directions, J. F. Traub (editor), Academic Press, New York, New York, pp. 21\u201339, 1976."},{"key":"32_CR16","unstructured":"Rabin, M. O., \u201cDigitalized signatures and public-key functions as intractable as factorization\u201d, MIT\/LCS\/TR-212, 1979."},{"issue":"2","key":"32_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"Rivest, R. L., A. Shamir and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems\u201d, Communications of the ACM, vol. 21, no. 2, pp. 120\u2013126, 1978.","journal-title":"Communications of the ACM"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"Solovay, R. and V. Strassen, \u201cA fast Monte Carlo test for primality\u201d, SIAM Journal on Computing, vol. 6, pp. 84\u201385, 1977.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47721-7_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:20Z","timestamp":1605629660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47721-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540180470"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-47721-7_32","relation":{},"subject":[]}}