{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T01:40:43Z","timestamp":1763343643222,"version":"3.45.0"},"reference-count":29,"publisher":"Tech Science Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.32604\/cmc.2025.065085","type":"journal-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:43:26Z","timestamp":1747284206000},"page":"1581-1595","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Commitment in a Verkle Tree Based on a Non-Positional Polynomial Notation"],"prefix":"10.32604","volume":"84","author":[{"given":"Kunbolat T.","family":"Algazy","sequence":"first","affiliation":[]},{"given":"Kairat S.","family":"Sakan","sequence":"additional","affiliation":[]},{"given":"Saule E.","family":"Nyssanbayeva","sequence":"additional","affiliation":[]},{"given":"Ardabek","family":"Khompysh","sequence":"additional","affiliation":[]}],"member":"17807","published-online":{"date-parts":[[2025]]},"reference":[{"key":"ref1","first-page":"21","article-title":"Rsa encryption using VLSI architecture for high speed applications","volume":"3","author":"Thilagam","year":"2017","journal-title":"Int J Adv Signal Image Sci"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"20240013","DOI":"10.1515\/jmc-2024-0013","article-title":"A security analysis of two classes of RSA-like cryptosystems","volume":"18","author":"Cotan","year":"2024","journal-title":"J Math Crypt"},{"key":"ref3","first-page":"203","article-title":"Twenty years of attacks on the RSA cryptosystem","volume":"46","author":"Boneh","year":"1999","journal-title":"Not AMS"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"161569","DOI":"10.1109\/ACCESS.2024.3489552","article-title":"A highly efficient ECPM quantum circuit for binary elliptic curve cryptanalysis","volume":"12","author":"Wardhani","year":"2024","journal-title":"IEEE Access"},{"key":"ref5","series-title":"Information Security Applications: 22nd International Conference","article-title":"Quantum cryptanalysis landscape of shor\u2019s algorithm for elliptic curve discrete logarithm problem","author":"Larasati","year":"2021 Aug 11\u201313"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"451","DOI":"10.46586\/tches.v2021.i1.451-472","article-title":"Concrete quantum cryptanalysis of binary elliptic curves","volume":"1","author":"Banegas","year":"2020","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"45083","DOI":"10.1109\/ACCESS.2023.3273601","article-title":"Depth-optimization of quantum cryptanalysis on binary elliptic curves","volume":"11","author":"Putranto","year":"2023","journal-title":"IEEE Access"},{"key":"ref8","series-title":"2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS)","article-title":"Investigation of strength of E91 quantum key distribution protocol","author":"Begimbayeva","year":"2023 Aug 14\u201322"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-88702-7_3","author":"Buchmann","year":"2009","journal-title":"Post-quantum cryptography"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.3390\/computers13010026","article-title":"Development of a new post-quantum digital signature algorithm: syrga-1","volume":"13","author":"Algazy","year":"2024","journal-title":"Computers"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3390\/computation12060125","article-title":"Syrga2: post-quantum hash-based signature scheme","volume":"12","author":"Algazy","year":"2024","journal-title":"Computation"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"7350","DOI":"10.3390\/app11167350","article-title":"HORSIC+: an efficient post-quantum few-time signature scheme","volume":"11","author":"Lee","year":"2021","journal-title":"Appl Sci"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.3390\/fi17020072","article-title":"Optimizing merkle proof size through path length analysis: a probabilistic framework for efficient blockchain state verification","volume":"17","author":"Kuznetsov","year":"2025","journal-title":"Future Internet"},{"key":"ref14","doi-asserted-by":"crossref","unstructured":"Kate A, Zaverucha GM, Goldberg I. Constant-size commitments to polynomials and their applications. [cited 2025 Mar 1]. Available from: https:\/\/www.iacr.org\/archive\/asiacrypt2010\/6477178\/6477178.pdf.","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref15","unstructured":"Kate A, Zaverucha GM, Goldberg I. Polynomial commitments. [cited 2025 Feb 22]. Available from: https:\/\/cacr.uwaterloo.ca\/techreports\/2010\/cacr2010-10.pdf."},{"key":"ref16","unstructured":"Kuszmaul J. Verkle trees. [cited 2024 May 22]. Available from: https:\/\/math.mit.edu\/research\/highschool\/primes\/materials\/2018\/Kuszmaul."},{"key":"ref17","doi-asserted-by":"crossref","first-page":"101315","DOI":"10.1016\/j.iot.2024.101315","article-title":"Adaptive Merkle trees for enhanced blockchain scalability","volume":"27","author":"Kuznetsov","year":"2024","journal-title":"Internet Things"},{"key":"ref18","series-title":"2018 IEEE Symposium on Security and Privacy (SP)","first-page":"315","article-title":"Bulletproofs: short proofs for confidential transactions and more","author":"B\u00fcnz","year":"2018 May 20\u201324"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"409","DOI":"10.3390\/ijgi11070409","article-title":"Adaptive spatio-temporal query strategies in blockchain","volume":"11","author":"Chen","year":"2022","journal-title":"ISPRS Intern J Geo-Inf"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"554","DOI":"10.3390\/app15020554","article-title":"Aggregatable subvector commitment with efficient updates","volume":"15","author":"Xu","year":"2025","journal-title":"App Sci"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"111400","DOI":"10.1109\/ACCESS.2024.3421995","article-title":"Lattice-based commitment scheme for low communication costs","volume":"12","author":"Miyaji","year":"2024","journal-title":"IEEE Access"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"114180","DOI":"10.1016\/j.dss.2024.114180","article-title":"Minimizing block incentive volatility through Verkle tree-based dynamic transaction storage","volume":"180","author":"Zhao","year":"2024","journal-title":"Decis Support Syst"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"2165","DOI":"10.3390\/sym15122165","article-title":"A post-quantum digital signature using Verkle trees and lattices","volume":"15","author":"Iavich","year":"2023","journal-title":"Symmetry"},{"journal-title":"Residue number systems: theory and implementation","year":"2016","author":"Omondi","key":"ref24"},{"key":"ref25","first-page":"45","article-title":"Residue number systems: a new paradigm to datapath optimization for low-power and high-performance digital signal processing applications","volume":"10","author":"Wang","year":"2010","journal-title":"IEEE Circuits Syst Mag"},{"key":"ref26","first-page":"19","article-title":"Development and analysis of the encryption algorithm in nonpositional polynomial notations","volume":"6","author":"Biyashev","year":"2018","journal-title":"Euras J Math Comp App"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"198","DOI":"10.3390\/computation10110198","article-title":"Development and study of an encryption algorithm","volume":"10","author":"Kapalova","year":"2022","journal-title":"Computation"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"198","DOI":"10.26577\/JMMCS.2020.v105.i1.17","article-title":"Encryption algorithm \u201cQAMAL NPNS\u201d based on a nonpositional polynomial notation","volume":"105","author":"Biyashev","year":"2020","journal-title":"J Math Mech Comp Sci"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3390\/computers14030103","article-title":"Optimizing post-quantum digital signatures with Verkle trees and quantum seed-based pseudo-random generators","volume":"14","author":"Iavich","year":"2025","journal-title":"Computers"}],"container-title":["Computers, Materials & Continua"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/cdn.techscience.cn\/files\/cmc\/2025\/TSP_CMC-84-1\/TSP_CMC_65085\/TSP_CMC_65085.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T01:36:47Z","timestamp":1763343407000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.techscience.com\/cmc\/v84n1\/61776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025]]},"published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.32604\/cmc.2025.065085","relation":{},"ISSN":["1546-2226"],"issn-type":[{"type":"electronic","value":"1546-2226"}],"subject":[],"published":{"date-parts":[[2025]]}}}