{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:16Z","timestamp":1725663856092},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573326"},{"type":"electronic","value":"9783540480662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57332-1_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:50:19Z","timestamp":1330260619000},"page":"440-449","source":"Crossref","is-referenced-by-count":11,"title":["Speeding up prime number generation"],"prefix":"10.1007","author":[{"given":"Jorgen","family":"Brandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Landrock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"L.Adleman and M.-D.Huang: Recognizing Primes in Random Polynomial Time, Proc. of STOC 1987, 462\u2013469.","DOI":"10.1145\/28395.28445"},{"key":"37_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1090\/S0025-5718-1989-0947467-1","volume":"52","author":"E. Bach","year":"1989","unstructured":"E.Bach and J.Shallit: Factoring with Cyclotomic Polynomials, Math. Comp. (1989), 52: 201\u2013219.","journal-title":"Math. Comp."},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00206325","volume":"1","author":"P. Beauchemin","year":"1988","unstructured":"P.Beauchemin, G.Brassard,C.Cr\u00e9peau, C.Goutier and C.Pomerance: The Generation of Numbers that are Probably Prime, J.Cryptology (1988) 1:53\u201364.","journal-title":"J.Cryptology"},{"key":"37_CR4","first-page":"620","volume":"29","author":"J. Brillhart","year":"1975","unstructured":"J.Brillhart, D.H.Lehmer and J.L.Selfridge: New Primality Criteria and Factorizations of 2m\u00b11, Math. Comp. (1975), 29: 620\u2013647.","journal-title":"Math. Comp."},{"key":"37_CR5","unstructured":"Damg\u00e5rd and Landrock: Improved Bounds for the Rabin Primality Test, to appear."},{"key":"37_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1090\/S0025-5718-1986-0815848-X","volume":"46","author":"P. Erd\u00f6s","year":"1986","unstructured":"P.Erd\u00f6s and C.Pomerance: On the Number of False Witnesses for a Composite Number, Math. Comp. (1986), 46: 259\u2013279.","journal-title":"Math. Comp."},{"key":"37_CR7","unstructured":"J.Gordon: Strong Primes are Easy to find, Proc. of Crypto 84."},{"key":"37_CR8","volume-title":"How to Factor a Number","author":"R. K. Guy","year":"1975","unstructured":"R.K. Guy: How to Factor a Number, Proc. of the 5'th Manitoba Conference on Numerical Mathematics, 1975, University of Manitoba, Winnipeg."},{"key":"37_CR9","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1090\/S0025-5718-1989-0982368-4","volume":"53","author":"S. H. Kim","year":"1989","unstructured":"S.H. Kim and C. Pomerance: The Probability that a Randomly Probable Prime is Composite, Math. Comp. (1989), 53: 721\u2013741.","journal-title":"Math. Comp."},{"key":"37_CR10","unstructured":"U.Maurer: The Generation of Secure RSA Products With Almost Maximal Diversity, Proc. of EuroCrypt 89 (to appear)."},{"key":"37_CR11","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0628717-0","volume":"37","author":"C. Pomerance","year":"1981","unstructured":"C.Pomerance: On the Distribution of Pseudoprimes, Math. Comp. (1981), 37: 587\u2013593.","journal-title":"Math. Comp."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M. O. Rabin","year":"1980","unstructured":"M.O. Rabin: Probabilistic Algorithm for Testing Primality, J.Number Theory (1980), 12: 128\u2013138.","journal-title":"J.Number Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57332-1_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:49Z","timestamp":1619571829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57332-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573326","9783540480662"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57332-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}