{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:31Z","timestamp":1725490171063},"publisher-location":"Berlin, Heidelberg","reference-count":0,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540119937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39466-4_14","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T00:51:45Z","timestamp":1188348705000},"page":"207-216","source":"Crossref","is-referenced-by-count":0,"title":["On Using Prime Polynomials in Crypto Generators"],"prefix":"10.1007","author":[{"given":"Tore","family":"Herlestam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","container-title":["Lecture Notes in Computer Science","Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39466-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:46Z","timestamp":1619572906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39466-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540119937"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/3-540-39466-4_14","relation":{},"subject":[]}}