Timestamp Based Authentication Protocol for Smart Card Using ECC

Elliptic curve digital signature algorithm (ECDSA) is elliptic curve analogue of digital signature algorithm. This paper presents implementation of ECDSA on NIST recommended Elliptic curves in binary fields of size 163 bits. The work involved implementation of different modules of ECDSA on reconfigurable hardware platform (Xilinx xc6vlx240T-1ff1156). The private key generation and binary weight calculation (used in scalar multiplication) is done in software using Microblaze (soft core of Xilinx). The private key along with the other global parameters for ECDSA are passed from Microblaze to the programmable logic of FPGA where final signature generation and verification is performed. Two implementations have been done based on different word sizes in Montgomery multiplication over binary fields. The first implementation requires 0.367 ms with 11040 slices for signature generation and 0.393 ms with 12846 slices for signature verification at a clocking frequency of 100 MHz. The second implementation requires 0.615 ms with 8773 slices for signature generation and 0.672 ms with 9967 slices for signature verification at the same clocking frequency. These implementations are faster compared to other implementations reported in literature for binary curves.

This paper concentrates on the hardware implementation of efficient and re- configurable elliptic curve digital signature algorithm (ECDSA) that is suitable for verifying transactions in Blockchain related applications. Despite ECDSA architecture being computationally expensive, the usage of a dedicated stand-alone circuit enables speedy execution of arithmetic operations. The prototype put forth supports N-bit elliptic curve cryptography (ECC) group operations, signature generation and verification over a prime field for any elliptic curve. The research proposes new hardware framework for modular multiplication and modular multiplicative inverse which is adopted for group operations involved in ECDSA. Every hardware design offered are simulated using modelsim register transfer logic (RTL) simulator. Field programmable gate array (FPGA) implementation of var- ious modules within ECDSA circuit is compared with equivalent existing techniques that is both hardware and software based to highlight the superiority of the suggested work. The results showcased prove that the designs implemented are both area and speed efficient with faster execution and less resource utilization while maintaining the same level of security. The suggested ECDSA structure could replace the software equivalent of digital signatures in hardware blockchain to thwart software attacks and to provide better data protection.

Background: Today’s developing era data and information security plays an important role in unsecured communication between Internet of Things (IoT) elements. As the technologies are developing huge amount of information are exchanged with each other which increases the demand of a secure encryption standards. Objectives: To protect the information transmission between nodes in the perceptual layer of IoT, security is to be enhanced such that the Men in Middle (MIM) attack of information by intruders in the communication link is not possible. Methods/Statistical analysis: The security method is implemented using the concept of symmetric, asymmetric and hash algorithms between the sender and receiver. Elliptic Curve Cryptography (ECC) is performed for encrypting and sharing the Advanced Encryption Standard (AES) secret key between the sender and receiver. Elliptic Curve digital signature are added with the encrypted data for validation in transmission. Secured Hash Algorithm (SHA) is considered for generating Elliptical Curve Digital Signature Algorithm (ECDSA). All the algorithms are combined to enhance the security. Findings: Elliptic Curve Cryptography is generally applied for encrypting and sharing the secret key between the sender and receiver when Advanced Encryption Standard is used for encryption/decryption of data. A highly efficient architectures for asymmetric key encryption is applied with symmetric key encryption for encrypting the data transmitted between the devices present in the perceptual layers in the IoT. Due to security issues NIST selected SHA-3 Keccak-f[1600] algorithm. An authentication process based on ECC is applied to perceptual layer involving initialization and authentication phase apart from encryption and signature generation. Sender combines the encrypted data and key with signature together before transmitting to the receiver. The receiver verifies the signature and decrypts the key and obtains original information. Hence it is very difficult for the man in middle to access the information exchanged between the Perceptual Layer devices. Application/Improvements: This generally doesn’t require an innovative technique but an approach to develop the method implemented successfully in the perceptual layer of Internet of Things. The key is encrypted and decrypted using a novel ECC algorithm with improved ECDSA.

Elliptic curve cryptography is a relatively new public-key cryptography mechanism which has been becoming more popular in recent years. Its usage has been increasing in various fields using different cryptographic protocols, such as Elliptic Curve Diffie-Hellman (ECDH), Elliptic Curve Digital Signature Algorithm (ECDSA) and the ElGamal encryption scheme. Several attacks have been developed to solve the elliptic curve discrete logarithm problem. One of the most practical generic attacks is the Pollard's Rho algorithm, which originates as an algorithm for prime factorisation. This paper will attempt to provide a statistical insight on how various factors, namely the private-public key pairs and parameters within the sequence used in Pollard's Rho algorithm, may affect the performance speed of the algorithm. This will be done using the ANOVA statistical test. which shows that from the perspective of the initial values and addends of the sequences, the Pollard's Rho algorithm is "random" enough.

