{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:38:35Z","timestamp":1725471515489},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540360759"},{"type":"electronic","value":"9783540360766"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11792086_41","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T09:48:35Z","timestamp":1159955315000},"page":"582-598","source":"Crossref","is-referenced-by-count":3,"title":["Hard Instances of the Constrained Discrete Logarithm Problem"],"prefix":"10.1007","author":[{"given":"Ilya","family":"Mironov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Mityagin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF02566968","volume":"37","author":"R.C. Bose","year":"1963","unstructured":"Bose, R.C., Chowla, S.: Theorems in the additive theory of numbers. Comment. Math. Helv.\u00a037, 141\u2013147 (1962\u20131963)","journal-title":"Comment. Math. Helv."},{"issue":"3","key":"41_CR2","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1112\/plms\/83.3.532","volume":"83","author":"R.C. Baker","year":"2001","unstructured":"Baker, R.C., Harman, G., Pintz, J.: The difference between consecutive primes. II. Proc. London Math. Soc.\u00a083(3), 532\u2013562 (2001)","journal-title":"Proc. London Math. Soc."},{"key":"41_CR3","series-title":"Graduate texts in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern graph theory. Graduate texts in mathematics, vol.\u00a0184. Springer, Heidelberg (1998)"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11545262_4","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"J.-S. Coron","year":"2005","unstructured":"Coron, J.-S., Lefranc, D., Poupard, G.: A new baby-step giant-step algorithm and some applications to cryptanalysis. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 47\u201360. Springer, Heidelberg (2005)"},{"issue":"1","key":"41_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1002\/jcd.10033","volume":"11","author":"M. Chateauneuf","year":"2003","unstructured":"Chateauneuf, M., Ling, A., Stinson, D.R.: Slope packings and coverings, and generic algorithms for the discrete logarithm problem. J.\u00a0Comb.\u00a0Designs\u00a011(1), 36\u201350 (2003)","journal-title":"J.\u00a0Comb.\u00a0Designs"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. In: STOC 1977, pp. 106\u2013112 (1977)","DOI":"10.1145\/800105.803400"},{"issue":"4","key":"41_CR7","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0022-314X(77)90003-8","volume":"9","author":"P. Erd\u00f6s","year":"1977","unstructured":"Erd\u00f6s, P., Newman, D.J.: Bases for sets of integers. J. Number Theory\u00a09(4), 420\u2013425 (1977)","journal-title":"J. Number Theory"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1137\/0601045","volume":"1","author":"R.L. Graham","year":"1980","unstructured":"Graham, R.L., Sloane, N.J.A.: On additive bases and harmonious graphs. SIAM J. Algebraic and Discrete Methods\u00a01, 382\u2013404 (1980)","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"41_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-26677-0","volume-title":"Unsolved Problems in Number Theory","author":"R.K. Guy","year":"2004","unstructured":"Guy, R.K.: Unsolved Problems in Number Theory, 3rd edn. Springer, Heidelberg (2004)","edition":"3"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/3-540-47555-9_38","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"R. Heiman","year":"1993","unstructured":"Heiman, R.: A note on discrete logorithms with special structure. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 454\u2013457. Springer, Heidelberg (1993)"},{"issue":"1\u20132","key":"41_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(03)00273-7","volume":"138","author":"H. Haanp\u00e4\u00e4","year":"2004","unstructured":"Haanp\u00e4\u00e4, H., Huima, A., \u00d6sterg\u00e5rd, P.R.J.: Sets in \u2124 n with distinct sums of pairs. Discrete Applied Mathematics\u00a0138(1\u20132), 99\u2013106 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"41_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(02)00588-7","volume":"130","author":"J. Hoffstein","year":"2003","unstructured":"Hoffstein, J., Silverman, J.H.: Random small Hamming weight products with applications to cryptography. Discrete Applied Mathematics\u00a0130(1), 37\u201349 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR13","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: Seminumerical Algorithms, 3rd edn. The Art of Computer Programming, vol.\u00a02. Addison-Wesley, Reading (1997)","edition":"3"},{"issue":"2","key":"41_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"V.I. Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Math. Notes\u00a055(2), 165\u2013172 (1994)","journal-title":"Math. Notes"},{"issue":"5\u20136","key":"41_CR15","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1017\/S0963548305007029","volume":"14","author":"A. Naor","year":"2005","unstructured":"Naor, A., Verstra\u00ebte, J.: A note on bipartite graphs without 2k-cycles. Probability, Combinatorics and Computing\u00a014(5\u20136), 845\u2013849 (2005)","journal-title":"Probability, Combinatorics and Computing"},{"key":"41_CR16","unstructured":"O\u2019Bryant, K.: Sidon Sets and Beatty Sequences. PhD thesis, U. of Illinois in Urbana-Champaign (2002)"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"O\u2019Bryant, K.: A complete annotated bibliography of work related to Sidon sequences. Electr. J.\u00a0Combinatorics, DS11 (July 2004)","DOI":"10.37236\/32"},{"issue":"2\/3","key":"41_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1008350005447","volume":"19","author":"A.M. Odlyzko","year":"2000","unstructured":"Odlyzko, A.M.: Discrete logarithms: The past and the future. Des. Codes Cryptography\u00a019(2\/3), 129\u2013145 (2000)","journal-title":"Des. Codes Cryptography"},{"key":"41_CR19","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation (mod p). Mathematics of Computation\u00a032, 918\u2013924 (1978)","journal-title":"Mathematics of Computation"},{"issue":"4","key":"41_CR20","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":"41_CR21","doi-asserted-by":"crossref","first-page":"259","DOI":"10.4064\/aa-65-3-259-282","volume":"65","author":"I.Z. Ruzsa","year":"1993","unstructured":"Ruzsa, I.Z.: Solving a linear equation in a set of integers. Part I. Acta Arith.\u00a065, 259\u2013282 (1993)","journal-title":"Acta Arith."},{"issue":"4","key":"41_CR22","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM\u00a027(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"issue":"2","key":"41_CR23","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0020-0190(00)00173-3","volume":"79","author":"C.-P. Schnorr","year":"2001","unstructured":"Schnorr, C.-P.: Small generic hardcore subsets for the discrete logarithm. Inf. Process. Lett.\u00a079(2), 93\u201398 (2001)","journal-title":"Inf. Process. Lett."},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Lewis, D.J. (ed.) 1969 Number Theory Institute, Providence, Rhode Island. Proceedings of Symposia in Pure Mathematics, vol.\u00a020, pp. 415\u2013440. American Mathematical Society (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"41_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"key":"41_CR26","doi-asserted-by":"publisher","first-page":"377","DOI":"10.2307\/1990067","volume":"43","author":"J. Singer","year":"1938","unstructured":"Singer, J.: A theorem in finite projective geometry and some applications to number theory. Trans.\u00a0Amer.\u00a0Math.\u00a0Soc.\u00a043, 377\u2013385 (1938)","journal-title":"Trans.\u00a0Amer.\u00a0Math.\u00a0Soc."},{"key":"41_CR27","unstructured":"Sella, Y., Jakobsson, M.: Constrained and constant ratio hash functions (manuscript, 2004)"},{"issue":"237","key":"41_CR28","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem. Math. Comput.\u00a071(237), 379\u2013391 (2002)","journal-title":"Math. Comput."},{"key":"41_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-61581-4_66","volume-title":"Algorithmic Number Theory","author":"O. Schirokauer","year":"1996","unstructured":"Schirokauer, O., Weber, D., Denny, T.F.: Discrete logarithms: The effectiveness of the index calculus method. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol.\u00a01122, pp. 337\u2013361. Springer, Heidelberg (1996)"},{"key":"41_CR30","unstructured":"Teske, E.: Square-root algorithms for the discrete logarithm problem (a survey). In: Public-Key Cryptography and Computational Number Theory, pp. 283\u2013301 (2001)"},{"issue":"1","key":"41_CR31","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"},{"issue":"2","key":"41_CR32","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/S0097539792234974","volume":"28","author":"Y. Yacobi","year":"1998","unstructured":"Yacobi, Y.: Fast exponentiation using data compression. SIAM J. Comput.\u00a028(2), 700\u2013703 (1998)","journal-title":"SIAM J. Comput."},{"key":"41_CR33","first-page":"301","volume":"2","author":"K. Zarankiewicz","year":"1951","unstructured":"Zarankiewicz, K.: Problem P 101. Colloq. Math.\u00a02, 301 (1951)","journal-title":"Colloq. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11792086_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:10:08Z","timestamp":1605625808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11792086_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540360759","9783540360766"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/11792086_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}