{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:11:37Z","timestamp":1778263897542,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":2,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_480","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:52:10Z","timestamp":1319709130000},"page":"1265-1266","source":"Crossref","is-referenced-by-count":0,"title":["Strong Prime"],"prefix":"10.1007","author":[{"given":"Anton","family":"Stiglic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"480_CR1_480","series-title":"Lecture notes in computer science","first-page":"216","volume-title":"Advances in cryptology\u00a0\u2013 Proceedings of EUROCRYPT 84, A workshop on the theory and application of cryptographic techniques Paris, France, 9\u201311 April","author":"J Gordon","year":"1985","unstructured":"Gordon J (1985) Strong primes are easy to find. In: Beth et al (eds) Advances in cryptology\u00a0\u2013 Proceedings of EUROCRYPT 84, A workshop on the theory and application of cryptographic techniques Paris, France, 9\u201311 April, Lecture notes in computer science, vol 209. Springer, Heidelberg, pp 216\u2013223"},{"key":"480_CR2_480","unstructured":"Rivest R, Silverman R (2001) Are \u2018strong\u2019 primes needed for RSA. Cryptology ePrint archive, report 2001\/007. http:\/\/eprint.iacr.org\/"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_480","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:51:39Z","timestamp":1778262699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_480","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}