This document describes algorithms based on Elliptic Curve Cryptography (ECC) for use within the Secure Shell (SSH) transport protocol. In particular, it specifies: Elliptic Curve Diffie-Hellman (ECDH) key agreement, Elliptic Curve Menezes-Qu-Vanstone (ECMQV) key agreement and Elliptic Curve Digital Signature Algorithm (ECDSA) for use in the SSH Transport Layer protocol.

In this paper, we describe the design and implementation of a new security protocol based on Elliptic Curve Cryptosystems (ECC) for securing Wireless Sensor Networks (WSNs). Some public-key-based protocols such as TinyPK and EccM 2.0 have already been proposed in response. However, they exhibit poor performance. Moreover, they are vulnerable to man-in-the-middle attacks. We propose a cluster-based Elliptic Curve Diffie-Hellman (ECDH) and Elliptic Curve Digital Signature Algorithm (ECDSA) for efficiency and security during the pairwise key setup and broadcast authentication phases, respectively. We have implemented our protocol on 8-bit, 7.3828-MHz MICAz mote. The experimental results indicate the feasibility of our protocol for WSNs.

In today's technology, ever increasing number of electronics applications require secure communication, for example the Internet of things devices. Elliptic Curve Diffie Hellman (EC-DH) Algorithm has emerged as an attractive and effective public-key cryptosystem. Elliptic curves are widely used in various key exchange techniques that include the Diffie-Hellman Key agreement scheme. When contrasted with conventional cryptosystems like RSA, ECC offers equivalent security with smaller key sizes, which results in lower power consumption, speedier calculations, and also lower memory and transmission capacity (bandwidth) reserve. This is particularly valid and helpful for applications like IoT gadgets, which are regularly constrained regarding their CPU processing speed, power, and area. This work includes the software and hardware implementation of Diffie-Hellman, Elliptic Curve Diffie-Hellman (ECDH) Key agreement algorithm, and RSA algorithm. The proposed work also involves analysis of power, performance, area, and their comparisons thereof. The comparison is based on metrics obtained, after implementing the algorithms in synopsys using 90 nm UMC Faraday library. The ECDH algorithm is found to be better than others as far as power and area are concerned.

In this paper we have implemented the ECDSA (Elliptic Curve Digital Signature Algorithm) technique to provide security in HWMP (Hybrid Wireless Mesh Protocol). The motivation behind the use of ECDSA is that it is integrated into the IEEE P802.11s/D4.0 standard. We have used the ECDSA technique to secure control message in HWMP, namely PREQ (Path Request) and PREP (Path Reply). In these Control messages, we are interested only by mutable fields (i.e. fields that change during control packet exchange). Simulation results show that the ECDSA-HWMP does not too much a long overhead compared to the orignal HWMP.

We have designed and fabricated a 256-bit elliptic curve digital signature algorithm (ECDSA) on a GF(p) signature generation processor in SOTB 65-nm CMOS. We have optimized the pipeline architecture of the Montgomery multiplier by exploiting parallelism, and have achieved 1/50 energy consumption for signature generation, as compared with the previously reported state-of-the-art. Our processor showed correct operation under a wide range of power supply voltages (Vdd) from 1.1 V to 0.25 V, realized a signature generation time (T s g) of 325 μs at Vdd of 1.1 V and a body bias of VBP = 0.55 V and VBN = 0.55 V, Tsg of 2.3 ms and an energy consumption of 1.68 μJ at Vdd of 0.3 V and a body bias of VBP = 0.3 V and VBN = 0 V, and Tsg of 11 ms and a power consumption of 0.15 mW at Vdd of 0.25 V and a body bias of VBP = 0.37 V and VBN = −0.12 V. Our design demonstrated the lowest power/energy value ever reported and the fastest signature generation ever reported in real silicon.

Cheque Truncation System (CTS) is a technique of preventing tangible movement of cheque by substituting it with a digital image, with an aim for secure and faster clearance. For the first time re-watermarking is applied for authenticating transactions in CTS. Methodology for the proposed approach splits the host image (Ih) into two layers (L). In L1 cheque details are fused with two image color channels to form a composite message (Cm). Secure hash algorithm (SHA-512) is applied to Cm to generate a unique message digest (Md). Elliptic Curve Digital Signature Algorithm (ECDSA) is applied to Md to create a digital signature. The signature is embedded by exploiting Human Visual System (HVS) color channel sensitivity in equally parted mode. In L2, joint secret is established to form key using Elliptic Curve Diffie Hellman Protocol (ECDHP). Advanced Encryption Standard (AES) is applied to user details intricate in the transaction. Encrypted contents are then inserted in L2 by applying Discrete Cosine Transform (DCT). Experimental results state solution to integrity concerns by using ECDSA with SHA-512, reaction to security issues by AES and the response to key distribution problem by ECDHP. An effective semi-blind CTS is perceived with PSNR between 59-60 dB.

