{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T12:59:58Z","timestamp":1794488398000,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662456071","type":"print"},{"value":"9783662456088","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45611-8_22","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T05:34:07Z","timestamp":1415943247000},"page":"420-438","source":"Crossref","is-referenced-by-count":45,"title":["Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antoine","family":"Joux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chrysanthi","family":"Mavromati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-34931-7_19","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"D.J. Bernstein","year":"2012","unstructured":"Bernstein, D.J., Lange, T.: Computing Small Discrete Logarithms Faster. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol.\u00a07668, pp. 317\u2013338. Springer, Heidelberg (2012)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-42045-0_17","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D.J. Bernstein","year":"2013","unstructured":"Bernstein, D.J., Lange, T.: Non-uniform Cracks in the Concrete: The Power of Free Precomputation. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol.\u00a08270, pp. 321\u2013340. Springer, Heidelberg (2013)"},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0020-0190(02)00269-7","volume":"84","author":"E. Biham","year":"2002","unstructured":"Biham, E.: How to decrypt or even substitute DES-encrypted messages in 228 steps. Inf. Process. Lett.\u00a084(3), 117\u2013124 (2002)","journal-title":"Inf. Process. Lett."},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11693383_8","volume-title":"Selected Areas in Cryptography","author":"A. Biryukov","year":"2006","unstructured":"Biryukov, A., Mukhopadhyay, S., Sarkar, P.: Improved Time-Memory Trade-Offs with Multiple Data. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 110\u2013127. Springer, Heidelberg (2006), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/11693383_8"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44448-3_1","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"A. Biryukov","year":"2000","unstructured":"Biryukov, A., Shamir, A.: Cryptanalytic Time\/Memory\/Data Tradeoffs for Stream Ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 1\u201313. Springer, Heidelberg (2000)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge studies in advanced mathematics (2001)","DOI":"10.1017\/CBO9780511814068"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-34961-4_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"J. Borghoff","year":"2012","unstructured":"Borghoff, J., Canteaut, A., G\u00fcneysu, T., Kavun, E.B., Knezevic, M., Knudsen, L.R., Leander, G., Nikov, V., Paar, C., Rechberger, C., Rombouts, P., Thomsen, S.S., Yal\u00e7\u0131n, T.: PRINCE \u2013 A Low-Latency Block Cipher for Pervasive Computing Applications. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 208\u2013225. Springer, Heidelberg (2012)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Fuhr, T., Gilbert, H., Naya-Plasencia, M., Reinhard, J.-R.: Multiple Differential Cryptanalysis of Round-Reduced PRINCE (Full version). IACR Cryptology ePrint Archive, 2014:89 (2014)","DOI":"10.1007\/978-3-662-46706-0_30"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-40041-4_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A. Canteaut","year":"2013","unstructured":"Canteaut, A., Naya-Plasencia, M., Vayssi\u00e8re, B.: Sieve-in-the-middle: Improved MITM attacks. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 222\u2013240. Springer, Heidelberg (2013)"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-28496-0_18","volume-title":"Selected Areas in Cryptography","author":"S. Chatterjee","year":"2012","unstructured":"Chatterjee, S., Menezes, A., Sarkar, P.: Another Look at Tightness. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol.\u00a07118, pp. 293\u2013319. Springer, Heidelberg (2012)"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/rsa.20219","volume":"33","author":"K.P. Costello","year":"2008","unstructured":"Costello, K.P., Vu, V.H.: The rank of random graphs. Random Structures & Algorithms\u00a033(3), 269\u2013285 (2008)","journal-title":"Random Structures & Algorithms"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-57332-1_46","volume-title":"Advances in Cryptology - ASIACRYPT \u201991","author":"J. Daemen","year":"1993","unstructured":"Daemen, J.: Limitations of the Even-Mansour Construction. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol.\u00a0739, pp. 495\u2013498. Springer, Heidelberg (1993)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-29011-4_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"O. Dunkelman","year":"2012","unstructured":"Dunkelman, O., Keller, N., Shamir, A.: Minimalism in Cryptography: The Even-Mansour Scheme Revisited. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 336\u2013354. Springer, Heidelberg (2012)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-57332-1_17","volume-title":"ASIACRYPT 1991","author":"S. Even","year":"1993","unstructured":"Even, S., Mansour, Y.: A construction of a cipher from a single pseudorandom permutation. In: Imai, H., Rivest, R., Matsumoto, T. (eds.) ASIACRYPT 1991. LNCS, vol.\u00a0739, pp. 210\u2013224. Springer, Heidelberg (1993)"},{"key":"22_CR15","unstructured":"Jean, J., Nikolic, I., Peyrin, T., Wang, L.: S. Wu Security Analysis of PRINCE. In: Fast Software Encryption - 20th International Workshop, FSE 2013, Singapore, March 11-13, 2013. Revised Selected Papers, pp. 92\u2013111 (2013)"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s001450010015","volume":"14","author":"J. Kilian","year":"2001","unstructured":"Kilian, J., Rogaway, P.: How to Protect DES Against Exhaustive Key Search (an Analysis of DESX). J. Cryptology\u00a014(1), 17\u201335 (2001)","journal-title":"J. Cryptology"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45537-X_17","volume-title":"Selected Areas in Cryptography","author":"F. Kuhn","year":"2001","unstructured":"Kuhn, F., Struik, R.: Random walks revisited: Extensions of pollard\u2019s rho algorithm for computing multiple discrete logarithms. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 212\u2013229. Springer, Heidelberg (2001)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-34961-4_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"R. Lampe","year":"2012","unstructured":"Lampe, R., Patarin, J., Seurin, Y.: An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 278\u2013295. Springer, Heidelberg (2012)"},{"key":"22_CR19","unstructured":"Lee, H.T., Cheon, J.H., Hong, J.: Accelerating ID-based Encryption based on Trapdoor DL using Pre-computation. Cryptology ePrint Archive, Report 2011\/187 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-642-29011-4_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Menezes","year":"2012","unstructured":"Menezes, A.: Another Look at Provable Security. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 8\u20138. Springer, Heidelberg (2012)"},{"issue":"4","key":"22_CR21","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"J.M. Pollard","year":"2000","unstructured":"Pollard, J.M.: Kangaroos, Monopoly and Discrete Logarithms. J. Cryptology\u00a013(4), 437\u2013447 (2000)","journal-title":"J. Cryptology"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/0-387-34805-0_38","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"J.-J. Quisquater","year":"1990","unstructured":"Quisquater, J.-J., Delescaille, J.-P.: How Easy Is Collision Search. New Results and Applications to DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 408\u2013413. Springer, Heidelberg (1990)"},{"key":"22_CR23","unstructured":"Soleimany, H., Blondeau, C., Yu, X., Wu, W., Nyberg, K., Zhang, H., Zhang, L., Wang, Y.: Reflection Cryptanalysis of PRINCE-Like Ciphers. In: Fast Software Encryption - 20th International Workshop, FSE 2013, Singapore, March 11-13, 2013. Revised Selected Papers, pp. 71\u201391 (2013)"},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P.C. Oorschot van","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel Collision Search with Cryptanalytic Applications. J. Cryptology\u00a012(1), 1\u201328 (1999)","journal-title":"J. Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45611-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:54:10Z","timestamp":1559044450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45611-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45611-8_22","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}