{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:16:30Z","timestamp":1764980190751,"version":"3.46.0"},"reference-count":20,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T00:00:00Z","timestamp":1462838400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,6,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We prove that a system of linear congruences of a particular form has\nat most a unique solution below a certain bound which can be computed efficiently. Using this result, we develop attacks against the DSA schemes which, under some assumptions, can provide the secret key\nin the case where one or several signed messages are available.<\/jats:p>","DOI":"10.1515\/jmc-2014-0027","type":"journal-article","created":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T06:04:05Z","timestamp":1464761045000},"page":"135-144","source":"Crossref","is-referenced-by-count":6,"title":["New lattice attacks on DSA schemes"],"prefix":"10.1515","volume":"10","author":[{"given":"Dimitrios","family":"Poulakis","sequence":"first","affiliation":[{"name":"Department of Mathematics, Aristotle University of Thessaloniki, Thessaloniki 54124, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2016,5,10]]},"reference":[{"key":"2025120600124086173_j_jmc-2014-0027_ref_000_w2aab3b7b2b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Goldwasser and D. Micciancio,\n\u201cPseudo-random\u201d number generation within cryptographic algorithms: The DSS case,\nAdvances in Cryptology (CRYPTO '97),\nLecture Notes in Comput. Sci. 1294,\nSpringer, Berlin (1997), 277\u2013291.","DOI":"10.1007\/BFb0052242"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_001_w2aab3b7b2b1b6b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"I. F. Blake and T. Garefalakis,\nOn the security of the digital signature algorithm,\nDes. Codes Cryptogr. 26 (2002), 1\u20133, 87\u201396.","DOI":"10.1023\/A:1016549024113"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_002_w2aab3b7b2b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"I. F. Blake, G. Seroussi and N. Smart,\nElliptic Curves in Cryptography,\nCambridge University Press, Cambridge, 2000.","DOI":"10.1017\/CBO9781107360211"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_003_w2aab3b7b2b1b6b1ab1ab4Aa","unstructured":"R. Brent and P. Zimmerman,\nModern Computer Arithmetic,\nCambridge University Press, Cambridge, 2011."},{"key":"2025120600124086173_j_jmc-2014-0027_ref_004_w2aab3b7b2b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"K. Draziotis and D. Poulakis,\nLattice attacks on DSA schemes based on Lagrange's algorithm,\nAlgebraic Informatics (CAI 2013),\nLecture Notes in Comput. Sci. 8080,\nSpringer, Berlin (2013), 119\u2013131.","DOI":"10.1007\/978-3-642-40663-8_13"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_005_w2aab3b7b2b1b6b1ab1ab6Aa","doi-asserted-by":"crossref","unstructured":"T. ElGamal,\nA public key cryptosystem and a signature scheme based on discrete logarithm,\nIEEE Trans. Inform. Theory 31 (1985), 469\u2013472.","DOI":"10.1109\/TIT.1985.1057074"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_006_w2aab3b7b2b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"J.-L. Faug\u00e8re, C. Goyet and G. Renault,\nAttacking (EC)DSA given only an implicit hint,\nSelected Area of Cryptography (SAC 2012),\nLecture Notes in Comput. Sci. 7707,\nSpringer, Berlin (2013), 252\u2013274.","DOI":"10.1007\/978-3-642-35999-6_17"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_007_w2aab3b7b2b1b6b1ab1ab8Aa","unstructured":"M. Girault, G. Poupard and J. Stern,\nGlobal Payment System (GPS): Un protocole de signature \u00e0 la vol\u00e9e,\nProceedings of Trusting Electronic Trade, 1999."},{"key":"2025120600124086173_j_jmc-2014-0027_ref_008_w2aab3b7b2b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"N. A. Howgrave-Graham and N. P. Smart,\nLattice Attacks on Digital Signature Schemes,\nDes. Codes Cryptogr. 23 (2001), 283\u2013290.","DOI":"10.1023\/A:1011214926272"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_009_w2aab3b7b2b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"D. Johnson, A. J. Menezes and S. A. Vastone,\nThe elliptic curve digital signature algorithm (ECDSA),\nInt. J. Inf. Secur. 1 (2001), 36\u201363.","DOI":"10.1007\/s102070100002"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_010_w2aab3b7b2b1b6b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"N. Koblitz and A. J. Menezes,\nA survey of public-key cryptosystems,\nSIAM Rev. 46 (2004), 4, 599\u2013634.","DOI":"10.1137\/S0036144503439190"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_011_w2aab3b7b2b1b6b1ab1ac12Aa","doi-asserted-by":"crossref","unstructured":"N. Koblitz, A. J. Menezes and S. A. Vastone,\nThe state of elliptic curve cryptography,\nDes. Codes Cryptogr. 19 (2000), 173\u2013193.","DOI":"10.1023\/A:1008354106356"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_012_w2aab3b7b2b1b6b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr. and L. Lov\u00e1sz,\nFactoring polynomials with rational coefficients,\nMath. Ann. 261 (1982), 513\u2013534.","DOI":"10.1007\/BF01457454"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_013_w2aab3b7b2b1b6b1ab1ac14Aa","unstructured":"A. J. Menezes, P. C. van Oorschot and S. A. Vanstone,\nHandbook of Applied Cryptography,\nCRC Press, Boca Raton, 1997."},{"key":"2025120600124086173_j_jmc-2014-0027_ref_014_w2aab3b7b2b1b6b1ab1ac15Aa","doi-asserted-by":"crossref","unstructured":"D. Micciancio and P. Voulgaris,\nA deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations,\nProceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC '10),\nAssociation for Computing Machinery, New York (2010), 351\u2013358.","DOI":"10.1145\/1806689.1806739"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_015_w2aab3b7b2b1b6b1ab1ac16Aa","doi-asserted-by":"crossref","unstructured":"P. Nguyen and I. E. Shparlinski,\nThe insecurity of the digital signature algorithm with partially known nonces,\nJ. Cryptology 15 (2002), 151\u2013176.","DOI":"10.1007\/s00145-002-0021-3"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_016_w2aab3b7b2b1b6b1ab1ac17Aa","doi-asserted-by":"crossref","unstructured":"P. Nguyen and I. E. Shparlinski,\nThe insecurity of the elliptic curve digital signature algorithm with partially known nonces,\nDes. Codes Cryptogr. 30 (2003), 201\u2013217.","DOI":"10.1023\/A:1025436905711"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_017_w2aab3b7b2b1b6b1ab1ac18Aa","doi-asserted-by":"crossref","unstructured":"D. Poulakis,\nSome Lattice Attacks on DSA and ECDSA,\nAppl. Algebra Engrg. Comm. Comput. 22 (2011), 347\u2013358.","DOI":"10.1007\/s00200-011-0154-4"},{"key":"2025120600124086173_j_jmc-2014-0027_ref_018_w2aab3b7b2b1b6b1ab1ac19Aa","unstructured":"D. R. Stinson,\nCryptography, Theory and Practice, 2nd ed.,\nChapman & Hall\/CRC, Boca Raton, 2001."},{"key":"2025120600124086173_j_jmc-2014-0027_ref_019_w2aab3b7b2b1b6b1ab1ac20Aa","unstructured":"National Institute of Standards and Technology (NIST),\nFIPS Publication 186: Digital Signature Standard, 1994."}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2014-0027\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2014-0027\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:12:50Z","timestamp":1764979970000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2014-0027\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,10]]},"references-count":20,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2016,5,10]]},"published-print":{"date-parts":[[2016,6,1]]}},"alternative-id":["10.1515\/jmc-2014-0027"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2014-0027","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"type":"electronic","value":"1862-2984"},{"type":"print","value":"1862-2976"}],"subject":[],"published":{"date-parts":[[2016,5,10]]}}}