{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:07Z","timestamp":1725566287985},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226680"},{"type":"electronic","value":"9783540286288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28628-8_12","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:54:02Z","timestamp":1285016042000},"page":"201-212","source":"Crossref","is-referenced-by-count":0,"title":["On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields"],"prefix":"10.1007","author":[{"given":"Qi","family":"Cheng","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00196789","volume":"3","author":"G.B. Agnew","year":"1991","unstructured":"Agnew, G.B., Mullin, R.C., Onyszchuk, I.M., Vanstone, S.A.: An implementation for a fast public-key cryptosystem. Journal of Cryptology\u00a03, 63\u201379 (1991)","journal-title":"Journal of Cryptology"},{"key":"12_CR2","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: Primes is in P (2002), \n                    \n                      http:\/\/www.cse.iitk.ac.in\/news\/primality.pdf"},{"key":"12_CR3","volume-title":"Algorithmic Number theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number theory, vol.\u00a0I. The MIT Press, Cambridge (1996)"},{"key":"12_CR4","unstructured":"Bernstein, D.J.: Proving primality in essentially quartic random time (2003), \n                    \n                      http:\/\/cr.yp.to\/papers\/quartic.pdf"},{"key":"12_CR5","unstructured":"Bernstein, D.J.: Sharper ABC-based bounds for congruent polynomials (2003), \n                    \n                      http:\/\/cr.yp.to\/"},{"key":"12_CR6","unstructured":"Pedro Berrizbeitia. Sharpening \u201cprimes is in p\u201d for a large family of numbers (2002), \n                    \n                      http:\/\/lanl.arxiv.org\/abs\/math.NT\/0211334"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-45146-4_20","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Q. Cheng","year":"2003","unstructured":"Cheng, Q.: Primality proving via one round in ECPP and one iteration in AKS. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 338\u2013348. Springer, Heidelberg (2003)"},{"key":"12_CR8","unstructured":"Cheng, Q.: Constructing finite field extensions with large order elements. In: ACMSIAM Symposium on Discrete Algorithms (SODA) (2004)"},{"key":"12_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"M. Fellows","year":"1993","unstructured":"Fellows, M., Koblitz, N.: Fixed-parameter complexity and cryptography. In: Moreno, O., Cohen, G., Mora, T. (eds.) AAECC 1993. LNCS, vol.\u00a0673, Springer, Heidelberg (1993)"},{"key":"12_CR11","unstructured":"Gao, S.: Normal Bases over Finite Fields. PhD thesis, The University of Waterloo (1993)"},{"issue":"6","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory\u00a045(6), 1757\u20131767 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1008350005447","volume":"19","author":"M. Odlyzko","year":"2000","unstructured":"Odlyzko, M.: Discrete logarithms: The past and the future. Designs, Codes, and Cryptography\u00a019, 129\u2013145 (2000)","journal-title":"Designs, Codes, and Cryptography"},{"key":"12_CR14","doi-asserted-by":"publisher","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. Comp.\u00a071, 379\u2013391 (2002)","journal-title":"Math. Comp."},{"key":"12_CR15","unstructured":"Voloch, J.F.: On some subgroups of the multiplicative group of finite rings (2003), \n                    \n                      http:\/\/www.ma.utexas.edu\/users\/voloch\/preprint.html"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"von Gathen, J.Z.: Efficient exponentiation in finite fields. In: Proc. 32nd IEEE Symp. on Foundations of Comp. Science (1991)","DOI":"10.1109\/SFCS.1991.185395"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28628-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:41Z","timestamp":1620012461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28628-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226680","9783540286288"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28628-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}