{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:56Z","timestamp":1759667756370},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,11]],"date-time":"2011-05-11T00:00:00Z","timestamp":1305072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10207-011-0129-2","type":"journal-article","created":{"date-parts":[[2011,5,10]],"date-time":"2011-05-10T06:21:29Z","timestamp":1305008489000},"page":"189-199","source":"Crossref","is-referenced-by-count":22,"title":["Generalizing cryptosystems based on the subset sum problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Aniket","family":"Kate","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,11]]},"reference":[{"key":"129_CR1","unstructured":"Avoine, G.: Security and privacy in RFID systems. http:\/\/www.avoine.net\/rfid\/ (2008). Accessed June 2010"},{"key":"129_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02566968","volume":"37","author":"R. Bose","year":"1962","unstructured":"Bose R., Chowla S.: Theorems in the additive theory of numbers. Comment. Math. Helv. 37, 141\u2013147 (1962)","journal-title":"Comment. Math. Helv."},{"key":"129_CR3","doi-asserted-by":"crossref","unstructured":"Brickell, E.: Solving low density knapsacks. In: Advances in Cryptology\u2014CRYPTO, pp. 25\u201337 (1983)","DOI":"10.1007\/978-1-4684-4730-9_2"},{"key":"129_CR4","doi-asserted-by":"crossref","unstructured":"Chor, B., Rivest, R.L.: A knapsack-type public-key cryptosystem based on arithmetic in finite fields. In: Advances in Cryptology\u2014CRYPTO, pp. 54\u201365 (1985)","DOI":"10.1007\/3-540-39568-7_6"},{"issue":"5","key":"129_CR5","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B. Chor","year":"1988","unstructured":"Chor B., Rivest R.L.: A knapsack-type public-key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inf. Theory 34(5), 901\u2013909 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"129_CR6","doi-asserted-by":"crossref","unstructured":"Coster, M., La Macchia, B., Odlyzko, A.: An improved low-denisty subset sum algorithm. In: Advances in Cryptology\u2014EUROCRYPT, pp. 54\u201367 (1991)","DOI":"10.1007\/3-540-46416-6_4"},{"issue":"1","key":"129_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TIT.1973.1054929","volume":"19","author":"T. Cover","year":"1973","unstructured":"Cover T.: Enumerative source encoding. IEEE Trans. Inf. Theory 19(1), 73\u201377 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"129_CR8","doi-asserted-by":"crossref","unstructured":"Cui, Y., Kobara, K., Matsuura, K., Imai, H.: Lightweight asymmetric privacy-preserving authentication protocols secure against active attack. In: International Workshop on Pervasive Computing and Communication Security\u2014PerSec, pp. 223\u2013228 (2007)","DOI":"10.1109\/PERCOMW.2007.60"},{"key":"129_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Public Key Cryptography, pp. 119\u2013136 (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"issue":"1","key":"129_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0097-3165(86)90116-0","volume":"41","author":"N.D. Elkies","year":"1986","unstructured":"Elkies N.D.: An improved lower bound on the greatest element of a sum-distinct set of fixed order. J. Comb. Theory Ser. A 41(1), 89\u201394 (1986)","journal-title":"J. Comb. Theory Ser. A"},{"key":"129_CR11","unstructured":"Erd\u0151s, P.: Problems and Results from Additive Number Theory. Colloq. Th\u00e9orie des nombres, Bruxells, pp. 127\u2013137 (1955)"},{"key":"129_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3585-4","volume-title":"Unsolved Problems in Number Theory","author":"R.K. Guy","year":"1994","unstructured":"Guy R.K.: Unsolved Problems in Number Theory. Springer-Verlag, New York (1994)","edition":"2"},{"issue":"1","key":"129_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10623-007-9058-5","volume":"43","author":"T. Izu","year":"2007","unstructured":"Izu T., Kogure J., Koshiba T., Shimoyama T.: Low-density attack revisited. Des. Codes Cryptogr. 43(1), 47\u201359 (2007)","journal-title":"Des. Codes Cryptogr."},{"key":"129_CR14","doi-asserted-by":"crossref","unstructured":"Joux, A., Stern, J.: Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems. In: 8th International Symposium on Fundamentals of Computation Theory, pp. 258\u2013264 (1991)","DOI":"10.1007\/3-540-54458-5_70"},{"issue":"2","key":"129_CR15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/JSAC.2005.861395","volume":"24","author":"A. Juels","year":"2006","unstructured":"Juels A.: RFID Security and privacy: a research survey. IEEE J. Sel. Areas Commun. 24(2), 381\u2013394 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"129_CR16","doi-asserted-by":"crossref","unstructured":"Lagarias, J., Odlyzko, A.: Solving low-density subset sum problems. In: IEEE Symposium on Foundations of Computer Science, pp. 1\u201310 (1983)","DOI":"10.1109\/SFCS.1983.70"},{"key":"129_CR17","unstructured":"Lai, M.: Knapsack cryptosystems: The Past and the Future. Technical report, Department of Information and Computer Science, University of California (2001). http:\/\/www.ics.uci.edu\/~mingl\/knapsack.html"},{"key":"129_CR18","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W. Jr, Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"129_CR19","doi-asserted-by":"crossref","unstructured":"May, A., Silverman, J.H.: Dimension reduction methods for convolution modular lattices. In: Cryptography and lattices, international conference (CaLC), pp. 110\u2013125 (2001)","DOI":"10.1007\/3-540-44670-2_10"},{"issue":"5","key":"129_CR20","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. Merkle","year":"1978","unstructured":"Merkle R., Hellman M.: Information and signatures in trapdoor knapsacks. IEEE Trans. Inf. Theory 24(5), 525\u2013530 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"129_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Advances in Cryptology\u2014EUROCRYPT, pp. 215\u2013233 (2005)","DOI":"10.1007\/11426639_13"},{"key":"129_CR22","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Stern, J.: Adapting density attacks to low-weight knapsacks. In: Advances in Cryptology\u2014ASIACRYPT, pp. 41\u201358 (2005)","DOI":"10.1007\/11593447_3"},{"key":"129_CR23","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15, 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theory"},{"key":"129_CR24","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Tanaka, K., Uchiyama, S.: Quantum public-key cryptosystems. In: Advances in Cryptology\u2014CRYPTO, pp. 147\u2013165 (2000)","DOI":"10.1007\/3-540-44598-6_9"},{"issue":"6","key":"129_CR25","first-page":"1564","volume":"E87-A","author":"K. Omura","year":"2004","unstructured":"Omura K., Tanaka K.: Density attack to the Knapsack cryptosystems with enumerative source encoding. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E87-A(6), 1564\u20131569 (2004)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"129_CR26","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology\u2014EUROCRYPT, pp. 223\u2013238 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"2","key":"129_CR27","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/62.322435","volume":"31","author":"C. Papadimitriou","year":"1984","unstructured":"Papadimitriou C.: On the complexity of unique solutions. J. ACM 31(2), 392\u2013400 (1984)","journal-title":"J. ACM"},{"issue":"1","key":"129_CR28","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"C. Schnorr","year":"1988","unstructured":"Schnorr C.: A more efficient algorithm for lattice basis reduction. J. Algorithms 9(1), 47\u201362 (1988)","journal-title":"J. Algorithms"},{"key":"129_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-49264-X_1","volume":"921","author":"C.P. Schnorr","year":"1995","unstructured":"Schnorr C.P., H\u00f6rner H.H.: Attacking the Chor-Rivest cryptosystem by improved lattice reduction. Lect. Notes Comput. Sci. 921, 1\u201312 (1995)","journal-title":"Lect. Notes Comput. Sci."},{"key":"129_CR30","doi-asserted-by":"crossref","unstructured":"Shamir, A.: A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem. In: IEEE Symposium on Foundations of Computer Science, pp. 145\u2013152 (1982)","DOI":"10.1109\/SFCS.1982.5"},{"issue":"5","key":"129_CR31","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"Shor P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"129_CR32","doi-asserted-by":"crossref","unstructured":"Shoup, V.: OAEP reconsidered. In: Advances in Cryptology\u2014CRYPTO, pp. 239\u2013259 (2001)","DOI":"10.1007\/3-540-44647-8_15"},{"key":"129_CR33","doi-asserted-by":"crossref","unstructured":"Vaudenay, S.: Cryptanalysis of the chor-rivest cryptosystem. In: Advances in Cryptology\u2014CRYPTO, pp. 243\u2013256 (1998)","DOI":"10.1007\/BFb0055732"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-011-0129-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-011-0129-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-011-0129-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T13:33:43Z","timestamp":1560173623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-011-0129-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,11]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s10207-011-0129-2","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,11]]}}}