{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:16:49Z","timestamp":1725549409414},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310129"},{"type":"electronic","value":"9783540331537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11604938_20","type":"book-chapter","created":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T10:28:58Z","timestamp":1138789738000},"page":"259-270","source":"Crossref","is-referenced-by-count":1,"title":["Practical Modifications of Leadbitter et al.\u2019s Repeated-Bits Side-Channel Analysis on (EC)DSA"],"prefix":"10.1007","author":[{"given":"Katsuyuki","family":"Takashima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"ANSI X 9.30: 1, American National Standard for Financial Services - Public Key Cryptography for the Financial Services Industry: Part 1: The Digital Signature Algorithm (DSA). American National Standard Institute (1997)"},{"key":"20_CR2","unstructured":"ANSI X 9.62, American National Standard for Financial Services - Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA). American National Standard Institute (1998)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"E.F. Brickell","year":"1993","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 200\u2013207. Springer, Heidelberg (1993)"},{"key":"20_CR4","unstructured":"FIPS 186-2, Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2, U.S. Department of Commerce\/ N.I.S.T. (January 27, 2000)"},{"key":"20_CR5","unstructured":"Granboulan, L.: PECDSA: How to build a DL-based digital signature scheme with the best proven security, NESSIE Report, Available at: \n                    \n                      https:\/\/www.cosic.esat.kuleuven.ac.be\/nessie\/reports\/"},{"key":"20_CR6","volume-title":"Geometry of numbers","author":"P.M. Gruber","year":"1987","unstructured":"Gruber, P.M., Lekkerkerker, C.G.: Geometry of numbers. North-Holland, Amsterdam (1987)"},{"key":"20_CR7","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"20_CR8","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. Designs, Codes and Cryptography\u00a023, 283\u2013290 (2001)","journal-title":"Designs, Codes and Cryptography"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-45238-6_30","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"K. Itoh","year":"2003","unstructured":"Itoh, K., Izu, T., Takenaka, M.: A practical countermeasure against address-bit differential power analysis. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 382\u2013396. Springer, Heidelberg (2003)"},{"key":"20_CR10","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":"20_CR11","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":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.: 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":"20_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann.\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"20_CR14","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"20_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of lattice problems : A cryptographic perspectives","author":"D. Micciancio","year":"2002","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of lattice problems: A cryptographic perspectives. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45439-X_22","volume-title":"Information Security","author":"B. M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B.: Securing elliptic curve point multiplication against side-channel attacks. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 324\u2013334. Springer, Heidelberg (2001); Addendum: Efficiency improvement, Available at: \n                    \n                      http:\/\/bmoeller.de\/"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45811-5_31","volume-title":"Information Security","author":"B. M\u00f6ller","year":"2002","unstructured":"M\u00f6ller, B.: Parallelizable elliptic curve point multiplication method with resistance against side-channel attacks. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 402\u2013413. Springer, Heidelberg (2002)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36552-4_21","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B. M\u00f6ller","year":"2003","unstructured":"M\u00f6ller, B.: Improved techniques for fast exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 298\u2013312. Springer, Heidelberg (2003)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30580-4_3","volume-title":"Public Key Cryptography - PKC 2005","author":"D. Naccache","year":"2005","unstructured":"Naccache, D., Nguyen, P.Q., Tunstall, M., Whelan, C.: Experimenting with faults, lattices and the DSA. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 16\u201328. Springer, Heidelberg (2005)"},{"key":"20_CR20","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, 151\u2013176 (2002)","journal-title":"J. Cryptology"},{"issue":"2","key":"20_CR21","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. Design, Codes and Cryptology\u00a030(2), 201\u2013217 (2003)","journal-title":"Design, Codes and Cryptology"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"key":"20_CR23","unstructured":"NTL, Available at: \n                    \n                      http:\/\/shoup.net\/ntl\/"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-45811-5_30","volume-title":"Information Security","author":"K. Okeya","year":"2002","unstructured":"Okeya, K., Sakurai, K.: A second-order DPA attack breaks a window-method based countermeasure against side channel attacks. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 389\u2013401. Springer, Heidelberg (2002)"},{"key":"20_CR25","unstructured":"Okeya, K., Takagi, T.: SCA-resistant and fast elliptic scalar multiplication based on wNAF. IEICE Trans. Fundamental\u00a0E87-A(1) (2004)"},{"key":"20_CR26","unstructured":"Percival, C.: Cache missing for fun and profit. In: BSDCan 2005, Ottawa (2005), Available at: \n                    \n                      http:\/\/www.daemonology.net\/hyperthreading-considered-harmful\/"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45418-7_18","volume-title":"Smart Card Programming and Security","author":"T. R\u00f6mer","year":"2001","unstructured":"R\u00f6mer, T., Seifert, J.-P.: Information leakage attacks against smart card implementations of the elliptic curve digital signature algorithm. In: Attali, S., Jensen, T. (eds.) E-smart 2001. LNCS, vol.\u00a02140, pp. 211\u2013219. Springer, Heidelberg (2001)"},{"issue":"2-3","key":"20_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.-P. Schnorr","year":"1987","unstructured":"Schnorr, C.-P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci.\u00a053(2-3), 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1017\/S0963548300001371","volume":"3","author":"C.-P. Schnorr","year":"1994","unstructured":"Schnorr, C.-P.: Block Korkin-Zolotarev bases and successive minima. Combinatorics, Probability and Computing\u00a03, 507\u2013533 (1994)","journal-title":"Combinatorics, Probability and Computing"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-54458-5_51","volume-title":"Fundamentals of Computation Theory","author":"C.-P. Schnorr","year":"1991","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. In: Budach, L. (ed.) FCT 1991. LNCS, vol.\u00a0529, pp. 68\u201385. Springer, Heidelberg (1991)"},{"key":"20_CR31","unstructured":"Standards for Efficient Cryptography, SEC1: Elliptic Curve Cryptography, version 1.0 (September 20, 2000)"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-45238-6_6","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"Y. Tsunoo","year":"2003","unstructured":"Tsunoo, Y., Saito, T., Suzaki, T., Shigeri, M., Miyauchi, H.: Cryptanalysis of DES implemented on computers with cache. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 62\u201376. Springer, Heidelberg (2003)"},{"key":"20_CR33","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0205008","volume":"5","author":"A.C.-C. Yao","year":"1976","unstructured":"Yao, A.C.-C.: On the evaluation of powers. SIAM J. Comput.\u00a05, 100\u2013103 (1976)","journal-title":"SIAM J. Comput."},{"key":"20_CR34","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0022-314X(87)90088-6","volume":"26","author":"B.M.M. Weger de","year":"1987","unstructured":"de Weger, B.M.M.: Solving exponential diophantine equations using lattice basis reduction algorithms. J. Number Theory\u00a026, 325\u2013367 (1987)","journal-title":"J. Number Theory"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604938_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:57Z","timestamp":1619507097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604938_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310129","9783540331537"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11604938_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}