{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:11:23Z","timestamp":1778263883760,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":5,"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_477","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:52:10Z","timestamp":1319709130000},"page":"1227-1227","source":"Crossref","is-referenced-by-count":0,"title":["Smoothness"],"prefix":"10.1007","author":[{"given":"Kim","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"477_CR1_477","unstructured":"Andrew\u00a0M. Odlyzko Discrete logarithms in finite fields and their cryptographic significance. In: Beth T et\u00a0al. (eds) pp 224\u2013314"},{"key":"477_CR2_477","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"ER Canfield","year":"1983","unstructured":"Canfield ER, Paul\u00a0Erd\u0151s, Carl Pomerance (1983) On a problem of Oppenheim concerning \u201cfactorisatio numerorum\u201d. J Num Theory 17:1\u201328","journal-title":"J Num Theory"},{"key":"477_CR3_477","first-page":"50","volume":"13","author":"NG de Bruijn","year":"1951","unstructured":"de\u00a0Bruijn NG (1951) On the number of positive integers $$\\le \\textrm{ x}$$ and free of prime factors $$> \\textrm{ y}$$. Indagationes Mathematicae 13:50\u201360","journal-title":"Indagationes Mathematicae"},{"key":"477_CR4_477","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1215\/S0012-7094-49-01609-9","volume":"16","author":"V Ramaswami","year":"1949","unstructured":"Ramaswami V (1949) The number of positive integers $$\\le \\textrm{ x}$$ and free of prime divisors $$>{ \\textrm{ x}}_{c}$$, and a problem of S. S. Pillai. Duke Math J 16:99\u2013109","journal-title":"S. Pillai. Duke Math J"},{"key":"477_CR5_477","volume-title":"Advances in cryptology: EUROCRYPT \u201984, vol 209","year":"1985","unstructured":"Beth T, Cot N, Ingemarsson I (eds) (1985) Advances in cryptology: EUROCRYPT \u201984, vol\u00a0209. LNCS. Springer, Berlin"}],"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_477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:51:05Z","timestamp":1778262665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_477","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}