{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:30:56Z","timestamp":1674228656826},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10623-011-9527-8","type":"journal-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T04:10:09Z","timestamp":1307506209000},"page":"1-13","source":"Crossref","is-referenced-by-count":3,"title":["A low-memory algorithm for finding short product representations in finite groups"],"prefix":"10.1007","volume":"63","author":[{"given":"Gaetan","family":"Bisson","sequence":"first","affiliation":[]},{"given":"Andrew V.","family":"Sutherland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,9]]},"reference":[{"key":"9527_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"Alon N., Milman V.D.: \u03bb1, isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory B 38, 73\u201388 (1985)","journal-title":"J. Comb. Theory B"},{"key":"9527_CR2","unstructured":"Alon N., Barak A., Manber U.: On disseminating information reliably without broadcasting. In: Popescu-Zeletin R., Le Lann G., Kim K.H. (eds.) Proceedings of the 7th International Conference on Distributed Computing Systems, pp. 74\u201381. IEEE Computer Society Press, Los Alamitos (1987)."},{"key":"9527_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0304-0208(08)73487-X","volume":"60","author":"L. Babai","year":"1982","unstructured":"Babai L., Erd\u0151s P.: Representation of group elements as short products. North-Holland Math. Stud. 60, 27\u201330 (1982)","journal-title":"North-Holland Math. Stud."},{"issue":"191","key":"9527_CR4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1090\/S0025-5718-1990-1023756-8","volume":"55","author":"E. Bach","year":"1990","unstructured":"Bach E.: Explicit bounds for primality testing and related problems. Math. Comput. 55(191), 355\u2013380 (1990)","journal-title":"Math. Comput."},{"key":"9527_CR5","unstructured":"Bisson G.: Computing endomorphism rings of elliptic curves under the GRH (2010, in preparation)."},{"key":"9527_CR6","unstructured":"Bisson G., Sutherland A.V.: Computing the endomorphism ring of an ordinary elliptic curve over a finite field. J. Number Theory (special issue on Elliptic Curve Cryptography) (2009, to appear)."},{"key":"9527_CR7","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"R.P. Brent","year":"1980","unstructured":"Brent R.P.: An improved Monte Carlo factorization algorithm. BIT Numer. Math. 20, 176\u2013184 (1980)","journal-title":"BIT Numer. Math."},{"key":"9527_CR8","unstructured":"Childs A.M., Jao D., Soukharev V.: Constructing elliptic curve isogenies in quantum subexponential time. http:\/\/arxiv.org\/abs\/1012.4019 (2010)."},{"key":"9527_CR9","first-page":"247","volume":"28","author":"R.B. Eggleton","year":"1975","unstructured":"Eggleton R.B., Erd\u0151s P.: Two combinatorial problems in group theory. Acta Arithmetica 28, 247\u2013254 (1975)","journal-title":"Acta Arithmetica"},{"issue":"1","key":"9527_CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02806383","volume":"14","author":"P. Erd\u0151s","year":"1965","unstructured":"Erd\u0151s P., R\u00e9nyi A.: Probabilistic methods in group theory. Journal d\u2019Analyse Math\u00e9matique 14(1), 127\u2013138 (1965)","journal-title":"Journal d\u2019Analyse Math\u00e9matique"},{"key":"9527_CR11","first-page":"118","volume":"2","author":"S.D. Galbraith","year":"1999","unstructured":"Galbraith S.D.: Constructing isogenies between elliptic curves over finite fields. J. Comput. Math. 2, 118\u2013138 (1999)","journal-title":"J. Comput. Math."},{"key":"9527_CR12","unstructured":"Galbraith S.D., Hess F., Smart N.P.: Extending the GHS Weil descent attack. In: Knudsen L.R. (eds.) Advances in Cryptology\u2013EUROCRYPT \u201902. Lecture Notes in Computer Science, vol. 2332, pp. 29\u201344. Springer, Heidelberg (2002)."},{"issue":"4","key":"9527_CR13","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"J.L. Hafner","year":"1989","unstructured":"Hafner J.L., McCurley K.S.: A rigorous subexponential algorithm for computing in class groups. J. Am. Math. Soc. 2(4), 837\u2013850 (1989)","journal-title":"J. Am. Math. Soc."},{"key":"9527_CR14","unstructured":"Howgrave-Graham N., Joux A.: New generic algorithms for hard knapsacks. In: Gilbert H. (eds.) Advances in Cryptology\u2014EUROCRYPT \u201910. Lecture Notes in Computer Science, vol. 6110, pp. 235\u2013256. Springer, Heidelberg (2010)."},{"issue":"4","key":"9527_CR15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"Impagliazzo R., Naor M.: Efficient cryptographic schemes provably as secure as subset sum. J. Cryptol. 9(4), 199\u2013216 (1996)","journal-title":"J. Cryptol."},{"issue":"6","key":"9527_CR16","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1016\/j.jnt.2008.11.006","volume":"129","author":"D. Jao","year":"2009","unstructured":"Jao D., Miller S.D., Venkatesan R.: Expander graphs based on GRH with an application to elliptic curve cryptography. J. Number Theory 129(6), 1491\u20131504 (2009)","journal-title":"J. Number Theory"},{"key":"9527_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"9527_CR18","volume-title":"The Art of Computer Programming. Seminumerical Algorithms, Vol. II","author":"D.E. Knuth","year":"1998","unstructured":"Knuth D.E.: The Art of Computer Programming. Seminumerical Algorithms, Vol. II. Addison-Wesley, Boston (1998)"},{"key":"9527_CR19","volume-title":"The Art of Computer Programming. Fascicle 2: Generating all Tuples and Permutations, Vol. IV","author":"D.E. Knuth","year":"2005","unstructured":"Knuth D.E.: The Art of Computer Programming. Fascicle 2: Generating all Tuples and Permutations, Vol. IV. Addison-Wesley, Boston (2005)"},{"issue":"5","key":"9527_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.: Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inform. Theory 24(5), 525\u2013530 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"9527_CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"Pollard J.M.: A Monte Carlo method for factorization. BIT Numer. Math. 15(3), 331\u2013334 (1975)","journal-title":"BIT Numer. Math."},{"key":"9527_CR22","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/120694.120711","volume-title":"International Symposium on Symbolic and Algebraic Computation\u2013ISSAC \u201991","author":"A. Sch\u00f6nhage","year":"1991","unstructured":"Sch\u00f6nhage A.: Fast reduction and composition of binary quadratic forms. In: Watt, S.M. (eds.) International Symposium on Symbolic and Algebraic Computation\u2013ISSAC \u201991, pp. 128\u2013133. ACM Press, New York (1991)"},{"key":"9527_CR23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R. Schoof","year":"1995","unstructured":"Schoof R.: Counting points on elliptic curves over finite fields. Journal de Th\u00e9orie des Nombres de Bordeaux 7, 219\u2013254 (1995)","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"issue":"3","key":"9527_CR24","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R. Schroeppel","year":"1981","unstructured":"Schroeppel R., Shamir A.: A T\u00a0=\u00a0O(2 n\/2), S\u00a0=\u00a0O(2 n\/4) algorithm for certain NP-complete problems. SIAM J. Comput. 10(3), 456\u2013464 (1981)","journal-title":"SIAM J. Comput."},{"key":"9527_CR25","doi-asserted-by":"crossref","unstructured":"Sedgewick R., Szymanski T.G.: The complexity of finding periods. In: Proceedings of the 11th ACM Symposium on the Theory of Computing. pp. 74\u201380. ACM Press, New York (1979).","DOI":"10.1145\/800135.804400"},{"key":"9527_CR26","unstructured":"Shoup V.: Lower bounds for discrete logarithms and related problems. In: Advances in Cryptology\u2013EUROCRYPT \u201997. Lecture Notes in Computer Science, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). Revised version."},{"key":"9527_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.4064\/aa-1-1-83-86","volume":"1","author":"C.L. Siegel","year":"1935","unstructured":"Siegel C.L.: \u00dcber die Classenzahl quadratischer Zahlk\u00f6rper. Acta Arithmetica 1, 83\u201386 (1935)","journal-title":"Acta Arithmetica"},{"key":"9527_CR28","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/1109048","volume":"9","author":"I.M. Sobol","year":"1964","unstructured":"Sobol I.M.: On periods of pseudo-random sequences. Theory Prob. Appl. 9, 333\u2013338 (1964)","journal-title":"Theory Prob. Appl."},{"key":"9527_CR29","unstructured":"Sutherland A.V.: Genus 1 point counting in quadratic space and essentially quartic time (in preparation)."},{"key":"9527_CR30","unstructured":"Sutherland A.V.: Order Computations in Generic Groups. PhD thesis, MIT, Cambridge (2007) http:\/\/groups.csail.mit.edu\/cis\/theses\/sutherland-phd.pdf ."},{"key":"9527_CR31","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1090\/S0025-5718-98-00968-5","volume":"67","author":"E. Teske","year":"1998","unstructured":"Teske E.: A space efficient algorithm for group structure computation. Math. Comput. 67, 1637\u20131663 (1998)","journal-title":"Math. Comput."},{"key":"9527_CR32","doi-asserted-by":"crossref","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. Cryptol. 12, 1\u201328 (1999)","journal-title":"J. Cryptol."},{"key":"9527_CR33","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0097-3165(78)90051-1","volume":"24","author":"E. White","year":"1978","unstructured":"White E.: Ordered sums of group elements. J. Combin. Theory A 24, 118\u2013121 (1978)","journal-title":"J. Combin. Theory A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10623-011-9527-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T10:16:06Z","timestamp":1560248166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9527-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,9]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9527"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9527-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,9]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-011-9527-8', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>3</sup></a></div><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>3</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>