{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:07:51Z","timestamp":1743149271391,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_52","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"661-673","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Non-Merkle-Damg\u00e5rd Structural Hash Function with Provable Security"],"prefix":"10.1007","author":[{"given":"Shenghui","family":"Su","sequence":"first","affiliation":[]},{"given":"Tao","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Shuwang","family":"L\u00fc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"52_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology - CRYPTO 1989","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428\u2013446. Springer, Heidelberg (1990)"},{"key":"52_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO 1989","author":"IB Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"key":"52_CR3","volume-title":"Handbook of Applied Cryptography","author":"A Menezes","year":"1997","unstructured":"Menezes, A., Oorschot, P.V., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, London (1997)"},{"key":"52_CR4","volume-title":"Cryptography and Network Security: Principles and Practice","author":"W Stallings","year":"1999","unstructured":"Stallings, W.: Cryptography and Network Security: Principles and Practice, 2nd edn. Prentice-Hall, New Jersey (1999)","edition":"2"},{"issue":"2","key":"52_CR5","first-page":"232","volume":"19","author":"S Su","year":"2010","unstructured":"Su, S., Yang, Y., Yang, B.: etc: Design and Analysis of a Hash Ring-iterative Structure. Chinese Journal of Electronics 19(2), 232\u2013236 (2010)","journal-title":"Chinese Journal of Electronics"},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2011.12.011","volume":"426\u2013427","author":"S Su","year":"2012","unstructured":"Su, S., L\u00fc, S.: A Public Key Cryptosystem Based on Three New Provable Problems. Theoretical Computer Science 426\u2013427, 91\u2013117 (2012)","journal-title":"Theoretical Computer Science"},{"key":"52_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04773-6","volume-title":"Number Theory for Computing","author":"SY Yan","year":"2002","unstructured":"Yan, S.Y.: Number Theory for Computing, 2nd edn. Springer, New York (2002)","edition":"2"},{"key":"52_CR8","volume-title":"Algebra","author":"TW Hungerford","year":"1998","unstructured":"Hungerford, T.W.: Algebra. Springer, New York (1998)"},{"key":"52_CR9","volume-title":"Elementary Number Theory and Its Applications","author":"KH Rosen","year":"2005","unstructured":"Rosen, K.H.: Elementary Number Theory and Its Applications, 5th edn. Addison-Wesley, Boston (2005)","edition":"5"},{"issue":"3","key":"52_CR10","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener, M.J.: Cryptanalysis of Short RSA Secret Exponents. IEEE Transactions on Information Theory 36(3), 553\u2013558 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"52_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1007\/3-540-46766-1_38","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"D Chaum","year":"1992","unstructured":"Chaum, D., van Heijst, E., Pfitzmann, B.: Cryptographically strong undeniable signatures, unconditionally secure for the signer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 470\u2013484. Springer, Heidelberg (1992)"},{"issue":"5","key":"52_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"RC Merkle","year":"1978","unstructured":"Merkle, R.C., Hellman, M.E.: Hiding information and Signatures in Trapdoor Knapsacks. IEEE Transactions on Information Theory 24(5), 525\u2013530 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Shamir, A.: A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem. In: 23th IEEE Symposium on the Foundations of Computer Science, pp. 145\u2013152. IEEE Press, New York (1982)","DOI":"10.1109\/SFCS.1982.5"},{"key":"52_CR14","volume-title":"Design and Analysis of Approximation Algorithms (in Chinese)","author":"DZ Du","year":"2011","unstructured":"Du, D.Z., Ko, K., Hu, X.: Design and Analysis of Approximation Algorithms (in Chinese). Higher Education Press, Beijing (2011)"},{"key":"52_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Brickell, E.F.: Solving low density knapsacks. In: Advance in Cryptology: CRYPTO 1983, pp. 25\u201337. Plenum Press, New York (1984)","DOI":"10.1007\/978-1-4684-4730-9_2"},{"key":"52_CR17","doi-asserted-by":"crossref","unstructured":"Li T., Su, S.: Analysis of success rate of attacking knapsacks from JUNA cryptosystem by LLL lattice basis reduction. In: 9th Int. Conf. on Comput. Intelligence and Security, pp. 454\u2013458. IEEE Press, New York (2013)","DOI":"10.1109\/CIS.2013.102"},{"issue":"2","key":"52_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"MJ Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., et al.: Improved Low-Density Subset Sum Algorithms. Computational Complexity 2(2), 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"key":"52_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24676-3_24","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M Bellare","year":"2004","unstructured":"Bellare, M., Kohno, T.: Hash function balance and its impact on birthday attacks. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 401\u2013418. Springer, Heidelberg (2004)"},{"key":"52_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-45961-8_12","volume-title":"Advances in Cryptology - EUROCRYPT 1988","author":"M Girault","year":"1988","unstructured":"Girault, M., Cohen, R., Campana, M.: A generalized birthday attack. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 129\u2013156. Springer, Heidelberg (1988)"},{"issue":"6","key":"52_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/C-M.1977.217750","volume":"10","author":"W Diffie","year":"1977","unstructured":"Diffie, W., Hellman, M.E.: Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Computer 10(6), 74\u201384 (1977)","journal-title":"Computer"},{"key":"52_CR22","unstructured":"Su, S., L\u00fc, S.: REESSE1+. Reward. Proof by Experiment. A New Approach to Proof of P != NP. Cornell University Library (2009). http:\/\/arxiv.org\/pdf\/0908.0482 (revised 2014)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T13:02:09Z","timestamp":1675861329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}