{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:20Z","timestamp":1725486080671},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003243"},{"type":"electronic","value":"9783540362883"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_5","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T16:45:01Z","timestamp":1180889101000},"page":"62-70","source":"Crossref","is-referenced-by-count":3,"title":["On the Bit Security of NTRUEncrypt"],"prefix":"10.1007","author":[{"given":"Mats","family":"N\u00e4slund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor E.","family":"Shparlinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Whyte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr, \u2018RSA and Rabin functions: Certain parts are as hard as the whole\u2019, SIAM Journal on Computing, 17 (1988), 194\u2013209. 69","DOI":"10.1137\/0217013"},{"key":"5_CR2","first-page":"201","volume":"2139","author":"D. Boneh","year":"2001","unstructured":"D. Boneh and I. E. Shparlinski, \u2018On the unpredictability of bits of the elliptic curve Diffie\u2013Hellman scheme\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2139 (2001), 201\u2013212. 64","journal-title":"On the unpredictability of bits of the elliptic curve Diffie\u2013Hellman scheme"},{"key":"5_CR3","first-page":"129","volume":"1109","author":"D. Boneh","year":"1996","unstructured":"D. Boneh and R. Venkatesan, \u2018Hardness of computing the most significant bits of secret keys in Diffie\u2013Hellman and related schemes\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1109 (1996), 129\u2013142. 64, 69","journal-title":"Hardness of computing the most significant bits of secret keys in Diffie\u2013Hellman and related schemes"},{"key":"5_CR4","first-page":"182","volume":"2045","author":"C. Gentry","year":"2001","unstructured":"C. Gentry, \u2018Key recovery and message attack on NTRU-composite\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2045 (2001), 182\u2013194. 65","journal-title":"Key recovery and message attack on NTRU-composite"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0007-6","volume":"14","author":"M. Goldman","year":"2001","unstructured":"M. Goldman, M. N\u00e4slund and A. Russell, \u2018Complexity bounds on general hardcore predicates\u2019, J. Cryptology, 14 (2001), 177\u2013195. 64","journal-title":"J. Cryptology"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and P. Tong, \u2018Why and how to establish a private code on a public network (Extended abstract)\u2019, Proc. 23rd Annual IEEE Symp. on Foundations of Comp. Sci., 1982, 134\u2013144. 69","DOI":"10.1109\/SFCS.1982.100"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"M. I. Gonz\u00e1lez Vasco and M. N\u00e4slund, \u2018A survey of hard core functions\u2019, Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkh\u00e4user, 2001, 227\u2013256. 64","DOI":"10.1007\/978-3-0348-8295-8_18"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"M. I. Gonz\u00e1lez Vasco and I.E. Shparlinski, \u2018On the security of Diffie\u2013Hellman bits\u2019, Proc. Workshop on Cryptography and Computational Number Theory, Singapore 1999, Birkh\u00e4user, 2001, 257\u2013268. 64, 69","DOI":"10.1007\/978-3-0348-8295-8_19"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1090\/S0025-5718-01-01358-8","volume":"71","author":"M. I. Gonz\u00e1lez Vasco","year":"2002","unstructured":"M. I. Gonz\u00e1lez Vasco and I.E. Shparlinski, \u2018Security of the most significant bits of the Shamir message passing scheme\u2019, Math. Comp., 71 (2002), 333\u2013342. 64","journal-title":"Math. Comp."},{"key":"5_CR10","unstructured":"J. H\u2222stad and M. N\u00e4slund, \u2018The security of individual RSA and discrete log bits\u2019, J. of the ACM, (to appear). 62, 63, 64, 69"},{"key":"5_CR11","first-page":"267","volume":"1433","author":"J. Hoffstein","year":"1998","unstructured":"J. Hoffstein, J. Pipher and J.H. Silverman, \u2018NTRU: A ring based public key cryptosystem\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 1433 (1998), 267\u2013288. 62, 63, 64","journal-title":"NTRU: A ring based public key cryptosystem"},{"key":"5_CR12","unstructured":"J. Hoffstein and J.H. Silverman, \u2018Optimizations for NTRU\u2019, Proc. the Conf. on Public Key Cryptography and Computational Number Theory, Warsaw, 2000, Walter de Gruyter, 2001, 77\u201388. 63, 64"},{"key":"5_CR13","unstructured":"N. A. Howgrave-Graham, P. Q. Nguyen and I.E. Shparlinski, \u2018Hidden number problem with hidden multipliers, timed-release crypto and noisy exponentiation\u2019, Math. Comp., (to appear). 64"},{"key":"5_CR14","first-page":"433","volume":"2442","author":"W.-C.W. Li","year":"2002","unstructured":"W.-C.W. Li, M. N\u00e4slund and I.E. Shparlinski, \u2018The hidden number problem with the trace and bit security of XTR and LUC\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2442 (2002), 433\u2013448. 64","journal-title":"The hidden number problem with the trace and bit security of XTR and LUC"},{"key":"5_CR15","first-page":"210","volume":"2442","author":"P.Q. Nguyen","year":"2002","unstructured":"P.Q. Nguyen and D. Pointcheval, \u2018Analysis and improvements of NTRU encryption paddings\u2019, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 2442 (2002, 210\u2013225. 64","journal-title":"Analysis and improvements of NTRU encryption paddings"},{"key":"5_CR16","first-page":"1","volume":"TR98-033","author":"C. P. Schnorr","year":"1998","unstructured":"C. P. Schnorr, \u2018Security of almost all discrete log bits\u2019, Electronic Colloq. on Comp. Compl., Univ. of Trier, TR98-033 (1998), 1\u201313. 64","journal-title":"Electronic Colloq. on Comp. Compl."},{"key":"5_CR17","unstructured":"J.H. Silverman, \u2018Invertibility in truncated polynomial rings\u2019, NTRU Cryptosystem Tech. Report 9, 1998, 1\u20138. 63"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:56:24Z","timestamp":1556456184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}