{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:28:57Z","timestamp":1776828537496,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676959","type":"print"},{"value":"9783540449942","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722028_30","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T18:45:30Z","timestamp":1167417930000},"page":"459-473","source":"Crossref","is-referenced-by-count":7,"title":["The Pseudoprimes up to 1013"],"prefix":"10.1007","author":[{"given":"Richard G. E.","family":"Pinch","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4544-5","volume-title":"Factorization and primality testing","author":"D.M. Bressoud","year":"1989","unstructured":"Bressoud, D.M.: Factorization and primality testing. Springer, New York (1989)"},{"key":"30_CR2","volume-title":"Factorizations of bn\u00b11, Contemporary mathematics","author":"J. Brillhart","year":"1988","unstructured":"Brillhart, J., Lehmer, D.H., Selfridge, J.L., Tuckerman, B., Wagstaff Jr., S.S.: Factorizations of bn\u00b11, Contemporary mathematics, 2nd edn., vol.\u00a022. Amer. Math. Soc., Providence RI (1988)","edition":"2"},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02419871","volume":"9","author":"M. Cipolla","year":"1904","unstructured":"Cipolla, M.: Sui numeri composti p, che verificano la congruenza di Fermat aP\u2009\u2212\u20091 \u2261 1 mod p. Annali di Mathematica Pura e Applicata\u00a09, 139\u2013160 (1904)","journal-title":"Annali di Mathematica Pura e Applicata"},{"key":"30_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0310-7","volume-title":"A course in number theory and cryptography,Graduate Texts in Mathematics","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: A course in number theory and cryptography,Graduate Texts in Mathematics, vol.\u00a0114. Springer, New York (1987)"},{"key":"30_CR5","first-page":"289","volume":"36","author":"D.H. Lehmer","year":"1981","unstructured":"Lehmer, D.H.: On Fermat\u2019s quotient, base two. Math. Comp.\u00a036, 289\u2013290 (1981)","journal-title":"Math. Comp."},{"key":"30_CR6","volume-title":"Number theory and its applications","year":"1989","unstructured":"Mollin, R.A. (ed.): Number theory and its applications. Kluwer Academic Publishers, Dordrecht (1989); Proceedings of the NATO Advanced Study Institute on Number Theory and Applications"},{"key":"30_CR7","first-page":"381","volume":"61","author":"R.G.E. Pinch","year":"1993","unstructured":"Pinch, R.G.E.: The Carmichael numbers up to 1015. Math. Comp.\u00a061, 381\u2013391 (1993)","journal-title":"Math. Comp."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0628717-0","volume":"37","author":"C. Pomerance","year":"1981","unstructured":"Pomerance, C.: On the distribution of pseudoprimes. Math. Comp.\u00a037, 587\u2013593 (1981)","journal-title":"Math. Comp."},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1215\/ijm\/1256046896","volume":"26","author":"C. Pomerance","year":"1982","unstructured":"Pomerance, C.: A new lower bound for the pseudoprime counting function, Illinois J. Maths 26, 4\u20139 (1982)","journal-title":"Illinois J. Maths"},{"key":"30_CR10","unstructured":"Pomerance, C.: Two methods in elementary analytic number theory. In: Mollin [6], Proceedings of the NATO Advanced Study Institute on Number Theory and Applications"},{"issue":"151","key":"30_CR11","first-page":"1003","volume":"35","author":"C. Pomerance","year":"1980","unstructured":"Pomerance, C., Selfridge, J.L., Wagstaff Jr., S.S.: The pseudoprimes up to 25.109. Math. Comp.\u00a035(151), 1003\u20131026 (1980)","journal-title":"Math. Comp."},{"key":"30_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4330-2","volume-title":"The little book of big primes","author":"P. Ribenboim","year":"1991","unstructured":"Ribenboim, P.: The little book of big primes. Springer, New York (1991)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Ribenboim, P.: The new book of prime number records, 3rd edn. Springer, New York (1996)","DOI":"10.1007\/978-1-4612-0759-7"},{"key":"30_CR14","series-title":"Progress in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0251-6","volume-title":"Prime numbers and computer methods for factorization","author":"H. Riesel","year":"1994","unstructured":"Riesel, H.: Prime numbers and computer methods for factorization, 2nd edn. Progress in mathematics, vol.\u00a0126. Birkhauser, Boston (1994)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10722028_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:46:38Z","timestamp":1556005598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722028_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676959","9783540449942"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/10722028_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}