{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:21:49Z","timestamp":1766067709515,"version":"build-2065373602"},"reference-count":31,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T00:00:00Z","timestamp":1681430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"science and technology project of State Grid Corporation of China","award":["5108-202240041A-1-1-ZN"],"award-info":[{"award-number":["5108-202240041A-1-1-ZN"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Lattice attacks can compromise the security of encryption algorithms used in blockchain networks, allowing attackers to tamper with transaction records, steal private keys, and execute other forms of attacks. With symmetric encryption, both parties can encrypt and decrypt messages using the same key. Lattice attacks on digital signature algorithms (ECDSA) involve forming a basis and setting a target vector from signatures, then solving the closest vector problem (CVP) or shortest vector problem (SVP) in the generated lattice to obtain the private key. Prior research focused on obtaining leakage information from the signature\u2019s random nonce to facilitate a CVP or SVP solution. This study establishes a clear boundary for a successful ECDSA attack and introduces a \u201cdouble basis\u201d lattice version that expands the boundary or reduces the necessary signatures by nearly half with the same lattice rank. To approach the boundary, a heuristic strategy is employed to shift the target vector in different directions with a feasible step size, using tests on the Trusted Platform Module (TPM) 2.0 ECDSA. The distance from the closest moved target vector to the boundary is reduced by a ratio of 424 to 179 to the minimal length of orthogonal vectors in the formed basis. Experimental results show that moving attempts in two directions with the original basis and 84 signatures take approximately 247.7 s on the experiment computer.<\/jats:p>","DOI":"10.3390\/sym15040913","type":"journal-article","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T05:29:29Z","timestamp":1681450169000},"page":"913","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exploring the Intersection of Lattice Attacks and Blockchain Technology: A Heuristic Approach Using TPM2.0 ECDSA to Ascertain and Approach the Boundary"],"prefix":"10.3390","volume":"15","author":[{"given":"Baohua","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Computer Science, Beijing University of Technology, Beijing 100124, China"},{"name":"State Grid Smart Grid Research Institute Co., Ltd., Beijing 102209, China"},{"name":"State Grid Laboratory of Grid Advanced Computing and Applications, Beijing 102209, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Grid Corporation of China Co., Ltd., Beijing 100031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihao","family":"Wang","sequence":"additional","affiliation":[{"name":"State Grid Smart Grid Research Institute Co., Ltd., Beijing 102209, China"},{"name":"State Grid Laboratory of Grid Advanced Computing and Applications, Beijing 102209, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shucai","family":"Wang","sequence":"additional","affiliation":[{"name":"State Grid Smart Grid Research Institute Co., Ltd., Beijing 102209, China"},{"name":"State Grid Laboratory of Grid Advanced Computing and Applications, Beijing 102209, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fajiang","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Wuhan University, Wuhan 430072, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaomin","family":"Jia","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Wuhan University, Wuhan 430072, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1109\/18.850673","article-title":"Cryptanalysis of RSA with private key d less than N\/sup 0.292\/","volume":"46","author":"Boneh","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"101524","DOI":"10.1016\/j.is.2020.101524","article-title":"Winter is here! A decade of cache-based side-channel attacks, detection & mitigation for RSA","volume":"92","author":"Mushtaq","year":"2020","journal-title":"Inf. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1011214926272","article-title":"Lattice Attacks on Digital Signature Schemes","volume":"23","author":"Smart","year":"2001","journal-title":"Des. Codes Cryptogr."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.future.2021.05.014","article-title":"Computer-aided intelligent design using deep multiobjective cooperative optimization algorithm","volume":"124","author":"Jingwei","year":"2021","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1109\/TVLSI.2021.3077885","article-title":"Cryptographic Accelerators for Digital Signature Based on Ed25519","volume":"29","author":"Azarderakhsh","year":"2021","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Dimopoulos, C., Fournaris, A.P., and Koufopavlou, O. (2021). Machine Learning Attacks and Countermeasures on Hardware Binary Edwards Curve Scalar Multipliers. J. Sens. Actuator Netw., 10.","DOI":"10.3390\/jsan10030056"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1025436905711","article-title":"The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces","volume":"30","author":"Nguyen","year":"2003","journal-title":"Des. Codes Cryptogr."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ma, Z., Li, B., Cai, Q., and Yang, J. (2020, January 22\u201325). Applications and developments of the lattice attack in side channel attacks. Proceedings of the International Conference on Applied Cryptography and Network Security, Rome, Italy.","DOI":"10.1007\/978-3-030-61638-0_24"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1080\/09720529.2019.1615673","article-title":"A new enhancement of elliptic curve digital signature algorithm","volume":"23","author":"Mehibel","year":"2020","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"key":"ref_11","unstructured":"Weiser, S., Schrammel, D., Bodner, L., and Spreitzer, R. (2020, January 12\u201314). Big numbers-big troubles: Systematically analyzing nonce leakage in (ec) dsa implementations. Proceedings of the 29th USENIX Security Symposium (USENIX Security 20), Boston, MA, USA."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Brumley, B.B., and Tuveri, N. (2011, January 12\u201314). Remote timing attacks are still practical. Proceedings of the European Symposium on Research in Computer Security, Leuven, Belgium.","DOI":"10.1007\/978-3-642-23822-2_20"},{"key":"ref_13","unstructured":"Moghimi, D., Sunar, B., Eisenbarth, T., and Heninger, N. (2020, January 12\u201314). Tpm-fail: Tpm meets timing and lattice attacks. Proceedings of the 29th USENIX Security Symposium (USENIX Security 20), Boston, MA, USA."},{"key":"ref_14","first-page":"1","article-title":"Extension of cube attack with probabilistic equations and its application on cryptanalysis of KATAN cipher","volume":"12","author":"Eskandari","year":"2020","journal-title":"ISC Int. J. Inf. Secur."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Brumley, B.B., and Hakala, R.M. (2009, January 6\u201310). Cache-timing template attacks. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan.","DOI":"10.1007\/978-3-642-10366-7_39"},{"key":"ref_16","unstructured":"Yarom, Y., and Falkner, K. (2014, January 20\u201322). Flush + reload: A high resolution, low noise, l3 cache side-channel attack. Proceedings of the 23rd USENIX Security Symposium (USENIX Security 14), San Diego, CA, USA."},{"key":"ref_17","unstructured":"Belgarric, P., Fouque, P.-A., Macario-Rat, G., and Tibouchi, M. (March, January 29). Side-channel analysis of weierstrass and koblitz curve ecdsa on android smartphones. Proceedings of the Cryptographers\u2019 Track at the RSA Conference, Francisco, CA, USA."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Fan, S., Wang, W., and Cheng, Q. (2016, January 24\u201328). Attacking openssl implementation of ecdsa with a few signatures. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS\u201916, Vienna, Austria.","DOI":"10.1145\/2976749.2978400"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"032105","DOI":"10.1007\/s11432-016-9030-0","article-title":"Attacking OpenSSL ECDSA with a small amount of side-channel information","volume":"61","author":"Wang","year":"2017","journal-title":"Sci. China Inf. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., and Heninger, N. (2021, January 17\u201321). On bounded distance decoding with predicate: Breaking the \u201clattice barrier\u201d for the hidden number problem. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia.","DOI":"10.1007\/978-3-030-77870-5_19"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s00493-019-4113-1","article-title":"On closest pair in euclidean metric: Monochromatic is as hard as bichromatic","volume":"40","author":"Karthik","year":"2020","journal-title":"Combinatorica"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","article-title":"On lov\u00e1sz\u2019lattice reduction and the nearest lattice point problem","volume":"6","author":"Babai","year":"1986","journal-title":"Combinatorica"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Zhang, K., Xu, S., Gu, D., Gu, H., Liu, J., Guo, Z., Liu, R., Liu, L., and Hu, X. (2017, January 15\u201318). Practical partial-nonce-exposure attack on ecc algorithm. Proceedings of the 2017 13th International Conference on Computational Intelligence and Security (CIS), Hong Kong, China.","DOI":"10.1109\/CIS.2017.00061"},{"key":"ref_24","unstructured":"Nguyen, P.Q., and Tibouchi, M. (2012). Fault Analysis in Cryptography, Springer."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Cao, W., Feng, J., Chen, H., Zhu, S., Wu, W., Han, X., and Zheng, X. (2015, January 25\u201327). Two lattice-based differential fault attacks against ecdsa with wnaf algorithm. Proceedings of the ICISC 2015, Seoul, Republic of Korea.","DOI":"10.1007\/978-3-319-30840-1_19"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Boneh, D., and Venkatesan, R. (1996, January 18\u201322). Hardness of computing the most significant bits of secret keys in diffie-hellman and related schemes. Proceedings of the Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/3-540-68697-5_11"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.2140\/obs.2020.4.251","article-title":"The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP","volume":"4","author":"Espitau","year":"2020","journal-title":"Open Book Ser."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"4897","DOI":"10.1109\/JIOT.2018.2878707","article-title":"Lattice-Based Public Key Cryptosystem for Internet of Things Environment: Challenges and Solutions","volume":"6","author":"Chaudhary","year":"2018","journal-title":"IEEE Internet Things J."},{"key":"ref_29","first-page":"1449","article-title":"A TPM2. 0 Key Migration Protocol and Security Analysis","volume":"47","author":"Min","year":"2019","journal-title":"Acta Electonica Sin."},{"key":"ref_30","unstructured":"(2023, March 14). Trusted Computing Group\u2019s (tcg) tpm2 Software Stack, September 2021. Available online: Github.com\/tpm2-software\/tpm2tss."},{"key":"ref_31","unstructured":"(2023, March 14). Trusted Platform Module (tpm2.0) Tools, September 2021. Available online: Github.com\/tpm2-software\/tpm2tools."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/4\/913\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:15:53Z","timestamp":1760123753000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/4\/913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,14]]},"references-count":31,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["sym15040913"],"URL":"https:\/\/doi.org\/10.3390\/sym15040913","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2023,4,14]]}}}