{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:14:34Z","timestamp":1766578474567,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566861"},{"type":"electronic","value":"9783540476306"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56686-4_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:24:57Z","timestamp":1330255497000},"page":"121-131","source":"Crossref","is-referenced-by-count":26,"title":["Fixed-parameter complexity and cryptography"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal","family":"Koblitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00196789","volume":"3","author":"G. B. Agnew","year":"1991","unstructured":"G. B. Agnew, R. C. Mullin, I. M. Onyszchuk, and S. A. Vanstone: An implementation for a fast public-key cryptosystem, J. Cryptology, vol. 3 (1991), pp. 63\u201379.","journal-title":"J. Cryptology"},{"key":"10_CR2","unstructured":"J. Buss and J. Goldsmith: Nondeteriminism within P, SIAM J. Computing, to appear."},{"key":"10_CR3","unstructured":"J. P. Buhler, H. W. Lenstra, Jr., and C. Pomerance: Factoring integers with the number field sieve, to appear."},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-314X(83)90002-1","volume":"17","author":"E. R. Canfield","year":"1983","unstructured":"E. R. Canfield, P. Erd\u00f6s, and C. Pomerance: On a problem of Oppenheim concerning \u201cFactorisatio Numerorum,\u201d J. Number Theory, vol. 17 (1983), pp. 1\u201328.","journal-title":"J. Number Theory"},{"key":"10_CR5","first-page":"161","volume":"87","author":"R. G. Downey","year":"1992","unstructured":"R. G. Downey and M. R. Fellows: Fixed-parameter tractability and completeness, Congresses Numerantium, vol. 87 (1992), pp. 161\u2013178.","journal-title":"Congresses Numerantium"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows: Fixed-parameter intractability, Proceedings of the Seventh Annual IEEE Conference on Structure in Complexity Theory, 1992, pp. 36\u201349.","DOI":"10.1109\/SCT.1992.215379"},{"key":"10_CR7","unstructured":"R. G. Downey and M. R. Fellows: Fixed-parameter tractability and completeness I: basic results, to appear."},{"key":"10_CR8","unstructured":"R. G. Downey and M. R. Fellows: Fixed-parameter tractability and completeness II: on completeness for W[1], to appear."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"M. R. Fellows and N. Koblitz: Self-witnessing polynomial-time complexity and prime factorization, Proceedings of the Seventh Annual IEEE Conference on Structure in Complexity Theory, 1992, pp. 107\u2013110.","DOI":"10.1109\/SCT.1992.215385"},{"key":"10_CR10","unstructured":"M. R. Fellows and N. Koblitz: Kid krypto, Advances in Cryptology \u2014 Crypto '92, Springer-Verlag, to appear."},{"key":"10_CR11","unstructured":"M. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of N P-Completeness, W. H. Freeman, 1979."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"D. Gordon: Discrete logarithms in GF(p) using the number field sieve, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/0406010"},{"key":"10_CR13","unstructured":"D. Gordon: Discrete logarithms in GF(p n) using the number field sieve, Preprint."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"N. Koblitz: CM-curves with good cryptographic properties, Advances in Cryptology \u2014 Crypto '91, Springer-Verlag, 1992, pp. 279\u2013287.","DOI":"10.1007\/3-540-46766-1_22"},{"key":"10_CR15","doi-asserted-by":"crossref","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, Annals Math., vol. 126 (1987), pp. 649\u2013673.","journal-title":"Annals Math."},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1090\/S0894-0347-1992-1137100-0","volume":"5","author":"H. W. Lenstra Jr.","year":"1992","unstructured":"H. W. Lenstra, Jr. and C. Pomerance: A rigorous time bound for factoring integers, J. Amer. Math. Soc., vol. 5 (1992), pp. 483\u2013516.","journal-title":"J. Amer. Math. Soc."},{"key":"10_CR17","unstructured":"A. Menezes and S. A. Vanstone: The implementation of elliptic curve cryptosystems, Advances in Cryptology \u2014 Auscrypt '90, Springer-Verlag, 1990, pp. 2\u201313."},{"key":"10_CR18","first-page":"415","volume":"26","author":"J. Nesetr\u00edl","year":"1985","unstructured":"J. Nesetr\u00edl and S. Poljak: On the complexity of the subgraph problem, Cornmen. Math. Univ. Carol., vol. 26 (1985), pp. 415\u2013419.","journal-title":"Cornmen. Math. Univ. Carol."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"A. Odlyzko: Discrete logarithms and their cryptographic significance, Advances in Cryptology \u2014 Eurocrypt '84, Springer-Verlag, 1985, pp. 224\u2013314.","DOI":"10.1007\/3-540-39757-4_20"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"C. Pomerance: Fast, rigorous factorization and discrete logarithm algorithms, in D. S. Johnson, T. Nishizeki, A. Nozaki, H. S. Wilf, eds., Discrete Algorithms and Complexity, Academic Press, 1987, pp. 119\u2013143.","DOI":"10.1016\/B978-0-12-386870-1.50014-9"},{"key":"10_CR21","unstructured":"K. Rosen: Elementary Number Theory and Its Applications, 3rd ed., Addison-Wesley, 1993."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"P. van Oorschot: A comparison of practical public-key cryptosystems based on integer factorization and discrete logarithms, in G. Simmons, ed., Contemporary Cryptology: The Science of Information Integrity, IEEE Press, 1992, pp. 289\u2013322.","DOI":"10.1007\/3-540-38424-3_40"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56686-4_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:51:46Z","timestamp":1742593906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56686-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566861","9783540476306"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-56686-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}