scholarly journals An Efficient Elliptic-Curve Point Multiplication Architecture for High-Speed Cryptographic Applications

Electronics ◽  
2020 ◽  
Vol 9 (12) ◽  
pp. 2126
Author(s):  
Muhammad Rashid ◽  
Malik Imran ◽  
Asher Sajid
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
High Speed ◽  
Hardware Architecture ◽  
Computational Time ◽  
Point Multiplication ◽  
Heterogeneous Devices ◽  
Binary Fields ◽  
Time Required ◽  
Place And Route

This work presents an efficient high-speed hardware architecture for point multiplication (PM) computation of Elliptic-curve cryptography using binary fields over GF(2163) and GF(2571). The efficiency is achieved by reducing: (1) the time required for one PM computation and (2) the total number of required clock cycles. The required computational time for one PM computation is reduced by incorporating two modular multipliers (connected in parallel), a serially connected adder after multipliers and two serially connected squarer units (one after the first multiplier and another after the adder). To optimize the total number of required clock cycles, the point addition and point double instructions for PM computation of the Montgomery algorithm are re-structured. The implementation results after place-and-route over GF(2163) and GF(2571) on a Xilinx Virtex-7 FPGA device reveal that the proposed high-speed architecture is well-suited for the network-related applications, where millions of heterogeneous devices want to connect with the unsecured internet to reach an acceptable performance.

Implementation of Pollard Rho attack on elliptic curve cryptography over binary fields

2015 ◽  
Author(s):  
Wienardo ◽  
Fajar Yuliawan ◽  
Intan Muchtadi-Alamsyah ◽  
Budi Rahardjo
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Binary Fields

scholarly journals Data (Video) Encryption in Mobile devices

2017 ◽  
Vol 2 (3) ◽  
pp. 32-39
Author(s):  
Aya Khalid Naji ◽  
Saad Najim Alsaad
Keyword(s):  
Elliptic Curve ◽  
Mobile Devices ◽  
Mobile Device ◽  
Elliptic Curve Cryptography ◽  
Computation Time ◽  
Video Encryption ◽  
Android Platform ◽  
Time Required ◽  
New Generation

In the development of 3G devices, all elements of multimedia (text, image, audio, and video) are becoming crucial choice for communication. The secured system in 3G devices has become an issue of importance, on which lot of research is going on. The traditional cryptosystem like DES, AES, and RSA do not able to meet with the properties of the new generation of digital mobile devices. This paper presents an implementation of video protection of fully encrypted using Elliptic Curve   Cryptography (ECC) on a mobile device. The Android platform is used for this purpose.  The results refer that the two important criteria of video mobile encryption: the short computation time required and high confidentially are provided.

scholarly journals A High-Speed Elliptic Curve Cryptography Processor for Teleoperated Systems Security

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Yong Xiao ◽  
Weibin Lin ◽  
Yun Zhao ◽  
Chao Cui ◽  
Ziwen Cai
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
High Speed ◽  
High Performance ◽  
Prime Field ◽  
Practical Applications ◽  
Cell Library ◽  
Cryptographic Algorithm ◽  
Human Operators ◽  
Key Length

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.

A Secure Gateway Discovery Protocol Using Elliptic Curve Cryptography for Internet-Integrated MANET

2021 ◽  
pp. 433-457
Author(s):  
Pooja Verma
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Security Protocol ◽  
Computational Time ◽  
The Internet ◽  
Application Domain ◽  
Storage Space ◽  
Gateway Node ◽  
Time Simulation ◽  
Simulation Results

Integration procedures are employed to increase and enhance computing networks and their application domain. Extensive studies towards the integration of MANET with the internet have been studied and worked towards addressing various challenges for such integration. Some idyllic mechanisms always fail due to the presence of some nasty node or other problems such as face alteration and eavesdropping. The focus of this chapter is on the design and discovery of secure gateway scheme in MANET employing trust-based security factors such as route trust and load ability. Over these, the elliptic curve cryptography is applied to achieve confidentiality, integrity, and authentication while selecting optimum gateway node that has less bandwidth, key storage space, and faster computational time. Simulation results of the security protocol through SPAN for AVISPA tool have shown encouraging results over two model checkers namely OFMC and CL-AtSe.

Sign in / Sign up

Export Citation Format

Share Document