{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:19:00Z","timestamp":1725488340953},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48071-4_5","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:23:49Z","timestamp":1186363429000},"page":"66-75","source":"Crossref","is-referenced-by-count":13,"title":["Designing and Detecting Trapdoors for Discrete Log Cryptosystems"],"prefix":"10.1007","author":[{"given":"Daniel M.","family":"Gordon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Public-key Cryptography, State of the Art and Future Directions","year":"1992","unstructured":"T. Beth, M. Frisch and G.J. Simmons, eds., Public-key Cryptography, State of the Art and Future Directions, LNCS #578. Springer, 1992."},{"key":"5_CR2","unstructured":"M. Blum. Coin flipping by telephone: A protocol for solving impossible problems, (Proceedings of the 24th IEEE Computer Conference, 1982, pp. 133\u2013137."},{"key":"5_CR3","unstructured":"E.F. Brickell and K.S. McCurley, An Interactive Identification Scheme Based on Discrete Logarithms and Factoring, Journal of Cryptology, to appear."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.2307\/2008660","volume":"52","author":"J. Buchmann","year":"1989","unstructured":"J. Buchmann and A. Peth\u00f6. Computation of independent units in number fields by Dirichlet\u2019s method, Math. Comp., 52 (1989), pp. 149\u2013159.","journal-title":"Math. Comp."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"D. Coppersmith, A.M. Odlyzko and R. Schroeppel, Discrete logarithms in GF(p), Algorithmica, 1 (1986), pp. 1\u201315.","journal-title":"Algorithmica"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M.E. Hellman, New directions in cryptography, IEEE Trans. Info. Theory, 22 (1976), pp. 644\u2013654.","journal-title":"IEEE Trans. Info. Theory"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"D. Gordon, Discrete logarithms in GF(p) using the number field sieve, SIAM Journal on Discrete Math., to appear.","DOI":"10.1137\/0406010"},{"key":"5_CR8","volume-title":"Seminumerical Algorithms","author":"D.E. Knuth","year":"1981","unstructured":"D.E. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, Second Edition, Addison-Wesley, Massachusetts, 1981.","edition":"Second Edition"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF00123958","volume":"1","author":"B. LaMacchia","year":"1991","unstructured":"B. LaMacchia and A.M. Odlyzko. Computation of discrete logarithms in prime fields, Designs, Codes and Cryptography, 1 (1991), pp. 47\u201362.","journal-title":"Designs, Codes and Cryptography"},{"key":"5_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology: Proceedings of Crypto\u2019 90","author":"B. LaMacchia","year":"1991","unstructured":"B. LaMacchia and A.M. Odlyzko, Solving large sparse linear systems over finite fields. Advances in Cryptology: Proceedings of Crypto\u2019 90, (A. Menezes, S. Vanstone, eds.), Lecture Notes in Computer Science. Springer-Verlag, New York, 1991."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"H.W. Lenstra, Jr., Factoring integers with elliptic curves, Ann. of Math., 126 (1987), pp. 649\u2013673.","journal-title":"Ann. of Math."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra, Jr., and L. Lov\u00e1sz. Factoring polynomials with rational coefficients, Math. Ann.\n                  261 (1982), pp. 515\u2013534.","journal-title":"Math. Ann."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse and J.M. Pollard, The number field sieve, Proc. 22nd ACM Symposium on Theory of Computing (1990) pp. 564\u2013572.","DOI":"10.1145\/100216.100295"},{"key":"5_CR14","unstructured":"A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse and J.M. Pollard. The factorization of the ninth Fermat number, preprint, 1991."},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/3-540-46416-6_43","volume-title":"Advances in Cryptology: Proceedings of Eurocrypt\u2019 91","author":"U.M. Maurer","year":"1991","unstructured":"U.M. Maurer and Y. Yacobi, A non-interactive public-key distribution system, Advances in Cryptology: Proceedings of Eurocrypt\u2019 91, (D.W. Davies, ed.), Lecture Notes in Computer Science, Springer-Verlag, New York, 1991, pp. 498\u2013507."},{"key":"5_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511661952","volume-title":"Algorithmic Algebraic Number Theory","author":"M. Pohst","year":"1989","unstructured":"M. Pohst and H. Zassenhaus, Algorithmic Algebraic Number Theory, Cambridge University Press, Cambridge, 1989."},{"key":"5_CR17","volume-title":"On pro-finite groups and on discrete logarithms","author":"O. Schirokauer","year":"1992","unstructured":"O. Schirokauer, On pro-finite groups and on discrete logarithms, Ph.D. thesis, University of California, Berkeley, May 1992."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"C.P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, to appear.","DOI":"10.1007\/BF00196725"},{"key":"5_CR19","unstructured":"M.E. Smid and D.K. Branstad. Response to comments on the NIST Proposed Digital Signature Standard, Advances in Cryptology: Proceedings of Crypto\u2019 92, to appear."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D.H. Wiedemann","year":"1986","unstructured":"D.H. Wiedemann. Solving sparse linear equations over finite fields, IEEE Trans. Info. Theory.\n                  32 (1986), pp. 54\u201362.","journal-title":"IEEE Trans. Info. Theory."},{"key":"5_CR21","unstructured":"Specifications for a digital signature standard, National Institute for Standards and Technology, Federal Information Processing Standard Publication XX, draft, August 1991."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:22Z","timestamp":1605647722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540573401"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_5","relation":{},"subject":[]}}