Implementation of elliptic curve digital signature algorithm on IRIS nodes

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.

The blockchain-enabled internet of medical things (IoMT) is an emerging paradigm that could provide strong trust establishment and ensure the traceability of data sharing in the IoMT networks. One of the fundamental building blocks for Blockchain is Elliptic Curve Digital Signature Algorithm (ECDSA). Nevertheless, when processing a large number of transactions, the verification of multiple signatures will incur cumbersome overhead to the nodes in Blockchain. Although batch verification is able to provide a promising approach that verifies multiple signatures simultaneously and efficiently, the upper bound of batch size is limited to small-scale and the efficiency will drop rapidly as the batch size grows in the state-of-the-art ECDSA batch schemes. Meanwhile, most of the existing researches only focus on improving the efficiency of batch verification algorithms in various cryptosystem while ignoring the identification of invalid signatures, which could cause severe performance degradation when the batch verification fails. Motivated by these observations, this paper proposes an efficient and large-scale batch verification scheme with group testing technology based on ECDSA. The application of the presented protocols in Bitcoin and Hyperledger Fabric has been analyzed as supportive and effective. When the batch verification returns a false result, we utilize group testing technology to improve the efficiency of identifying invalid signatures. Comprehensive simulation results demonstrate that our protocol outperforms the related ECDSA batch verification schemes.

Intelligent Transport System (ITS) provides innovative services to all modes of transportation. It facilitates numerous safety and traffic management applications by providing neighborhood mobility information using wireless communications. To implement this technology, secure wireless communication is a key requirement. As ITS applications involve the safety of vehicles, therefore a lower end-to-end delay is needed. ITS could be subject to security attacks such as man-in-the-middle, denial of service and jamming. A robust cryptographic algorithm is required that can provide defense against data tampering by malicious users. Elliptic Curve Digital Signature Algorithm (ECDSA) is a well-known cryptographic algorithm that provides robust security with a small message overhead. In this paper, we implement ECDSA signature algorithm on a Virtex 6 Field Programmable Gate Array (FPGA), which is capable to validate the real-time constraints of ITS applications. Parallelism is exploited in ECDSA architecture by using parallel processing techniques to reduce the hardware delays, thus reducing the real-time security and end-to-end delay of the ITS messages. The proposed implementation provides faster computational time for signature of ITS messages as compared to other implementations available in the literature.

5G-Vehicle-to-Everything (5G-V2X) supports high-reliability and low latency autonomous services and applications. Proposing an efficient security solution that supports multi-zone broadcast authentication and satisfies the 5G requirement is a critical challenge. In The 3rd Generation Partnership Project (3GPP) Release 16 standard, for Cellular- Vehicle-to-Everything (C-V2X) single-cell communication is suggested to reuse the IEEE1609.2 security standard that utilizes the Public Key Infrastructure (PKI) cryptography. PKI-based solutions provide a high-security level, however, it suffers from high communication and computation overhead, due to the large size of the attached certificate and signature. In this study, we propose a light-weight Multi-Zone Authentication and Privacy-Preserving Protocol (MAPP) based on the bilinear pairing cryptography and short-size signature. MAPP protocol provides three different authentication methods that enable a secure broadcast authentication over multiple zones of large-scale base stations, using a single message and a single short signature. We also propose a centralized dynamic key generation method for multiple zones. We implemented and analyzed the proposed key generation and authentication methods using an authentication simulator and a bilinear pairing library. The proposed methods significantly reduce the signature generation time by 16 times–80 times, as compared to the previous methods. Additionally, the proposed methods significantly reduced the signature verification time by 10 times–16 times, as compared to the two previous methods. The three proposed authentication methods achieved substantial speed-up in the signature generation time and verification time, using a short bilinear pairing signature.

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.

Efforts to reduce peak electrical demand have led to the introduction of demand response (DR) programmes for residences. DR programmes allow customers to reduce or shift consumption to off-peak periods in response to price signals. The RDS network is a strong candidate for delivering DR messages due to its low-cost nature and ubiquitous coverage. However, security concerns arise due to the wireless nature of the communication channel.We present evaluations of three candidate cryptographic methods that could be employed to offer source authentication over the RDS network: BiBa, HORSE and elliptic curve digital signature algorithm (ECDSA).We compare the security offered by the protocols, the bandwidth overhead, computational costs and message reception probability. Simulation results show that, up to a distance of 90 km, all authentication schemes do not affect message reception by the receivers. Beyond that, all the schemes have an effect on message reception due to increased message sizes and receiver bootstrapping for BiBa and HORSE. ECDSA and HORSE outperform BiBa in terms of message reception beyond 90 km. ECDSA, however, offers higher security than HORSE and BiBa but at the cost of increased computational complexity, in particular, at the receivers. In addition, has the highest bandwidth overhead.

