{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:54Z","timestamp":1740122514758,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007136","name":"Secretar\u00eda de Estado de Investigaci\u00f3n, Desarrollo e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["MTM2014-55421P"],"award-info":[{"award-number":["MTM2014-55421P"]}],"id":[{"id":"10.13039\/501100007136","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10623-019-00633-w","type":"journal-article","created":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T12:02:35Z","timestamp":1554724955000},"page":"2469-2488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A probabilistic analysis on a lattice attack against DSA"],"prefix":"10.1007","volume":"87","author":[{"given":"Ana I.","family":"Gomez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5780-2165","authenticated-orcid":false,"given":"Domingo","family":"Gomez-Perez","sequence":"additional","affiliation":[]},{"given":"Gu\u00e9na\u00ebl","family":"Renault","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,8]]},"reference":[{"key":"633_CR1","unstructured":"Adleman L., DeMarrais J.: A subexponential algorithm for discrete logarithms over all finite fields. In: Advances in Cryptology\u2014CRYPTO \u201993, 13th Annual International Cryptology Conference, Lecture Notes in Comput. Sci., pp. 147\u2013158. Springer, Berlin (1993)."},{"key":"633_CR2","first-page":"1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"Razvan Barbulescu","year":"2014","unstructured":"Barbulescu R., Gaudry P., Joux A., Thom\u00e9 E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Advances in Cryptology\u2014EUROCRYPT 2014, 33rd Annual International Conference, Lecture Notes in Comput. Sci., pp. 1\u201316. Springer, Berlin (2014)."},{"key":"633_CR3","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034981","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H Cohen","year":"2005","unstructured":"Cohen H., Frey G., Avanzi R., Doche C., Lange T., Nguyen K., Vercauteren F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)."},{"key":"633_CR4","unstructured":"De Mulder E., Hutter M., Marson M., Pearson P.: Using Bleichenbacher\u2019s solution to the Hidden Number Problem to attack nonce leaks in 384-bit ECDSA. In: Cryptographic Hardware and Embedded Systems-CHES 2013, Lecture Notes in Comput. Sci., pp. 435\u2013452. Springer, Berlin (2013)."},{"issue":"1","key":"633_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s13389-014-0072-z","volume":"4","author":"E Mulder De","year":"2014","unstructured":"De Mulder E., Hutter M., Marson M., Pearson P.: Using Bleichenbacher\u2019s solution to the hidden number problem to attack nonce leaks in 384-bit ECDSA: extended version. J. Cryptogr. Eng. 4(1), 33\u201345 (2014).","journal-title":"J. Cryptogr. Eng."},{"issue":"6","key":"633_CR6","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.2140\/ant.2013.7.1281","volume":"7","author":"C Diem","year":"2013","unstructured":"Diem C.: On the discrete logarithm problem in elliptic curves II. Algebra Number Theory 7(6), 1281\u20131323 (2013).","journal-title":"Algebra Number Theory"},{"key":"633_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0093404","volume-title":"Sequences, Discrepancies, and Applications","author":"M Drmota","year":"1997","unstructured":"Drmota M., Tichy R.: Sequences, Discrepancies, and Applications. Springer, Berlin (1997)."},{"key":"633_CR8","unstructured":"Fan S., Wang W., Cheng Q.: Attacking OpenSSL implementation of ECDSA with a few signatures. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security\u2014CCS\u201916, pp. 1505\u20131515. ACM, New York (2016)."},{"key":"633_CR9","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-13013-7_5","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"Jean-Charles Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re J., Marinier R., Renault G.: Implicit factoring with shared most significant and middle bits. In: Public Key Cryptography, Lecture Notes in Comput. Sci., pp. 70\u201387. Springer, Berlin (2010)."},{"key":"633_CR10","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-35999-6_17","volume-title":"Selected Areas in Cryptography","author":"Jean-Charles Faug\u00e8re","year":"2013","unstructured":"Faug\u00e8re J., Goyet C., Renault G.: Attacking (EC)DSA given only an implicit hint. In: Selected Areas in Cryptography, 19th International Conference, SAC 2012, Lecture Notes in Comput. Sci., pp. 252\u2013274. Springer, Berlin (2012)."},{"key":"633_CR11","unstructured":"FIPS. Digital Signature Standard (DSS). National Institute of Standards and Technology (NIST) (1994)."},{"key":"633_CR12","unstructured":"FIPS. Digital Signature Standard (DSS). pub-NIST, pub-NIST:adr (2013)."},{"issue":"1","key":"633_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10623-015-0146-7","volume":"78","author":"S Galbraith","year":"2016","unstructured":"Galbraith S., Gaudry P.: Recent progress on the elliptic curve discrete logarithm problem. Des. Codes Cryptogr. 78(1), 51\u201372 (2016).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"633_CR14","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1070\/RM2010v065n04ABEH004691","volume":"65","author":"M Garaev","year":"2010","unstructured":"Garaev M.: Sums and products of sets and estimates of rational trigonometric sums in fields of prime order. Russ. Math. Surv. 65(4), 599 (2010).","journal-title":"Russ. Math. Surv."},{"key":"633_CR15","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-662-44371-2_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Daniel Genkin","year":"2014","unstructured":"Genkin D., Shamir A., Tromer E.: RSA key extraction via low-bandwidth acoustic cryptanalysis. In: Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conference, Lecture Notes in Comput. Sci., pp. 444\u2013461. Springer, Berlin (2014)."},{"key":"633_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-40084-1_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Faruk G\u00f6lo\u011flu","year":"2013","unstructured":"G\u00f6loglu F., Granger R., McGuire G., Zumbr\u00e4gel J.: On the function field sieve and the impact of higher splitting probabilities. In: Advances in Cryptology\u2014CRYPTO 2013\u201433rd Annual Cryptology Conference, Lecture Notes in Comput. Sci., pp. 109\u2013128. Springer, Berlin (2013)."},{"key":"633_CR17","unstructured":"G\u00f6loglu F., Granger R., McGuire G., Zumbr\u00e4gel J.: Solving a 6120 -bit DLP on a desktop computer. In: Selected Areas in Cryptography - SAC 2013 - 20th International Conference, Lecture Notes in Comput. Sci., pp. 136\u2013152. Springer, Berlin (2013)."},{"issue":"2","key":"633_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00605-014-0697-0","volume":"176","author":"D G\u00f3mez-P\u00e9rez","year":"2014","unstructured":"G\u00f3mez-P\u00e9rez D., Shparlinski I.: Subgroups generated by rational functions in finite fields. Monatsh. Math. 176(2), 241\u2013253 (2014).","journal-title":"Monatsh. Math."},{"issue":"3","key":"633_CR19","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.: Lattice attacks on digital signature schemes. Des. Codes Cryptogr. 23(3), 283\u2013290 (2001).","journal-title":"Des. Codes Cryptogr."},{"key":"633_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-38348-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"Antoine Joux","year":"2013","unstructured":"Joux A.: Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields. In: Advances in Cryptology\u2014EUROCRYPT 2013, 32nd Annual International Conference, Lecture Notes in Comput. Sci., pp. 177\u2013193. Springer, Berlin (2013)."},{"issue":"1","key":"633_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1146\/annurev.cs.02.060187.001311","volume":"2","author":"R Kannan","year":"1987","unstructured":"Kannan R.: Algorithmic geometry of numbers. Annu. Rev. Comput. Sci. 2(1), 231\u2013267 (1987).","journal-title":"Annu. Rev. Comput. Sci."},{"issue":"6","key":"633_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MSP.2016.120","volume":"14","author":"N Koblitz","year":"2016","unstructured":"Koblitz N., Menezes A.: A riddle wrapped in an enigma. IEEE Secur. Priv. 14(6), 34\u201342 (2016).","journal-title":"IEEE Secur. Priv."},{"issue":"4","key":"633_CR23","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra A., Lenstra H., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"633_CR24","unstructured":"May A., Ritzenhofen R.: Implicit factoring: on polynomial time factoring given only an implicit hint. In: Public Key Cryptography, Lecture Notes in Comput. Sci., pp. 1\u201314. Springer, Berlin (2009)."},{"issue":"2","key":"633_CR25","first-page":"523","volume":"111","author":"C Moreno","year":"1991","unstructured":"Moreno C., Moreno O.: Exponential sums and Goppa codes. Proc. Am. Math. Soc. 111(2), 523\u2013531 (1991).","journal-title":"Proc. Am. Math. Soc."},{"key":"633_CR26","unstructured":"National Security Agency. Cryptography today. \n                    http:\/\/tinyurl.com\/SuiteB\n                    \n                  . Accessed 19 July 2018."},{"issue":"3","key":"633_CR27","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P Nguyen","year":"2002","unstructured":"Nguyen P., Shparlinski I.: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptol. 15(3), 151\u2013176 (2002).","journal-title":"J. Cryptol."},{"issue":"2","key":"633_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1025436905711","volume":"30","author":"P Nguyen","year":"2003","unstructured":"Nguyen P., Shparlinski I.: The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Des. Codes Cryptogr. 30(2), 201\u2013217 (2003).","journal-title":"Des. Codes Cryptogr."},{"key":"633_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02295-1","volume-title":"The LLL Algorithm","author":"P Nguyen","year":"2010","unstructured":"Nguyen P., Vall\u00e9e B.: The LLL Algorithm. Springer, Berlin (2010)."},{"key":"633_CR30","volume-title":"Random Number Generation and Quasi-Monte Carlo Methods","author":"H Niederreiter","year":"1987","unstructured":"Niederreiter H.: Random Number Generation and Quasi-Monte Carlo Methods. Society for Industrial and Applied Mathematics, Philadelphia (1987)."},{"key":"633_CR31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte Carlo Methods","author":"H Niederreiter","year":"1992","unstructured":"Niederreiter H.: Random Number Generation and Quasi-Monte Carlo Methods. Society for Industrial and Applied Mathematics, Philadelphia (1992)."},{"key":"633_CR32","unstructured":"Rivest R., Shamir A.: Efficient factoring based on partial information. In: Advances in Cryptology\u2014CRYPTO \u201985, 5th Annual International Cryptology Conference, Lecture Notes in Comput. Sci., pp. 31\u201334. Springer, New York (1986)."},{"issue":"2","key":"633_CR33","doi-asserted-by":"publisher","first-page":"205","DOI":"10.3934\/amc.2009.3.205","volume":"3","author":"S Sarkar","year":"2009","unstructured":"Sarkar S., Maitra S.: Further results on implicit factoring in polynomial time. Adv. Math. Commun. 3(2), 205\u2013217 (2009).","journal-title":"Adv. Math. Commun."},{"key":"633_CR34","unstructured":"Schnorr C.: Efficient identification and signatures for smart cards. In: Advances in Cryptology\u2014CRYPTO \u201989, 9th Annual International Cryptology Conference, Lecture Notes in Comput. Sci., pp. 239\u2013252. Springer, New York (1990)."},{"issue":"273","key":"633_CR35","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1090\/S0025-5718-10-02356-2","volume":"80","author":"A Sutherland","year":"2011","unstructured":"Sutherland A.: Structure computation and discrete logarithms in finite abelian p-groups. Math. Comput. 80(273), 477\u2013500 (2011).","journal-title":"Math. Comput."},{"key":"633_CR36","unstructured":"van\u00a0de Pol J., Smart N., Yarom Y.: Just a little bit more. In: Cryptographer\u2019s Track at RSA Conference, Lecture Notes in Comput. Sci., pp. 3\u201321. Springer, Berlin (2015)."},{"key":"633_CR37","volume-title":"Elements of Number Theory (Dover Phoenix Editions)","author":"I Vinogradov","year":"2003","unstructured":"Vinogradov I.: Elements of Number Theory (Dover Phoenix Editions). Dover, Dover Publications (2003)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00633-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00633-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00633-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T23:25:29Z","timestamp":1586215529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00633-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,8]]},"references-count":37,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["633"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00633-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,4,8]]},"assertion":[{"value":"6 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}