Elliptic Curve Cryptography Scheme Research Articles

A Lightweight Authentication Protocol for UAVs Based on ECC Scheme

With the rapid development of unmanned aerial vehicles (UAVs), often referred to as drones, their security issues are attracting more and more attention. Due to open-access communication environments, UAVs may raise security concerns, including authentication threats as well as the leakage of location and other sensitive data to unauthorized entities. Elliptic curve cryptography (ECC) is widely favored in authentication protocol design due to its security and performance. However, we found it still has the following two problems: inflexibility and a lack of backward security. This paper proposes an ECC-based identity authentication protocol LAPEC for UAVs. LAPEC can guarantee the backward secrecy of session keys and is more flexible to use. The time cost of LAPEC was analyzed, and its overhead did not increase too much when compared with other authentication methods.

An Efficient Authenticated Elliptic Curve Cryptography Scheme for Multicore Wireless Sensor Networks

The need to ensure the longevity of Wireless Sensor Networks (WSNs) and secure their communication has spurred various researchers to come up with various WSN models. Prime among the methods for extending the life span of WSNs is the clustering of Wireless Sensors (WS), which reduces the workload of WS and thereby reduces its power consumption. However, a drastic reduction in the power consumption of the sensors when multicore sensors are used in combination with sensors clustering has not been well explored. Therefore, this work proposes a WSN model that employs clustering of multicore WS. The existing Elliptic Curve Cryptographic (ECC) algorithm is optimized for parallel execution of the encryption/decryption processes and security against primitive attacks. The Elliptic Curve Diffie-Helman (ECDH) was used for the key exchange algorithm, and the Elliptic Curve Digital Signature Algorithm (ECDSA) was used to authenticate the communicating nodes. Security analysis of the model and comparative performance analysis with the existing ones were demonstrated. The security analysis results reveal that the proposed model meets the security requirements and resists various security attacks. Additionally, the projected model is scalable, energy-conservative, and supports data freshness. The results of comparative performance analysis show that the proposed WSN model can efficiently leverage multiprocessors and/or many cores for quicker execution and conserves power usage.

An Enhanced Elliptic Curve Cryptography Scheme for Secure Data Transmission to Evade Entailment of Fake Vehicles in VANET

Vehicular Ad-hoc Networks (VANET) help to increase traffic safety, manageability, and efficiency. VANET facilitates effective communication in the vehicular nodes. Here, the network attack is one of the significant consequences of VANET, which may affect network security. The high mobility of the nodes may become difficult to transfer the data through the vehicle. In this article, a novel method of Elliptic Curve Cryptography (ECC) is proposed. The key is generated by Key Generation Unit (KGU), and also the key is fed into the Road Side Unit (RSU). The keys in Enhanced ECC (EECC) are optimized using the Adaptive Horse herd Optimization Algorithm (AHOA). During decryption, the key of source node K1 is to be taken from RSU, where the key is processed by the Digital Signature method to obtain EECC key K2. With the generated K2, the destination node can retrieve the data by the proposed model. Thus, the simulation analysis of the proposed AHOA-EECC method has attained less time complexity which was compared against the high value of 5%, 12.4%, 50%, and 13.7% for GWO-EECC, PSO-EECC, AOA-EECC, and HOA-EECC. Finally, the outcome of the proposed system enhances the security level and performs better data transmission.

Financial information security using hybrid encryption technique on multi-cloud architecture

One of the most severe issues in the cloud is security. In comparison to financial data, so it is extremely sensitive and must be safeguarded against unwanted access. We have developed a proposed system based on three different keys. We divided the data into insensitive, sensitive, and highly sensitive data. The data will be saved on a separate cloud server. The proposed system used different keys for encryption and decryption purposes. The elliptic curve cryptography (ECC) based distributed cloud-based secure data storage (DDSPE) approach was proposed to provide secure large data based data protection across the different clouds. With DDSPE technology, the ECC scheme has been used for encryption and decryption purposes. The cloud is used for simulation. The results of the tests reveal that the suggested DDSPE system is safe and saves time regarding data retention and retrieval. To analyze performance, we compared the DDSPE method with advance encryption standard (AES), blowfish, rivest shamir adleman (RSA), security-aware efficient distributed storage (SA-EDS), and attribute based encryption (ABE) based secure distributed storage (ASDSS). In terms of information retention and recovery, our methodology is quite effective because it requires less amount of time as compared to other strategies.

Improved authenticated elliptic curve cryptography scheme for resource starve applications

