{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:03:42Z","timestamp":1760058222491,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T00:00:00Z","timestamp":1742342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Popular technologies such as blockchain and zero-knowledge proof, which have already entered the enterprise space, heavily use cryptography as the core of their protocol stack. One of the most used systems in this regard is Elliptic Curve Cryptography, precisely the point multiplication operation, which provides the security assumption for all applications that use this system. As this operation is computationally intensive, one solution is to offload it to specialized accelerators to provide better throughput and increased efficiency. In this paper, we explore the use of Field Programmable Gate Arrays (FPGAs) and the High-Level Synthesis framework of AMD Vitis in designing an elliptic curve point arithmetic unit (point adder) for the secp256k1 curve. We show how task-level parallel programming and data streaming are used in designing a RISC processor-like architecture to provide pipeline parallelism and increase the throughput of the point adder unit. We also show how to efficiently use the proposed processor architecture by designing a point multiplication scheduler capable of scheduling multiple batches of elliptic curve points to utilize the point adder unit efficiently. Finally, we evaluate our design on an AMD-Xilinx Alveo-family FPGA and show that our point arithmetic processor has better throughput and frequency than related work.<\/jats:p>","DOI":"10.3390\/cryptography9010020","type":"journal-article","created":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:38:48Z","timestamp":1742380728000},"page":"20","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BPAP: FPGA Design of a RISC-like Processor for Elliptic Curve Cryptography Using Task-Level Parallel Programming in High-Level Synthesis"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3915-0458","authenticated-orcid":false,"given":"Rares","family":"Ifrim","sequence":"first","affiliation":[{"name":"Department of Computer Science, National University of Science and Technology POLITEHNICA Bucharest, 060042 Bucharest, Romania"},{"name":"School of Computing, National University of Singapore, Singapore 119077, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3921-5343","authenticated-orcid":false,"given":"Decebal","family":"Popescu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National University of Science and Technology POLITEHNICA Bucharest, 060042 Bucharest, Romania"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Liu, J. (2022, January 16\u201318). Digital signature and hash algorithms used in Bitcoin and Ethereum. Proceedings of the Third International Conference on Machine Learning and Computer Application (ICMLCA 2022), Shenyang, China.","DOI":"10.1117\/12.2675431"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"156729","DOI":"10.1109\/ACCESS.2021.3129314","article-title":"Verifiable computing applications in blockchain","volume":"9","author":"Bernaca","year":"2021","journal-title":"IEEE Access"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Ferraiolo, H., and Regenscheid, A. (2023). Cryptographic Algorithms and Key Sizes for Personal Identity Verification, National Institute of Standards and Technology. Technical Report.","DOI":"10.6028\/NIST.SP.800-78-5.ipd"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Alshahrani, H., Islam, N., Syed, D., Sulaiman, A., Al Reshan, M.S., Rajab, K., Shaikh, A., Shuja-Uddin, J., and Soomro, A. (2023). Sustainability in Blockchain: A Systematic Literature Review on Scalability and Power Consumption Issues. Energies, 16.","DOI":"10.3390\/en16031510"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Pote, S., Sule, V., and Lande, B. (2019, January 2\u20134). Arithmetic of Koblitz Curve Secp256k1 Used in Bitcoin Cryptocurrency Based on One Variable Polynomial Division. Proceedings of the 2nd International Conference on Advances in Science & Technology (ICAST), Bahir Dar, Ethiopia.","DOI":"10.2139\/ssrn.3367674"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Ifrim, R., Loghin, D., and Popescu, D. (2023, January 23). Baldur: A Hybrid Blockchain Database with FPGA or GPU Acceleration. Proceedings of the 1st Workshop on Verifiable Database Systems, Seattle, WA, USA.","DOI":"10.1145\/3595647.3595650"},{"key":"ref_7","first-page":"1","article-title":"Elliptic curve cryptography","volume":"9","author":"Kapoor","year":"2008","journal-title":"ACM Ubiquity"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Hankerson, D., Menezes, A.J., and Vanstone, S. (2010). Guide to Elliptic Curve Cryptography, Springer.","DOI":"10.1007\/978-1-4419-5906-5_245"},{"key":"ref_9","unstructured":"Bitcoin (2025, February 20). Secp256k1. Available online: https:\/\/archive.ph\/uBDlQ."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/MNET.011.2000473","article-title":"A survey on zero-knowledge proof in blockchain","volume":"35","author":"Sun","year":"2021","journal-title":"IEEE Netw."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/s102070100002","article-title":"The elliptic curve digital signature algorithm (ECDSA)","volume":"1","author":"Johnson","year":"2001","journal-title":"Int. J. Inf. Secur."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s13389-014-0084-8","article-title":"Constant time modular inversion","volume":"4","author":"Bos","year":"2014","journal-title":"J. Cryptogr. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Setiadi, I., Kistijantoro, A.I., and Miyaji, A. (2015, January 19\u201322). Elliptic curve cryptography: Algorithms and implementation analysis over coordinate systems. Proceedings of the 2015 2nd International Conference on Advanced Informatics: Concepts, Theory and Applications (ICAICTA), Chonburi, Thailand.","DOI":"10.1109\/ICAICTA.2015.7335349"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/MSSC.2018.2822862","article-title":"Three Ages of FPGAs: A Retrospective on the First Thirty Years of FPGA Technology: This Paper Reflects on How Moore\u2019s Law Has Driven the Design of FPGAs Through Three Epochs: The Age of Invention, the Age of Expansion, and the Age of Accumulation","volume":"10","author":"Trimberger","year":"2018","journal-title":"IEEE Solid-State Circuits Mag."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1109\/TCAD.2015.2513673","article-title":"A survey and evaluation of FPGA high-level synthesis tools","volume":"35","author":"Nane","year":"2015","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/3530775","article-title":"FPGA HLS Today: Successes, Challenges, and Opportunities","volume":"15","author":"Cong","year":"2022","journal-title":"ACM Trans. Reconfigurable Technol. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Dzurenda, P., Ricci, S., Hajny, J., and Malina, L. (2017, January 28\u201330). Performance Analysis and Comparison of Different Elliptic Curves on Smart Cards. Proceedings of the 2017 15th Annual Conference on Privacy, Security and Trust (PST), Calgary, AB, Canada.","DOI":"10.1109\/PST.2017.00050"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Awaludin, A.M., Larasati, H.T., and Kim, H. (2021). High-speed and unified ECC processor for generic Weierstrass curves over GF(p) on FPGA. Sensors, 21.","DOI":"10.20944\/preprints202101.0250.v1"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Yang, J., and Javaid, H. (2022, January 12\u201314). Efficient FPGA-based ECDSA Verification Engine for Permissioned Blockchains. Proceedings of the 2022 IEEE 33rd International Conference on Application-specific Systems, Architectures and Processors (ASAP), Gothenburg, Sweden.","DOI":"10.1109\/ASAP54787.2022.00032"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1109\/TC.2020.3013266","article-title":"Elliptic curve cryptography point multiplication core for hardware security module","volume":"69","author":"Mehrabi","year":"2020","journal-title":"IEEE Trans. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Huynh, H.T., Dang, T.P., Hoang, T.T., Pham, C.K., and Tran, T.K. (2023, January 11\u201312). An Efficient Cryptographic Accelerators for IoT System Based on Elliptic Curve Digital Signature. Proceedings of the International Conference on Intelligent Systems and Data Science, Can Tho, Vietnam.","DOI":"10.1007\/978-981-99-7666-9_9"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Tran, T.K., Dang, T.P., Hoang, T.T., Pham, C.K., and Huynh, H.T. (2023, January 25\u201327). Optimizing ECC Implementations Based on SoC-FPGA with Hardware Scheduling and Full Pipeline Multiplier for IoT Platforms. Proceedings of the International Conference on Intelligence of Things, Ho Chi Minh City, Vietnam.","DOI":"10.1007\/978-3-031-46573-4_28"},{"key":"ref_23","unstructured":"AMD-Xilinx (2025, February 20). Vitis Accelerated Libraries. Available online: https:\/\/github.com\/Xilinx\/Vitis_Libraries."},{"key":"ref_24","unstructured":"Waterman, A., Lee, Y., Patterson, D.A., and Asanovi\u0107, K. (2025, February 20). The RISC-V Compressed Instruction Set Manual, Version 1.7. EECS Department, University of California, Berkeley, UCB\/EECS-2015-157. Available online: https:\/\/www2.eecs.berkeley.edu\/Pubs\/TechRpts\/2015\/EECS-2015-209.pdf."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1860","DOI":"10.1016\/j.sbspro.2015.06.420","article-title":"Performance analysis of karatsuba multiplication algorithm for different bit lengths","volume":"195","author":"Eyupoglu","year":"2015","journal-title":"Procedia-Soc. Behav. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Boutros, A., Eldafrawy, M., Yazdanshenas, S., and Betz, V. (2019, January 24\u201326). Math Doesn\u2019t Have to be Hard: Logic Block Architectures to Enhance Low-Precision Multiply-Accumulate on FPGAs. Proceedings of the FPGA\u201919: The 2019 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, Seaside, CA, USA.","DOI":"10.1145\/3289602.3293912"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Joux, A. (2009). Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. Proceedings of the Advances in Cryptology-EUROCRYPT 2009, Springer.","DOI":"10.1007\/978-3-642-01001-9"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.46586\/tches.v2020.i4.189-208","article-title":"Faster Montgomery and double-add ladders for short Weierstrass curves","volume":"2020","author":"Hamburg","year":"2020","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/1\/20\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:56:39Z","timestamp":1760028999000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/1\/20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,19]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["cryptography9010020"],"URL":"https:\/\/doi.org\/10.3390\/cryptography9010020","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2025,3,19]]}}}