{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:19:32Z","timestamp":1776842372521,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540770251","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77026-8_17","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T01:56:14Z","timestamp":1196387774000},"page":"224-237","source":"Crossref","is-referenced-by-count":12,"title":["Solving Discrete Logarithms from Partial Knowledge of the Key"],"prefix":"10.1007","author":[{"given":"K.","family":"Gopalakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Th\u00e9riault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chui Zhi","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Brier, \u00c9., D\u00e9ch\u00e8ne, I., Joye, M.: Unified point addition formul\u00e6 for elliptic curve cryptosystems. In: Embedded Cryptographic Hardware: Methodologies and Architectures, pp. 247\u2013256. Nova Science Publishers (2004)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"Public Key Cryptography","author":"\u00c9. Brier","year":"2002","unstructured":"Brier, \u00c9., Joye, M.: Weierstra\u00df elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 335\u2013345. Springer, Heidelberg (2002)"},{"issue":"6","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/S0097539704446037","volume":"34","author":"Q. Cheng","year":"2005","unstructured":"Cheng, Q.: On the bounded sum-of-digits discrete logarithm problem in finite fields. SIAM J. Comput.\u00a034(6), 1432\u20131442 (2005)","journal-title":"SIAM J. Comput."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-44709-1_21","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"K. Gandolfi","year":"2001","unstructured":"Gandolfi, K., Mourtel, C., Olivier, F.: Electromagnetic analysis: Concrete results. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 251\u2013261. Springer, Heidelberg (2001)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D.M. Gordon","year":"1998","unstructured":"Gordon, D.M.: A survey of fast exponentiation methods. Journal of Algorithms\u00a027, 129\u2013146 (1998)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"N. Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N., Smart, N.P.: Lattice attacks on digital signature schemes. Des. Codes Cryptogr.\u00a023(3), 283\u2013290 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"P.C. Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.C. Kocher","year":"1999","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/978-3-540-28632-5_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"P.J. Leadbitter","year":"2004","unstructured":"Leadbitter, P.J., Page, D., Smart, N.P.: Attacking DSA under a repeated bits assumption. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 428\u2013440. Springer, Heidelberg (2004)"},{"key":"17_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton (1996)"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P.Q. Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptology\u00a015(3), 151\u2013176 (2002)","journal-title":"J. Cryptology"},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1025436905711","volume":"30","author":"P.Q. Nguyen","year":"2003","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Des. Codes Cryptogr.\u00a030(2), 201\u2013217 (2003)","journal-title":"Des. Codes Cryptogr."},{"key":"17_CR13","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. Designs, Codes and Cryptography\u00a019, 129\u2013145 (2000)","journal-title":"Designs, Codes and Cryptography"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory\u00a024, 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"143","key":"17_CR15","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(143), 918\u2013924 (1978)","journal-title":"Mathematics of Computation"},{"issue":"4","key":"17_CR16","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. Journal of Cryptology\u00a013(4), 437\u2013447 (2000)","journal-title":"Journal of Cryptology"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45418-7_17","volume-title":"Smart Card Programming and Security","author":"J.-J. Quisquater","year":"2001","unstructured":"Quisquater, J.-J., Samyde, D.: Electromagnetic analysis (EMA): Measures and counter-measures for smart cards. In: Attali, S., Jensen, T. (eds.) E-smart 2001. LNCS, vol.\u00a02140, pp. 200\u2013210. Springer, Heidelberg (2001)"},{"key":"17_CR18","volume-title":"Wiley-Interscience Series in Discrete Mathematics","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. In: Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, Chichester (1986)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorization and genera. In: Proc. Symp. Pure Math., vol.\u00a020, pp. 415\u2013440 (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"17_CR20","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":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11894063_28","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"D. Stebila","year":"2006","unstructured":"Stebila, D., Th\u00e9riault, N.: Unified point addition formulae and side-channel attacks. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 354\u2013368. Springer, Heidelberg (2006)"},{"issue":"237","key":"17_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"D. Stinson","year":"2002","unstructured":"Stinson, D.: Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Math. Comp.\u00a071(237), 379\u2013391 (2002)","journal-title":"Math. Comp."},{"key":"17_CR23","first-page":"283","volume-title":"Public-Key Cryptography and Computational Number Theory","author":"E. Teske","year":"2001","unstructured":"Teske, E.: Square-root algorithms for the discrete logarithm problem (a survey). In: Public-Key Cryptography and Computational Number Theory, pp. 283\u2013301. Walter de Gruyter, Berlin (2001)"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-540-28632-5_14","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"C.D. Walter","year":"2004","unstructured":"Walter, C.D.: Simple power analysis of unified code for ECC double and add. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 191\u2013204. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77026-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:42Z","timestamp":1619506482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77026-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770251"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77026-8_17","relation":{},"subject":[]}}