{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T03:41:19Z","timestamp":1759722079925,"version":"build-2065373602"},"reference-count":30,"publisher":"Wiley","issue":"10","license":[{"start":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:00:00Z","timestamp":1741132800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Circuit Theory &amp;amp; Apps"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>ABSTRACT<\/jats:title><jats:p>Elliptic curve point multiplication is a critical component in elliptic curve cryptography, serving as a key computational module for fast and secure encryption. To enhance computational performance, parallelism and pipelining are commonly employed techniques in hardware design. However, the stringent computational dependencies in elliptic curve cryptography and the complex combinational logic required for large integer multiplication present significant challenges for area\u2010efficient hardware design, leading to performance bottlenecks. This paper aims to improve system frequency by employing multilevel pipeline partitioning to optimize the critical path. We implement an efficient, low\u2010latency, high\u2010radix modular multiplication unit by combining parallel multiplication with deep pipelining. Building on this high\u2010frequency, high\u2010throughput modular multiplication unit, we propose a high\u2010performance ECPM architecture. Multistage pipelines are inserted into each unit of the ECPM to maintain high\u2010frequency operation across the entire system. Additionally, by analyzing and refining the combined point quadruple\u2010point addition computation flow and data dependencies, we introduce a no\u2010idle parallel modular multiplier architecture, which improves cycle efficiency per computation iteration by 9<jats:italic>%<\/jats:italic>. Experimental results on the Virtex\u20107 FPGA platform demonstrate that, compared with related works, the proposed ECPM architecture achieves a 30<jats:italic>%<\/jats:italic> improvement in Area\u00a0\n\u00a0Time.<\/jats:p>","DOI":"10.1002\/cta.4495","type":"journal-article","created":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T17:06:14Z","timestamp":1741712774000},"page":"5839-5850","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Parallel Hardware Architecture for GF(p) Elliptic Curve Point Multiplication on FPGA"],"prefix":"10.1002","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4850-2267","authenticated-orcid":false,"given":"Ruoyu","family":"Wu","sequence":"first","affiliation":[{"name":"College of Information Science and Electronic Engineering Zhejiang University  Hangzhou China"},{"name":"Ningbo Innovation Center Zhejiang University  Ningbo China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binchao","family":"Yu","sequence":"additional","affiliation":[{"name":"PipeChina Zhejiang Pipeline Network Co. Ltd.  Hangzhou China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaofeng","family":"Chen","sequence":"additional","affiliation":[{"name":"China Tower (HangZhou) Science and Technology Innovation Center  Hangzhou China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Li","sequence":"additional","affiliation":[{"name":"Ningbo Institute of Digital Twin, Eastern Institute of Technology  Ningbo China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanzhong","family":"Tian","sequence":"additional","affiliation":[{"name":"Ningbo Innovation Center Zhejiang University  Ningbo China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"crossref","unstructured":"V. S.Miller \u201cUse of Elliptic Curves in Cryptography \u201d inConference on the Theory and Application of Cryptographic Techniques(Springer 1985) 417\u2013426.","DOI":"10.1007\/3-540-39799-X_31"},{"key":"e_1_2_8_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"e_1_2_8_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3549993.3550007"},{"key":"e_1_2_8_5_1","doi-asserted-by":"crossref","unstructured":"N.Gura A.Patel A.Wander H.Eberle andS. C.Shantz \u201cComparing Elliptic Curve Cryptography and RSA on 8\u2010Bit CPUs \u201d inCryptographic Hardware and Embedded Systems\u2010ches 2004: 6th International Workshop Cambridge(2004) 119\u2013132.","DOI":"10.1007\/978-3-540-28632-5_9"},{"key":"e_1_2_8_6_1","doi-asserted-by":"crossref","unstructured":"T. D. P.Bai K. M.Raj andS. A.Rabara \u201cElliptic Curve Cryptography Based Security Framework for Internet of Things (IoT) Enabled Smart Card \u201d in2017 World Congress on Computing and Communication Technologies (WCCCT)(2017) 43\u201346.","DOI":"10.1109\/WCCCT.2016.20"},{"key":"e_1_2_8_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-2048-0"},{"key":"e_1_2_8_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60610-5"},{"key":"e_1_2_8_9_1","doi-asserted-by":"crossref","unstructured":"K.KoyamaandY.Tsuruoka \u201cSpeeding Up Elliptic Cryptosystems by Using a Signed Binary Window Method \u201d inAnnual International Cryptology Conference(1992) 345\u2013357.","DOI":"10.1007\/3-540-48071-4_25"},{"key":"e_1_2_8_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2021.3054781"},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2023.3321772"},{"key":"e_1_2_8_12_1","doi-asserted-by":"crossref","unstructured":"M.JoyeandS.\u2010M.Yen \u201cThe Montgomery Powering Ladder \u201d inInternational Workshop on Cryptographic Hardware and Embedded Systems(2002) 291\u2013302.","DOI":"10.1007\/3-540-36400-5_22"},{"key":"e_1_2_8_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2323062"},{"key":"e_1_2_8_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2019.2914247"},{"key":"e_1_2_8_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2019.2905899"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.3013266"},{"key":"e_1_2_8_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-019-00211-9"},{"key":"e_1_2_8_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2018.2878598"},{"key":"e_1_2_8_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2016.2625241"},{"key":"e_1_2_8_20_1","unstructured":"D.Hankerson S. A.Vanstone andA.Menezes \u201cGuide to Elliptic Curve Cryptography \u201d inSpringer Professional Computing(2004)."},{"key":"e_1_2_8_21_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0176214"},{"key":"e_1_2_8_22_1","doi-asserted-by":"crossref","unstructured":"K.Phalakarn K.Phalakarn andV.Suppakitpaisarn \u201cOptimal Representation for Right\u2010to\u2010Left Parallel Scalar Point Multiplication \u201d in2017 Fifth International Symposium on Computing and Networking (CANDAR)(2017) 482\u2013488.","DOI":"10.1109\/CANDAR.2017.14"},{"key":"e_1_2_8_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2018.03.112"},{"key":"e_1_2_8_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2022.3194019"},{"key":"e_1_2_8_25_1","unstructured":"X.Ansi \u201c62: Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA) \u201d (1999) Am. Nat'l Standards Inst."},{"key":"e_1_2_8_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2022.3197314"},{"key":"e_1_2_8_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/cta.3708"},{"key":"e_1_2_8_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/cta.2759"},{"key":"e_1_2_8_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2958491"},{"key":"e_1_2_8_30_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126619500816"},{"key":"e_1_2_8_31_1","doi-asserted-by":"crossref","unstructured":"P. M.Matutino J.Araujo L.Sousa andR.Chaves \u201cPipelined FPGA Coprocessor for Elliptic Curve Cryptography Based on Residue Number System \u201d in2017 International Conference on Embedded Computer Systems: Architectures Modeling and Simulation (SAMOS)(2017) 261\u2013268.","DOI":"10.1109\/SAMOS.2017.8344638"}],"container-title":["International Journal of Circuit Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cta.4495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T03:24:36Z","timestamp":1759721076000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cta.4495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,5]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["10.1002\/cta.4495"],"URL":"https:\/\/doi.org\/10.1002\/cta.4495","archive":["Portico"],"relation":{},"ISSN":["0098-9886","1097-007X"],"issn-type":[{"type":"print","value":"0098-9886"},{"type":"electronic","value":"1097-007X"}],"subject":[],"published":{"date-parts":[[2025,3,5]]},"assertion":[{"value":"2024-11-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}