{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T19:15:45Z","timestamp":1718824545600},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,14]],"date-time":"2012-09-14T00:00:00Z","timestamp":1347580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10623-012-9743-x","type":"journal-article","created":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T14:08:50Z","timestamp":1347545330000},"page":"409-431","source":"Crossref","is-referenced-by-count":4,"title":["Towards factoring in $${SL(2,\\,\\mathbb{F}_{2^n})}$$"],"prefix":"10.1007","volume":"71","author":[{"given":"Christophe","family":"Petit","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,14]]},"reference":[{"key":"9743_CR1","unstructured":"Abdukhalikov K.S., Kim C.: On the security of the hashing scheme based on SL2. In: FSE \u201998: Proceedings of the 5th International Workshop on Fast Software Encryption, pp. 93\u2013102. Springer, London (1998)."},{"key":"9743_CR2","unstructured":"Adleman L.M.: The function field sieve. In: Adleman L.M., Huang M.-D.A. (eds.) ANTS. Lecture Notes in Computer Science, vol. 877, pp. 108\u2013121. Springer, Berlin (1994)."},{"key":"9743_CR3","unstructured":"Babai L.: On the diameter of Eulerian orientations of graphs. In: SODA, pp. 822\u2013831. ACM Press, New York (2006)."},{"issue":"4","key":"9743_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0195-6698(05)80029-0","volume":"13","author":"L. Babai","year":"1992","unstructured":"Babai L., Seress \u00c1.: On the diameter of permutation groups. Eur. J. Comb. 13(4), 231\u2013243 (1992)","journal-title":"Eur. J. Comb."},{"key":"9743_CR5","unstructured":"Babai L., Hetyei G., Kantor W.M., Lubotzky A., Seress \u00c1.: On the diameter of finite groups. In: FOCS, vol. II, pp. 857\u2013865. IEEE, Los Alamitos (1990)."},{"issue":"4","key":"9743_CR6","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1007\/s00039-011-0122-y","volume":"21","author":"E. Breuillard","year":"2011","unstructured":"Breuillard E., Green B., Tao T.: Approximate subgroups of linear groups. Geom. Funct. Anal. 21(4), 774\u2013819 (2011)","journal-title":"Geom. Funct. Anal."},{"key":"9743_CR7","unstructured":"Cathalo J., Petit C.: One-time trapdoor one-way functions. In: Burmester M., Tsudik G., Magliveras S.S., Ilic I. (eds.) ISC. Lecture Notes in Computer Science, vol. 6531, pp. 283\u2013298. Springer, Berlin (2010)."},{"key":"9743_CR8","unstructured":"Celler F., Leedham-Green C.: A non-constructive recognition algorithm for the special linear and other classical groups. In: Groups and Computation II, pp. 61\u201367. American Mathematical Society, Providence (1997)."},{"issue":"1","key":"9743_CR9","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s00145-007-9002-x","volume":"22","author":"D.X. Charles","year":"2009","unstructured":"Charles D.X., Lauter K.E., Goren E.Z.: Cryptographic hash functions from expander graphs. J. Cryptol. 22(1), 93\u2013113 (2009)","journal-title":"J. Cryptol."},{"key":"9743_CR10","unstructured":"Charnes C., Pieprzyk J.: Attacking the SL 2 hashing scheme. In: ASIACRYPT \u201994: Proceedings of the 4th International Conference on the Theory and Applications of Cryptology, pp. 322\u2013330. Springer, London (1995)."},{"issue":"4","key":"9743_CR11","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/TIT.1984.1056941","volume":"30","author":"D. Coppersmith","year":"1984","unstructured":"Coppersmith D.: Fast evaluation of logarithms in fields of characteristic two. IEEE. T. Inform. Theory. 30(4), 587\u2013593 (1984)","journal-title":"IEEE. T. Inform. Theory."},{"key":"9743_CR12","unstructured":"Geiselmann W.: A note on the hash function of Tillich and Z\u00e9mor. In: Gollmann D. (ed.) Fast Software Encryption. Lecture Notes in Computer Science, vol. 1039, pp. 51\u201352. Springer, Cambridge (1996)."},{"issue":"1","key":"9743_CR13","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/s00145-010-9063-0","volume":"24","author":"M. Grassl","year":"2011","unstructured":"Grassl M., Ilic I., Magliveras S.S., Steinwandt R.: Cryptanalysis of the Tillich\u2013Z\u00e9mor hash function. J. Cryptol. 24(1), 148\u2013156 (2011)","journal-title":"J. Cryptol."},{"key":"9743_CR14","doi-asserted-by":"crossref","unstructured":"Helfgott H.A.: Growth and generation in sl 2(z\/pz). Ann. Math. (2) 167(2), 601\u2013623 (2008).","DOI":"10.4007\/annals.2008.167.601"},{"key":"9743_CR15","unstructured":"Helfgott H.A.: Growth and generation in SL 3(Z\/pZ). J. Eur. Math. Soc. 13(3), 761\u2013851 (2011)."},{"key":"9743_CR16","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S. Hoory","year":"2006","unstructured":"Hoory S., Linial N., Wigderson A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43, 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"9743_CR17","unstructured":"Joux, A., Lercier,R.: Discrete logarithms in GF(2607) and GF(2613). Email on the NMBRTHRY mailing list (2005)"},{"key":"9743_CR18","doi-asserted-by":"crossref","unstructured":"Joux A., Stern, J.: Lattice reduction: a toolbox for the cryptanalyst. J. Cryptol. 11(3), 161\u2013185 (1998).","DOI":"10.1007\/s001459900042"},{"key":"9743_CR19","doi-asserted-by":"crossref","unstructured":"Kantor W.M.: Some large trivalent graphs having small diameters. Discret. Appl. Math. 37\/38, 353\u2013357 (1992).","DOI":"10.1016\/0166-218X(92)90145-Z"},{"key":"9743_CR20","unstructured":"Kassabov M., Riley T.R.: Diameters of Cayley graphs of Chevalley groups. Eur. J. Comb. 28(3), 791\u2013800 (2007)."},{"key":"9743_CR21","unstructured":"Larsen M.: Navigating the Cayley graph of $${SL_2(\\mathbb{F}_p)}$$ . Int. Math. Res. Not. 27, 1465\u20131471 (2003)."},{"key":"9743_CR22","first-page":"252","volume":"3","author":"A. Lauder","year":"1999","unstructured":"Lauder A.: Continued fractions of Laurent series with partial quotients from a given set. Acta Arith. XC 3, 252\u2013271 (1999)","journal-title":"Acta Arith. XC"},{"key":"9743_CR23","unstructured":"Lenstra A.K., Lenstra Jr H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261(5), 515\u2013534 (1982)."},{"key":"9743_CR24","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF01263616","volume":"56","author":"M.W. Liebeck","year":"1995","unstructured":"Liebeck M.W., Shalev A.: The probability of generating a finite simple group. Geom. Dedicata 56, 103\u2013113 (1995)","journal-title":"Geom. Dedicata"},{"key":"9743_CR25","unstructured":"Lubotzky A.: Discrete groups, expanding graphs and invariant measures. Birkha\u00fcser Verlag, Basel (1994)."},{"issue":"3","key":"9743_CR26","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0022-0000(80)90024-0","volume":"21","author":"N.A. Lynch","year":"1980","unstructured":"Lynch N.A.: Straight-line program length as a parameter for complexity analysis. J. Comput. Syst. Sci. 21(3), 251\u2013280 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"9743_CR27","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. The Deep Space Network Progress Report, DSN PR 42-44, Jan and Feb, Pasadena, CA, pp. 114\u2013116 (1978)."},{"key":"9743_CR28","doi-asserted-by":"crossref","unstructured":"Menezes A.J., van Oorschot P.C., Vanstone S.A.: Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton (1996).","DOI":"10.1201\/9781439821916"},{"key":"9743_CR29","doi-asserted-by":"crossref","unstructured":"Mesirov J.P., Sweet M.M.: Continued fraction expansions of rational expressions with irreducible denominators in characteristic 2. J. Number Theory 27, 144\u2013148 (1987).","DOI":"10.1016\/0022-314X(87)90058-8"},{"key":"9743_CR30","unstructured":"Odlyzko A.M.: The rise and fall of knapsack cryptosystems. In: Cryptology and Computational Number Theory, pp. 75\u201388. American Mathematical Society, Providence (1990)."},{"key":"9743_CR31","doi-asserted-by":"crossref","unstructured":"Patarin J.: Hidden fields equations (hfe) and isomorphisms of polynomials (ip): two new families of asymmetric algorithms. In: Maurer U.M. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996),","DOI":"10.1007\/3-540-68339-9_4"},{"key":"9743_CR32","doi-asserted-by":"crossref","unstructured":"Petit C., Lauter K.E., Quisquater J.-J.: Cayley hashes: a class of efficient graph-based hash functions. http:\/\/perso.uclouvain.be\/christophe.petit\/files\/Cayley.pdf (2007). Accessed 28 Aug 2012.","DOI":"10.1007\/978-1-4419-5906-5_126"},{"key":"9743_CR33","unstructured":"Petit C., Lauter K. Quisquater J.-J.: Full cryptanalysis of LPS and Morgenstern hash functions. In: Ostrovsky R., Prisco R.D., Visconti I. (eds.) SCN. Lecture Notes in Computer Science, vol. 5229, pp. 263\u2013277. Springer, Heidelberg (2008)."},{"key":"9743_CR34","unstructured":"Petit C.: On graph-based cryptographic hash functions. PhD Thesis, Universit\u00e9 catholique de Louvain. http:\/\/perso.uclouvain.be\/christophe.petit\/files\/thesis.pdf (2009). Accessed 28 Aug 2012."},{"key":"9743_CR35","doi-asserted-by":"crossref","unstructured":"Petit C., Quisquater J.-J.: Preimages for the Tillich\u2013Z\u00e9mor hash function. In: Biryukov A., Gong G., Stinson D.R. (eds.) Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 6544, pp. 282\u2013301. Springer, Berlin (2010a).","DOI":"10.1007\/978-3-642-19574-7_20"},{"key":"9743_CR36","unstructured":"Petit C., Quisquater J.-J.: Rubik\u2019s for cryptographers. http:\/\/eprint.iacr.org\/2011\/638.pdf (2010b). Accessed 28 Aug 2012."},{"key":"9743_CR37","unstructured":"Petit C., Quisquater J.-J., Tillich J.-P., Z\u00e9mor G.: Hard and easy components of collision search in the Z\u00e9mor\u2013Tillich hash function: new attacks and reduced variants with equivalent security. In: Fischlin M. (ed.) CT-RSA. Lecture Notes in Computer Science, vol. 5473, pp. 182\u2013194. Springer, Berlin (2009)."},{"key":"9743_CR38","unstructured":"Pyber L., Szab\u00f3 E.: Growth in finite simple groups of Lie type. http:\/\/arxiv.org\/abs\/1001.4556 (Jan 2010)."},{"key":"9743_CR39","doi-asserted-by":"crossref","unstructured":"Quisquater J.-J., Delescaille J.-P.: How easy is collision search? application to DES (extended summary). In: EUROCRYPT, pp. 429\u2013434 (1989).","DOI":"10.1007\/3-540-46885-4_43"},{"key":"9743_CR40","unstructured":"Regev O.: Lattice-based cryptography. In: Dwork C. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 4117, pp. 131\u2013141. Springer, Heidelberg (2006)."},{"key":"9743_CR41","doi-asserted-by":"crossref","unstructured":"Riley T.R.: Navigating in the Cayley graphs of $${SL_N(\\mathbb{Z})}$$ and $${SL_N(\\mathbb{F}_p)}$$ . Geom. Dedicata 113\/1, 215\u2013229 (2005).","DOI":"10.1007\/s10711-005-5230-0"},{"key":"9743_CR42","doi-asserted-by":"crossref","unstructured":"Rivest R.L., Shamir A., Adleman L.M.: A method for obtaining digital signatures and public-key cryptosystems (reprint). Commun. ACM 26(1), 96\u201399 (1983).","DOI":"10.1145\/357980.358017"},{"key":"9743_CR43","unstructured":"Steinwandt R., Grassl M., Geiselmann W., Beth T.: Weaknesses in the $${SL_2(\\mathbb{F}_{2^n})}$$ hashing scheme. In: Bellare M. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 1880, pp. 287\u2013299. Springer, Berlin (2000)."},{"key":"9743_CR44","unstructured":"Thom\u00e9 E.: Computation of discrete logarithms in $${\\mathbb{F}_2^{607}}$$ . In: Boyd C. (ed.) ASIACRYPT. Lecture Notes in Computer Science, vol. 2248, pp. 107\u2013124. Springer, Berlin (2001)."},{"key":"9743_CR45","unstructured":"Tillich J.-P., Z\u00e9mor G.: Hashing with SL 2. In: Desmedt Y. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 839, pp. 40\u201349. Springer, Berlin (1994)."},{"key":"9743_CR46","unstructured":"Tillich J.-P., Z\u00e9mor G.: Collisions for the LPS expander graph hash function. In: Smart N.P. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 4965, pp. 254\u2013269. Springer, Heidelberg (2008)."},{"key":"9743_CR47","unstructured":"Wagner D.: A generalized birthday problem. In: Yung M. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 2442, pp. 288\u2013303. Springer, Berlin (2002)."},{"key":"9743_CR48","unstructured":"Z\u00e9mor G.: Hash functions and graphs with large girths. In: Davies D.W. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 547, pp. 508\u2013511. Springer, Berlin (1991)."},{"issue":"4","key":"9743_CR49","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01388652","volume":"4","author":"G. Z\u00e9mor","year":"1994","unstructured":"Z\u00e9mor G.: Hash functions and Cayley graphs. Des. Codes Cryptogr., 4(4), 381\u2013394 (1994)","journal-title":"Des. Codes Cryptogr.,"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9743-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9743-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9743-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T22:08:48Z","timestamp":1643407728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9743-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,14]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9743"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9743-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,14]]}}}