A mode of operation of the Elliptic Curve Digital Signature Algorithm (ECDSA) is presented which provably excludes subliminal communication through ECDSA signatures. For this, the notion of a signature scheme that is subliminal-free with proof is introduced which can be seen as generalizing subliminal-free signatures and being intermediate to the established concepts of invariant and unique signatures. Motivated by the proposed use of ECDSA for signing passports, our focus is not on proving the mere existence of a subliminal-free ECDSA mode of operation, but on demonstrating its practical potential. The proposed construction relies on the availability of a party acting as warden and on a reasonably-sized non-interactive proof of subliminal-freeness. For instance, in the passport scenario, the passport holder plays the role of the warden, and we show that a suitable combination of the pseudo random function of Naor and Reingold with bit commitments and noninteractive zero-knowledge proofs can be used for accomplishing the required proof of subliminal-freeness with acceptable efficiency.

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.

In cloud and edge computing, senders of data often want to be anonymous, while recipients of data always expect that the data come from a reliable sender and they are not redundant. Linkable ring signature (LRS) can not only protect the anonymity of the signer, but also detect whether two different signatures are signed by the same signer. Today, most lattice-based LRS schemes only satisfy computational anonymity. To the best of our knowledge, only the lattice-based LRS scheme proposed by Torres et al. can achieve unconditional anonymity. But the efficiency of signature generation and verification of the scheme is very low, and the signature length is also relatively long. With the preimage sampling, trapdoor generation, and rejection sampling algorithms, this study proposed an efficient LRS scheme with unconditional anonymity based on the e-NTRU problem under the random oracle model. We implemented our scheme and Torres et al.'s scheme, as well as other four efficient lattice-based LRS schemes. It is shown that under the same security level, compared with Torres et al.'s scheme, the signature generation time, signature verification time, and signature size of our scheme are reduced by about 94.52%, 97.18%, and 58.03%, respectively.

Communication in wireless sensor networks uses the majority of a sensor's limited energy. Using aggregation in wireless sensor network reduces the overall communication cost. Security in wireless sensor networks entails many different challenges. Traditional end-to-end security is not suitable for use with in-network aggregation. A corrupted sensor has access to the data and can falsify results. Additively homomorphic encryption allows for aggregation of encrypted values, with the result being the same as the result when unencrypted data was aggregated. Using public key cryptography, digital signatures can be used to achieve integrity. We propose a new algorithm using homomorphic encryption and additive digital signatures to achieve confidentiality, integrity and availability for in-network aggregation in wireless sensor networks. We prove that our digital signature algorithm which is based on the elliptic curve digital signature algorithm (ECDSA) is as secure as ECDSA.

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.

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.

The Internet of Things (IoT) implementation in the livestock sector includes the use of sensors, software and internet-based platforms to monitor, manage and optimize in real-time. This research is intended to solve problems at PT. Indo Prima Beef noted that the use of animal feed is still based on estimates, resulting in the calculation of the selling price of cattle being inaccurate and potentially detrimental. Manual recording which is prone to errors and less efficient causes uncertainty in feed management and costs. Therefore, this research develops an IoT-based tool that is integrated in a wheelbarrow. This tool is capable of reading the results of weighing animal feed and storing the data in real-time in a database connected to web monitoring. Apart from that, the monitoring application can display recap results of cow feed weights, there are also features that support optimal use of the Smart Gerobak Sorong. The method used in this research is applying the Elliptic Curve Digital Signature Algorithm as a safeguard for data communication between IoT and the database. Based on the test results on a cow's feed weight of 10.6 kg, a difference value of 0.11 kg was obtained. This means that the average error value is 0.01%. So, it can be concluded that the loadcell sensor can read mass data for weighing cattle feed with the same load. With this tool, PT. Indo Prima Beef can increase the efficiency of feed use, optimize business income, and provide innovative and effective solutions in overall animal feed management.