{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:29:27Z","timestamp":1781886567977,"version":"3.54.5"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T00:00:00Z","timestamp":1668384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2022,11,30]]},"abstract":"<jats:p>An important security requirement in automotive networks is to authenticate, sign, and verify thousands of short messages per second by each vehicle. This requirement mandates the use of a high speed Elliptic Curve Cryptography (ECC) hardware. The Residue Number Systems (RNS) provide a natural parallelism and carry-free operations that could speed-up long integer arithmetics of cryptographic algorithms. In this article, we propose a high-speed RNS Montgomery modular reduction units with parallel computing to reduce the latency of the field modular operations. We propose a fully RNS-based ECC scalar multiplication co-processor for NIST-P256r1 and Brainpool256r1 standard curves and improved the scalar multiplication speed using NAF and DBC numbering systems. Compared to the literature, our scheme provides faster computation without compromising the security level. The performance of our fully RNS-ECC point multiplication meets the requirements of the automotive industry.<\/jats:p>","DOI":"10.1145\/3431499","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T19:05:56Z","timestamp":1643915156000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Cryptographic Hardware for Safety Message Verification in Internet of Connected Vehicles"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3984-5361","authenticated-orcid":false,"given":"Mohamad Ali","family":"Mehrabi","sequence":"first","affiliation":[{"name":"Department of Computing, Macquarie University, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alireza","family":"Jolfaei","sequence":"additional","affiliation":[{"name":"Department of Computing, Macquarie University, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,11,14]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"IEEE 1609.2b-2019 \u2013IEEE Standard for Wireless Access in Vehicular Environments \u2013Security Services for Applications and Management Messages. ([n. d.]). Retrieved on 22 Mar 2022 from https:\/\/standards.ieee.org\/standard\/1609_2b-2019.html."},{"key":"e_1_3_1_3_2","unstructured":"ETSI TS 119 312 V1.3.1 (2019-02) Electronic Signatures and Infrastructures Cryptographic Suites. ([n. d.]). Retrieved on 22 Mar 2022 from https:\/\/www.etsi.org\/deliver\/etsi_ts\/119300_119399\/119312\/01.03.01_60ts_119312v010301p.pdf."},{"key":"e_1_3_1_4_2","article-title":"Value analysis of transmission distance in urban vehicular networks","author":"Cao T.","year":"2013","unstructured":"T. Cao and M.Y. Wu. 2013. Value analysis of transmission distance in urban vehicular networks. In Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering.","journal-title":"In Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2210916"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.709376"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt.2016.0141"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2006.1693348"},{"key":"e_1_3_1_9_2","first-page":"1","article-title":"Fast RNS implementation of elliptic curve point multiplication in GF(p) with selected base pairs","author":"Mo Yifeng","year":"2017","unstructured":"Yifeng Mo and Shuguo Li. 2017. Fast RNS implementation of elliptic curve point multiplication in GF(p) with selected base pairs. In Proceedings of the 2017 27th International Conference on Field Programmable Logic and Applications.1\u20136.","journal-title":"Proceedings of the 2017 27th International Conference on Field Programmable Logic and Applications."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-017-0154-9"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/940321"},{"key":"e_1_3_1_12_2","unstructured":"2000. SEC 2: Recommended Elliptic Curve Domain Parameter. https:\/\/www.secg.org\/SEC2-Ver-1.0.pdf."},{"key":"e_1_3_1_13_2","unstructured":"Elliptic Curve Cryptography (ECC) Brainpool Standard Curves and Curve Generation. ([n. d.]). Retrieved on 22 Mar 2022 from https:\/\/tools.ietf.org\/html\/rfc5639."},{"key":"e_1_3_1_14_2","article-title":"Two algorithms for modular exponentiation using nonstandard arithmetics","author":"Dimitrov Vassil S.","year":"1995","unstructured":"Vassil S. Dimitrov and Todor Cooklev. 1995. Two algorithms for modular exponentiation using nonstandard arithmetics. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 78, 1 (1995), 82\u201387.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"e_1_3_1_15_2","volume-title":"Double-base Scalar Multiplication Revisited","author":"Bernstein D. J.","year":"2017","unstructured":"D. J. Bernstein, C. Chuengsatiansup, and T. Lange. 2017. Double-base Scalar Multiplication Revisited. IACR."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25283-0_5"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.3013266"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41385-3"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography3020014"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-018-0195-8"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.84"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15031-9_4"},{"key":"e_1_3_1_23_2","unstructured":"Explicit Formulas Database. ([n. d.]). Retrieved on 22 Mar 2022 from https:\/\/hyperelliptic.org\/EFD."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2001239"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2013.2294649"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3431499","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3431499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:46Z","timestamp":1750195486000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3431499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,14]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11,30]]}},"alternative-id":["10.1145\/3431499"],"URL":"https:\/\/doi.org\/10.1145\/3431499","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,14]]},"assertion":[{"value":"2020-04-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-22","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}