Abstract
Teleoperated robotic systems are those in which human operators control remote robots through a communication network. The deployment and integration of teleoperated robot’s systems in the medical operation have been hampered by many issues, such as safety concerns. Elliptic curve cryptography (ECC), an asymmetric cryptographic algorithm, is widely applied to practical applications because its far significantly reduced key length has the same level of security as RSA. The efficiency of ECC on GF (p) is dictated by two critical factors, namely, modular multiplication (MM) and point multiplication (PM) scheduling. In this paper, the high-performance ECC architecture of SM2 is presented. MM is composed of multiplication and modular reduction (MR) in the prime field. A two-stage modular reduction (TSMR) algorithm in the SCA-256 prime field is introduced to achieve low latency, which avoids more iterative subtraction operations than traditional algorithms. To cut down the run time, a schedule is put forward when exploiting the parallelism of multiplication and MR inside PM. Synthesized with a 0.13 um CMOS standard cell library, the proposed processor consumes 341.98k gate areas, and each PM takes 0.092 ms.
Highlights
In teleoperated robotic systems, human operators, often geographically distant, interact with and control robots through a communication network
Motived to provide highly efficient safety assurance for teleoperated systems, we realize Elliptic curve cryptography (ECC) by hardware implementation. e main contributions of this paper include the following: We propose a high-performance hardware processor, which adopts a half-word multiplier to improve performance while reducing hardware consumption
3.72 13.17 30.83 15.48 65.80 105.67 80.46 delay and power consumption are important, so using hardware to realize cryptographic algorithms has become an imperative tendency. e ECC processor we proposed here is implemented in hardware and can provide a high performance. e most complicated operations, such as point multiplication (PM), PA, and modular operations, are implemented by the hardware proposed here and this hardware module can be called by software to realize digital signature/verification and encryption/decryption to resolve the safety issue of teleoperated systems
Summary
Human operators, often geographically distant, interact with and control robots through a communication network. The last communication link may even be a wireless link to a drone or a satellite, providing the connection to a trusted facility (possibly a large hospital with an established infrastructure) [5] In such operating conditions, the security of the longrange control is significant, since if the teleoperated robotics are attacked by hackers, potential damage might be caused due to loss of proper control. In order to accelerate the MM, the proposed designs should be considered into three categories [23]: (1) the recommended prime modular multiplication algorithm, (2) Montgomery multiplication algorithm, and (3) the interleaved modular multiplication algorithm Among those three categories, the first category is the fastest and it is limited by the specific prime field, such as NIST and SCA256.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