In recent decades there has been an increasing interest in Elliptic curve cryptography (ECC) and, especially, the Elliptic Curve Digital Signature Algorithm (ECDSA) in practice. The rather recent developments of emergent technologies, such as blockchain and the Internet of Things (IoT), have motivated researchers and developers to construct new cryptographic hardware accelerators for ECDSA. Different types of optimizations (either platform dependent or algorithmic) were presented in the literature. In this context, we turn our attention to ECC and propose a new method for generating ECDSA moduli with a predetermined portion that allows one to double the speed of Barrett’s algorithm. Moreover, we take advantage of the advancements in the Artificial Intelligence (AI) field and bring forward an AI-based approach that enhances Schoof’s algorithm for finding the number of points on an elliptic curve in terms of implementation efficiency. Our results represent algorithmic speed-ups exceeding the current paradigm as we are also preoccupied by other particular security environments meeting the needs of governmental organizations.

Multiparty Computation (hereafter MPC) is a technique for allowing a set ofparticipants to run a secure computation with the assurance that the output is (1) correct, and (2) that a malicious party did not learn anything about the inputs of the honest parties besides what it can glean from the output. Impor- tantly much of cryptography is based on the assumption that an honest party has a private and secret input, and if the adversary learns this input the security of the scheme is broken. Then naturally the techniques of MPC can be applied to create threshold protocols for these cryptographic schemes to ensure that the secret inputs are not leaked and moreover that no group of parties smaller than the threshold know the input at all. While we have known how to generically evaluate MPC for any function since the 80s the question of efficiency still drives progress to this day. This thesis looks at two approaches for making secure com- putation more practical to deploy: developing specialized protocols for appli- cations such as distributed key generation and signing with RSA and ECDSA; and improving the state of the art of maliciously secure generic boolean-circuit MPC. We first look at work that produced a distributed key generation protocol for RSA that utilizes a novel candidate sampling mechanism to reduce waste in primality testing. The second work builds a threshold scheme for symmetric cryptographic primitives such as AES and SHA where there is limited algebraic structure to exploit by efficiently converting a generic n-of-n MPC protocol into a threshold t-of-n MPC protocol. Future directions in this thesis are in combin- ing techniques from the prior works to create a blind signature scheme for the Elliptic Curve Digital Signature Algorithm (ECDSA) that requires both alge- braic operations over elliptic curves and additionally symmetric evaluations of the SHA2 hash function.--Author's abstract

The use of public-key cryptosystems (PKC) received considerable attention. They are beneficial in encryption as well as signing which play an essential role in electronic banking and financial transactions. Elliptic Curve Cryptography (ECC) is one of best public key techniques because of its small key size and high security. Secure applications in smart cards present implementation challenges particular to the platform's memory, bandwidth, and computation constraints. ECC's unique properties make it especially well suited to smart card applications. ECC systems provide the highest strength per bit of any cryptosystem known today. The paper presents a new method for smart card implementation of elliptic curves, explaining how ECC can not only significantly reduce the cost, but also accelerate the deployment of smart cards in new applications. ECC permits reductions in key and certificate size that translate to smaller memory requirements (especially for EEPROM), which represent significant cost savings. This added functionality can play an effective role in electronic payment and online banking technologies.

The security and privacy of power data, which are core assets of energy systems, have become critical bottlenecks that restrict the development of new power systems, such as smart grids and the energy internet. Existing simulation techniques for composite power data encryption often suffer from high computational complexity, leading to slow processing speeds when dealing with large-scale power data, which makes it difficult to meet the real-time requirements of power system applications. To address this issue, a homomorphic encryption simulation method for composite power data is designed based on the elliptic curve digital signature algorithm. Smart meters enable the collection, measurement, and transmission of power data, while an encoding model for composite power data encryption is established. In addition, an advanced key-sharing mechanism is introduced, utilizing derived bilinear mappings on elliptic curves. By applying different key signatures, the proposed method integrates homomorphic encryption with arithmetic coding encryption to achieve comprehensive encryption of composite power data. Experimental results show that the proposed method achieves an encryption and decryption accuracy of over 98%, along with high performance in computational and communication efficiency. Moreover, its anti-attack capability remains consistently above 0.98. When processing 800-bit composite power data, the data transmission response time is 2.5 s.

The use of portable computing devices has been booming in recent years. Making Sure of the security in mobile systems has become a very important issue. However, a Mobile IP has to deal with some crucial problematic situations such as two Mobile Hosts communicating with each other while moving to the same visited network, for the datagram must pass through Foreign Agent. In this article, we shall propose a link-layer routing between two Mobile Hosts to make it possible for Mobile Hosts to communicate with each other directly. And we shall also employ the elliptic curve digital signature algorithm (ECDSA) to achieve authentication and to ensure security.