Abstract
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.
- [1] IEEE 1609.2b-2019 –IEEE Standard for Wireless Access in Vehicular Environments –Security Services for Applications and Management Messages. ([n. d.]). Retrieved on 22 Mar, 2022 from https://standards.ieee.org/standard/1609_2b-2019.html.Google Scholar
- [2] 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.Google Scholar
- [3] . 2013. Value analysis of transmission distance in urban vehicular networks. In Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering.Google Scholar
- [4] . 2012. Efficient RNS implementation of elliptic curve point multiplication over GF (p). IEEE Transactions on Very Large Scale Integration (VLSI) Systems 8, 21 (
1 2012).DOI: Google ScholarDigital Library
- [5] . 1998. An RNS montgomery modular multiplication algorithm. Computers, IEEE Transactions on 7, 47 (
8 1998), 766–776.DOI: Google ScholarDigital Library
- [6] . 2017. High-throughput multi-key elliptic curve cryptosystem based on residue number system. IET Computers and Digital Techniques 11, 5 (
9 2017), 165–172.DOI: Google ScholarCross Ref
- [7] . 2006. An RNS architecture of an fp elliptic curve point multiplier. In Proceedings of the IEEE International Symposium on Circuits and Systems.
DOI: Google ScholarCross Ref
- [8] . 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–6.Google Scholar
- [9] . 2018. Montgomery reduction within the context of residue number system arithmetic. Journal of Cryptographic Engineering 8, 3 (
1 Sep. 2018), 189–200.DOI: Google ScholarCross Ref
- [10] . 2003. Guide to Elliptic Curve Cryptography. Springer-Verlag, Berlin, Heidelberg.Google Scholar
Digital Library
- [11] 2000. SEC 2: Recommended Elliptic Curve Domain Parameter. https://www.secg.org/SEC2-Ver-1.0.pdf.Google Scholar
- [12] Elliptic Curve Cryptography (ECC) Brainpool Standard Curves and Curve Generation. ([n. d.]). Retrieved on 22 Mar, 2022 from https://tools.ietf.org/html/rfc5639.Google Scholar
- [13] . 1995. Two algorithms for modular exponentiation using nonstandard arithmetics. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 78, 1 (1995), 82–87.Google Scholar
- [14] . 2017. Double-base Scalar Multiplication Revisited. IACR.Google Scholar
- [15] . 2019. Optimal 2-3 Chains for Scalar Multiplication. Springer, 89–108.
DOI: Google ScholarCross Ref
- [16] . 2020. Elliptic curve cryptography point multiplication core for hardware security module. IEEE Transactions on Computers 1, 1 (
Aug. 2020), 1–1.DOI: Google ScholarCross Ref
- [17] . 2016. Residue Number Systems: Theory and Applications. Springer international Publishing Switzerland.Google Scholar
Cross Ref
- [18] . 2019. Improved sum of residues modular multiplication algorithm. Cryptography 3, 2 (
5 2019), 1–16.DOI: Google ScholarCross Ref
- [19] . 2019. RNS montgomery reduction algorithms using quadratic residuosity. Journal of Cryptographic Engineering 9, 4 (
1 Nov. 2019), 313–331.DOI: Google ScholarCross Ref
- [20] . 2012. An algorithmic and architectural study on montgomery exponentiation in RNS. IEEE Transactions on Computers 61, 8 (
Aug. 2012), 1071–1083.DOI: Google ScholarDigital Library
- [21] . 2010. A high speed coprocessor for elliptic curve scalar multiplications over \( \mathbb {F}_p \). In Proceedings of the Cryptographic Hardware and Embedded Systems, CHES 2010, and (Eds.). Springer Berlin Heidelberg, Berlin, 48–64.Google Scholar
Cross Ref
- [22] Explicit Formulas Database. ([n. d.]). Retrieved on 22 Mar, 2022 from https://hyperelliptic.org/EFD.Google Scholar
- [23] . 2008. Elixir: High-throughput cost-effective dual-field processors and the design framework for elliptic curve cryptography. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 16, 11 (
Nov. 2008), 1567–1580.DOI: Google ScholarDigital Library
- [24] . 2014. Fast and flexible hardware support for ECC over multiple standard prime fields. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 22, 12 (
Dec. 2014), 2661–2674.DOI: Google ScholarCross Ref
Index Terms
Efficient Cryptographic Hardware for Safety Message Verification in Internet of Connected Vehicles
Recommendations
Some techniques for faster scalar multiplication on GLS curves
Galbraith, Lin and Scott (EUROCRYPT 2009) 8 constructed a class of elliptic curves over F p 2 (a.k.a GLS curves) on which the Gallant-Lambert-Vanstone (GLV) method can be employed for fast scalar multiplication. In this work we give an alternative way ...
Fast Reconfigurable Elliptic Curve Cryptography Acceleration for GF(2m) on 32 bit Processors
This paper focuses on the design and implementation of a fast reconfigurable method for elliptic curve cryptography acceleration in GF (2 m ). The main contribution of this paper is comparing different reconfigurable modular multiplication methods ...
New Efficient Structure for a Modular Multiplier for RNS
Modular multiplication is a very important arithmetic operation in residue-based real-time computing systems. In realizing these multipliers, ROM-based structures are more efficient for small moduli. Due to the exponential growth of ROM sizes, ...






Comments