{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T15:42:39Z","timestamp":1768923759199,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540282396","type":"print"},{"value":"9783540318743","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_32","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:13:22Z","timestamp":1285632802000},"page":"378-389","source":"Crossref","is-referenced-by-count":91,"title":["The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem"],"prefix":"10.1007","author":[{"given":"Vadim","family":"Lyubashevsky","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proc. 28th Annual Symposium on Theory of Computing, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"issue":"4","key":"32_CR2","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A. Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. JACM\u00a050(4), 506\u2013519 (2003)","journal-title":"JACM"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-31856-9_25","volume-title":"STACS 2005","author":"A. Flaxman","year":"2005","unstructured":"Flaxman, A., Przydatek, B.: Solving medium-density subset sum problems in expected polynomial time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 305\u2013314. Springer, Heidelberg (2005)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/0215038","volume":"15","author":"A. Frieze","year":"1986","unstructured":"Frieze, A.: On the Lagarias-Odlyzko algorithm for the subset sum problem. SIAM J. Comput.\u00a015, 536\u2013539 (1986)","journal-title":"SIAM J. Comput."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: Hard-core predicates for any one-way function. In: Proc. 21st Annual Symposium on Theory of Computing, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"issue":"4","key":"32_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology\u00a09(4), 199\u2013216 (1996)","journal-title":"Journal of Cryptology"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: Proc. 30th Annual Symposium on Foundations of Computer Science, pp. 248\u2013253 (1989)","DOI":"10.1109\/SFCS.1989.63486"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J.C. Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low density subset sum problems. J. of the ACM\u00a032, 229\u2013246 (1985)","journal-title":"J. of the ACM"},{"key":"32_CR9","unstructured":"Lyubashevsky, V.: On random high density subset sums, Technical Report TR05-007, Electronic Coloquium on Computational Complexity, ECCC (2005)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measure. In: Proc. 45th Annual Symposium on Foundations of Computer Science, pp. 372\u2013381 (2004)","DOI":"10.1109\/FOCS.2004.72"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R. Schroeppel","year":"1981","unstructured":"Schroeppel, R., Shamir, A.: A T = O(2(n\/2)), S = O(2(n\/4)) algorithm for certain NP-complete problems. SIAM J. Comput.\u00a010, 456\u2013464 (1981)","journal-title":"SIAM J. Comput."},{"key":"32_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139165464","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V. Shoup","year":"2005","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2005)"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 288\u2013303. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:13:52Z","timestamp":1605626032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11538462_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}