{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:54:34Z","timestamp":1649134474310},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T00:00:00Z","timestamp":1228953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00287-008-0304-7","type":"journal-article","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T09:12:27Z","timestamp":1228900347000},"page":"33-36","source":"Crossref","is-referenced-by-count":0,"title":["Computeralgebra in Forschung und Lehre; Primzahltests und Primzahlrekorde"],"prefix":"10.1007","volume":"32","author":[{"given":"G\u00fcnter M.","family":"Ziegler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,11]]},"reference":[{"key":"304_CR1","first-page":"8","volume":"32","author":"F Bornemann","year":"2003","unstructured":"Bornemann F (2003) Ein Durchbruch f\u00fcr ,,Jedermann\u201c. Computeralgebra-Rundbrief 32:8\u201314","journal-title":"Computeralgebra-Rundbrief"},{"key":"304_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9316-0","volume-title":"Prime Numbers \u2013 A Computational Perspective","author":"R Crandall","year":"2001","unstructured":"Crandall R, Pomerance C (2001) Prime Numbers \u2013 A Computational Perspective. Springer-Verlag, New York"},{"key":"304_CR3","volume-title":"Modern Computer Algebra","author":"zur Gathen von","year":"2003","unstructured":"von zur Gathen, Gerhard J (2003) Modern Computer Algebra, 2. Aufl. Cambridge University Press, Cambridge","edition":"2"},{"key":"304_CR4","unstructured":"www.mersenne.org"},{"key":"304_CR5","unstructured":"www-groups.dcs.st-and.ac.uk\/\u223chistory\/PictDisplay\/Mersenne.html"},{"key":"304_CR6","doi-asserted-by":"crossref","unstructured":"mathworld.wolfram.com (Zugriff 2.12.2003)","DOI":"10.1055\/s-2003-36928"},{"key":"304_CR7","unstructured":"www.rsa.com"},{"key":"304_CR8","unstructured":"de.wikipedia.org\/wiki\/RSA_Factoring_Challenge (Zugriff 7.11.2008)"},{"key":"304_CR9","unstructured":"homes.cerias.purdue.edu\/\u223cssw\/cun\/ (Zugriff 7.11.2008)"},{"key":"304_CR10","unstructured":"www.nfsnet.org (Zugriff 30.5.2008)"},{"key":"304_CR11","unstructured":"www.eff.org\/"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-008-0304-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-008-0304-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-008-0304-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T06:42:32Z","timestamp":1559025752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-008-0304-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,11]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["304"],"URL":"https:\/\/doi.org\/10.1007\/s00287-008-0304-7","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,11]]}}}