{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:35:23Z","timestamp":1725708923095},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642349300"},{"type":"electronic","value":"9783642349317"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34931-7_29","type":"book-chapter","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T22:24:04Z","timestamp":1354746244000},"page":"509-527","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Permutation-Based Hash Mode of Operation FP and the Hash Function SAMOSA"],"prefix":"10.1007","author":[{"given":"Souradyuti","family":"Paul","sequence":"first","affiliation":[]},{"given":"Ekawat","family":"Homsirikamol","sequence":"additional","affiliation":[]},{"given":"Kris","family":"Gaj","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10207-012-0157-6","volume":"11","author":"E. Andreeva","year":"2012","unstructured":"Andreeva, E., Mennink, B., Preneel, B.: The parazoa family: generalizing the sponge hash functions. Int. J. Inf. Sec.\u00a011(3), 149\u2013165 (2012)","journal-title":"Int. J. Inf. Sec."},{"key":"29_CR2","unstructured":"ATHENa Project Website, http:\/\/cryptography.gmu.edu\/athena"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-13190-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A. Biryukov","year":"2010","unstructured":"Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., Shamir, A.: Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 299\u2013319. Springer, Heidelberg (2010)"},{"key":"29_CR4","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge Functions. In: ECRYPT 2007 (2007), http:\/\/sponge.noekeon.org\/SpongeFunctions.pdf (accessed March 2012)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G. Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the Indifferentiability of the Sponge Construction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 181\u2013197. Springer, Heidelberg (2008)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-642-21554-4_28","volume-title":"Applied Cryptography and Network Security","author":"R. Bhattacharyya","year":"2011","unstructured":"Bhattacharyya, R., Mandal, A.: On the Indifferentiability of Fugue and Luffa. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol.\u00a06715, pp. 479\u2013497. Springer, Heidelberg (2011)"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-13858-4_10","volume-title":"Fast Software Encryption","author":"R. Bhattacharyya","year":"2010","unstructured":"Bhattacharyya, R., Mandal, A., Nandi, M.: Security Analysis of the Mode of JH Hash Function. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol.\u00a06147, pp. 168\u2013191. Springer, Heidelberg (2010)"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45708-9_21","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Black","year":"2002","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 320\u2013335. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10623-010-9481-x","volume":"64","author":"S.R. Blackburn","year":"2012","unstructured":"Blackburn, S.R., Stinson, D.R., Upadhyay, J.: On the complexity of the herding attack and some related attacks on hash functions. Des. Codes Cryptography\u00a064(1-2), 171\u2013193 (2012)","journal-title":"Des. Codes Cryptography"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J.-S. Coron","year":"2005","unstructured":"Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damg\u00e5rd Revisited: How to Construct a Hash Function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 430\u2013448. Springer, Heidelberg (2005)"},{"key":"29_CR11","unstructured":"De Canni\u00e8re, C., Sato, H., Watanabe, D.: The Luffa Hash Function. In: The 1st SHA-3 Candidate Conference"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-03317-9_7","volume-title":"Fast Software Encryption","author":"Y. Dodis","year":"2009","unstructured":"Dodis, Y., Reyzin, L., Rivest, R.L., Shen, E.: Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol.\u00a05665, pp. 104\u2013121. Springer, Heidelberg (2009)"},{"key":"29_CR13","unstructured":"Gaj, K., Homsirikamol, E., Rogawski, M., Shahid, R., Sharif, M.U.: Comprehensive Evaluation of High-Speed and Medium-Speed Implementations of Five SHA-3 Finalists Using Xilinx and Altera FPGAs. Cryptology ePrint Archive, Report 2012\/368 (2012), http:\/\/eprint.iacr.org\/2012\/368.pdf"},{"key":"29_CR14","unstructured":"Gauravaram, P., Knudsen, L., Matusiewicz, K., Mendel, F., Rechberger, C., Schlaffer, M., Thomsen, S.: Groestl - a SHA-3 candidate. In: The 1st SHA-3 Candidate Conference"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/978-3-540-28628-8_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A. Joux","year":"2004","unstructured":"Joux, A.: Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 306\u2013316. Springer, Heidelberg (2004)"},{"key":"29_CR16","unstructured":"K\u00fc\u00e7\u00fck, \u00d6.: Design and Analysis of Cryptographic Hash Functions. PhD thesis, KU Leuven (2012), http:\/\/www.iacr.org\/phds\/?p=detail&entry=777"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11761679_12","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J. Kelsey","year":"2006","unstructured":"Kelsey, J., Kohno, T.: Herding Hash Functions and the Nostradamus Attack. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 183\u2013200. Springer, Heidelberg (2006)"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/11426639_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Kelsey","year":"2005","unstructured":"Kelsey, J., Schneier, B.: Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 474\u2013490. Springer, Heidelberg (2005)"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-10366-7_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"K. Matusiewicz","year":"2009","unstructured":"Matusiewicz, K., Naya-Plasencia, M., Nikoli\u0107, I., Sasaki, Y., Schl\u00e4ffer, M.: Rebound Attack on the Full Lane Compression Function. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 106\u2013125. Springer, Heidelberg (2009)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U.M. Maurer","year":"2004","unstructured":"Maurer, U.M., Renner, R., Holenstein, C.: Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"key":"29_CR21","unstructured":"Moody, D., Paul, S., Smith-Tone, D.: Improved Indifferentiability Security Bound for the JH Mode. In: 3rd SHA-3 Candidate Conference (2012)"},{"key":"29_CR22","unstructured":"NIST. Secure hash standard. In: Federal Information Processing Standard, FIPS 180-2 (April 1995)"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-17401-8_12","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"M. Nandi","year":"2010","unstructured":"Nandi, M., Paul, S.: Speeding Up the Wide-Pipe: Secure and Fast Hashing. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol.\u00a06498, pp. 144\u2013162. Springer, Heidelberg (2010)"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Latif, K., Rao, M.M., Aziz, A., Mahboob, A.: Efficient Hardware Implementations and Hardware Performance Evaluation of SHA-3 Finalists. In: The Third SHA-3 Candidate Conference, Washington D.C., March 22-23 (2012)","DOI":"10.51758\/AGJSR-01-2012-0003"},{"key":"29_CR25","unstructured":"Paul, S., Homsirikamol, E., Gaj, K.: A Novel Permutation-based Hash Mode of Operation FP and The Hash Function SAMOSA. Full version will appear in IACR ePrint Archive"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Rivest, R.: The MD5 message-digest algorithm. IETF RFC 1321 (1992)","DOI":"10.17487\/rfc1321"},{"key":"29_CR27","unstructured":"Rivest, R.: The MD6 Hash Function"},{"key":"29_CR28","unstructured":"Wu, H.: The JH Hash Function. In: The 1st SHA-3 Candidate Conference (2009)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34931-7_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T14:21:10Z","timestamp":1687875670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34931-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642349300","9783642349317"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34931-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}