Elliptic curve cryptography (ECC) remains the best approach to asymmetric cryptography when it comes to securing communication among communication partners in low-computing devices such as wireless sensor networks (WSN) and the Internet of Things (IoT) due to its effectiveness in generating small keys with a strong encryption mechanism. The ECC cuts down on power use and improves device performance, so it can be used in a wide range of devices that don't have a lot of resources. However, most of the existing ECC implementations suffer from implementation flaws that make them vulnerable to cryptanalysis attacks. In this study, flaws in the existing implementation of ECC are identified. A new scheme where the identified flaws are remedied was developed. The results of the security analysis show that the new scheme is an indistinguishable authenticated adaptive chosen ciphertext attack (IND-CCA3), resistant to malleability and man-in-the-middle attacks (MIMA). The results of comparative security analysis show that the mapping scheme employed in the new scheme maps any blocks of plaintext to distinct points on an elliptic curve, which makes it resistant to all attacks that the existing schemes are vulnerable to without having a negative effect on its encryption and decryption time, throughput, or power consumption.

Improved authenticated elliptic curve cryptography scheme for resource starve applications

Elliptic curve cryptography (ECC) remains the best approach to asymmetric cryptography when it comes to securing communication among communication partners in low-computing devices such as wireless sensor networks (WSN) and the Internet of Things (IoT) due to its effectiveness in generating small keys with a strong encryption mechanism. The ECC cuts down on power use and improves device performance, so it can be used in a wide range of devices that don't have a lot of resources. However, most of the existing ECC implementations suffer from implementation flaws that make them vulnerable to cryptanalysis attacks. In this study, flaws in the existing implementation of ECC are identified. A new scheme where the identified flaws are remedied was developed. The results of the security analysis show that the new scheme is an indistinguishable authenticated adaptive chosen ciphertext attack (IND-CCA3), resistant to malleability and man-in-the-middle attacks (MIMA). The results of comparative security analysis show that the mapping scheme employed in the new scheme maps any blocks of plaintext to distinct points on an elliptic curve, which makes it resistant to all attacks that the existing schemes are vulnerable to without having a negative effect on its encryption and decryption time, throughput, or power consumption.

DPF-ECC: A Framework for Efficient ECC With Double Precision Floating-Point Computing Power

Used ubiquitously in a huge amount of security protocols or applications, elliptic curve cryptography (ECC) is one of the most important cryptographic primitives, featuring efficiency and short key size compared with other public-key cryptosystems such as DSA and RSA. However, as a computation-intensive public-key cryptographic primitive, ECC arithmetic is still the bottleneck that restrains the overall performance of the end applications. In this paper, instead of the conventional and straightforward integer-based methods, we present a general framework to accelerate ECC schemes over prime field, called DPF-ECC, that deeply exploits double precision floating-point (DPF) computing power. The DPF-ECC framework finely manages each bit of the DPF numbers and minimizes the overhead brought by additional data format conversion, by making use of the DPF representation, the rounding operations, and fused multiply-add instruction supported by the IEEE 754 floating point standard. We also conduct two comprehensive case studies on Crandall primes and Solinas primes to demonstrate how the DPF-ECC framework is applied to the prevailing ECC schemes. To evaluate the proposed DPF-ECC framework in the real world, leveraging the floating-point computing power of GPUs, we implement Curve25519/448 and Edwards25519/448, the popular ECC schemes widely used in TLS 1.3, SSH, etc. The experimental result in Tesla P100 achieves a record-setting performance that outperforms the existing fastest integer work with 2x to 3x throughput. With dependency only on the very commonly supported IEEE 754 floating point standard, DPF-ECC framework can be a very competent and promising candidate for ECC implementation in most of general-purpose platforms.

Computationally efficient mutual authentication protocol for remote infant incubator monitoring system.

Internet of Things (IoT), cloud computing and wireless medical sensor networks have significantly improved remote healthcare monitoring. In a healthcare monitoring system, many resource-limited sensors are deployed to sense, process and communicate the information. However, continuous and accurate operations of these devices are very important, especially in the infant incubator monitoring system. Because important decisions are made on the received information. Therefore, it is necessary to ensure the authenticity between the incubator monitoring system and doctors. In this work, a public key encryption based computationally efficient mutual authentication protocol is proposed for secure data transmission between incubator monitoring systems and doctors or administrators. The proposed protocol improves performance and reduces the computational cost without compromising the security. The security analysis part shows the strength of the proposed protocol against various attacks, performance analysis part shows that the proposed protocol performs better than other existing protocol based on Rivest–Shamir–Adleman and elliptic-curve cryptography schemes.

Dynamic Scalable Elliptic Curve Cryptographic Scheme and Its Application to In-Vehicle Security

