{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:41:59Z","timestamp":1770338519332,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540244547","type":"print"},{"value":"9783540305804","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30580-4_2","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T19:51:09Z","timestamp":1278359469000},"page":"9-15","source":"Crossref","is-referenced-by-count":6,"title":["Breaking a Cryptographic Protocol with Pseudoprimes"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Bleichenbacher","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Algorithmic Number Theory","author":"W.R. Alford","year":"1994","unstructured":"Alford, W.R., Granville, A., Pomerance, C.: On the difficulty of finding reliable witnesses. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol.\u00a0877, pp. 1\u201316. Springer, Heidelberg (1994)"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"703","DOI":"10.2307\/2118576","volume":"140","author":"W.R. Alford","year":"1994","unstructured":"Alford, W.R., Granville, A., Pomerance, C.: There are infinitely many Carmichael numbers. Annals of Mathematics\u00a0140(3), 703\u2013722 (1994)","journal-title":"Annals of Mathematics"},{"issue":"209","key":"2_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1090\/S0025-5718-1995-1260124-2","volume":"64","author":"F. Arnault","year":"1995","unstructured":"Arnault, F.: Rabin-Miller primality test: Composite numbers which pass it. Mathematics of Computation\u00a064(209), 355\u2013361 (1995)","journal-title":"Mathematics of Computation"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.2307\/2972687","volume":"19","author":"R.D. Carmichael","year":"1912","unstructured":"Carmichael, R.D.: On composite numbers P which satisfy the Fermat congruence aP\u22121 \u2261 1 mod P. American Math. Monthly\u00a019, 22\u201327 (1912)","journal-title":"American Math. Monthly"},{"issue":"203","key":"2_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1090\/S0025-5718-1993-1189518-9","volume":"61","author":"I. Damg\u00e5rd","year":"1993","unstructured":"Damg\u00e5rd, I., Landrock, P., Pomerance, C.: Average case error estimates for the strong probable prime test. Mathematics of Computation\u00a061(203), 177\u2013194 (1993)","journal-title":"Mathematics of Computation"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.5486\/PMD.1956.4.3-4.16","volume":"4","author":"P. Erd\u00f6s","year":"1956","unstructured":"Erd\u00f6s, P.: On pseudoprimes and Carmichael numbers. Publ. Math. Debrecen\u00a04, 201\u2013206 (1956)","journal-title":"Publ. Math. Debrecen"},{"key":"2_CR7","first-page":"142","volume":"6","author":"A. Korselt","year":"1899","unstructured":"Korselt, A.: Probl\u2018eme chinois. L\u2019interm\u00e9diaire des math\u00e9maticiens\u00a06, 142\u2013143 (1899)","journal-title":"L\u2019interm\u00e9diaire des math\u00e9maticiens"},{"key":"2_CR8","unstructured":"MacKenzie, P.: Personal communications"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"-24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory\u00a0IT-24, 106\u2013110 (1978)","journal-title":"IEEE Trans. Inform. Theory IT"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M. Rabin","year":"1980","unstructured":"Rabin, M.: Probabilistic algorithms for testing primality. J. Number Theory\u00a012, 128\u2013138 (1980)","journal-title":"J. Number Theory"},{"key":"2_CR11","unstructured":"Wu, T.: SRP-6: Improvements and refinements to the secure remote password protocol (October 2002), http:\/\/srp.stanford.edu\/doc.html"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30580-4_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T22:45:39Z","timestamp":1685659539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30580-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244547","9783540305804"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30580-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}