The design of unified, efficient, and lightweight cryptographic platform for resource-constrained on-board devices such as sensors, microcontrollers, and actuators in the context of Internet of Vehicles remains an open and challenging problem, for both academic and industry. Elliptic curve cryptography (ECC) is considered as a promising encryption algorithm for the next generation communications, as it could provide the same strong security level using relatively smaller key size when compared to the currently used Rivest–Shamir–Adleman algorithm. However, traditional ECCs have the disadvantage of using a fixed curve, making it very easy to be intensively analyzed while being hard to construct a united platform for on-board devices with processors of different instruction lengths. To mitigate the above problem, this paper suggests a dynamic scalable elliptic curve cryptosystem. To synchronize the curve in use, a curve list of different security levels is generated and preserved on both parties. Since both parties randomly choose the curve and the prime number, a extra security level could be provided, so that the security level can still remain the same even using smaller key sizes, while the computation efficiency will be enhanced and the power consumption will be reduced, which is especially suitable for the application in on-board embedded devices. Detailed experimental results illustrate that the presented scheme improves the efficiency by 30% in average when compared with traditional ECC implementations on a similar security level. Therefore, the proposed scalable ECC scheme as a unified cryptographic platform is more economic for these on-board devices in vehicles.

Secure Digital Signature with Elliptic Curve Cryptography Scheme using Galois Field

Secure Digital Signature with Elliptic Curve Cryptography Scheme using Galois Field

Faster Scalar Multiplication Algorithm to Implement a Secured Elliptic Curve Cryptography System

Elliptic Curve Cryptography provides similar strength of protection comparing other public key cryptosystems but requires significantly smaller key size. This paper proposes a new faster scalar multiplication algorithm aiming at a more secured Elliptic Curve Cryptography scheme. This paper also proposes a novel Elliptic Curve Cryptography scheme where maximum length random sequence generation method is utilized as data mapping technique on elliptic curve over a finite field. The proposed scheme is tested on various bits length of prime field and key sizes. The numerical experiments demonstrate that the proposed scheme reduces the computation time compared to conventional scheme and shows very high strength against cryptanalytic attack particularly random walk attack.

Edwards Curves and Extended Jacobi Quartic-Curves for Efficient Support of Elliptic-Curve Cryptosystems in Embedded Systems

The efficient support of cryptographic protocols based on elliptic curves is crucial when embedded processors are adopted as the target hardware platforms. The implementation of Elliptic Curve Cryptography (ECC) offers a variety of design options, mostly covering the specific family of curves and the related coordinate system. At the same time, theory shows that a limited set of solutions can actually lead to efficient computational implementations. This paper analyzes these configurations from an applicative perspective, and mainly addresses two families of curves, namely, Edwards curves and extended Jacobi quartic curves, under a variety of coordinate systems. The experimental results prove that the ECC schemes based on either Edwards curves or extended Jacobi quartic curves can attain remarkable performances in terms of computational efficiency on low-cost, lowresources processors. Edwards curves, in particular, yield best performances when expressed in inverted coordinates.

Multiple Server Indirect Security Authentication Protocol for Mobile Networks Using Elliptic Curve Cryptography (ECC)

More number of research works develops many authentication protocols and algorithms to provide a security in the mobile networks. But these existing protocols have the drawbacks in which a single and more than one server put in practice. These protocols suffer if the single server is compromised by the adversaries and in more than one server the protocols finds high complexity in design and integration of keys. To address these issues in the existing works, in this paper a new complexity reduced protocol is proposed with multiple servers. In this paper, we propose an indirect security protocol for mobile networks based on ECC scheme. Initially, we generate keys to the multiple servers by the ECC scheme and these servers validate the each user node to provide the information. In mobile networks, it is essential to validate every node when it tries to request information from base station. After the key generation and the validation by the servers the information sharing process is accomplished between the user and the base station. In our security protocol is highly secure by generating cryptographic schemes distributed based on ECC and executed over multiple servers. The proposed indirect security protocol performance is analyzed by invoking more number of authenticated and adversary users and the result from this process guarantees the healthiness of the proposed security protocol. The implementation results show the effectiveness of proposed ECC based indirect security protocol in authenticating the users to access the information from the base station and the achieved improvement in security process. Moreover, the performance of the proposed indirect security protocol is evaluated by comparing with the existing indirect authentication security protocol in mobile networks.

모바일 환경에서 안전한 One-Time Password 인증 기법에 관한 연구

Since then, with the advance of computing environment, various Internet services are emerging and the importance of user authentication technology is increasing for verifying users authorized to use such services. Along with the advance of authentication technology, research is being made actively on one time password, which is used once in a session and then discarded. In existing one time passwords, however, the values of one time passwords in a created table are stored in serial order, and therefore, if the seed value and the number of one time passwords used are disclosed, one may infer the value of the one time password to be used next. What is more, one time passwords of the S/Key type have the problem that the number of uses is fixed. In this paper, We analysis the existing one time password. Also, We propose one time password methods using elliptic curve cryptography scheme and using enhanced randomness with time value.