Comparative performance analysis of public-key cryptographic operations in the WTLS handshake protocol

Mobile commerce is becoming more and more commonplace, but security is still a major concern. To provide security, the WAP (Wireless Application Protocol) forum suggests the WAP security architecture. However, it needs the WAP gateway for intermediate process between the WTLS (Wireless Transport Layer Security) and the SSL (Secure Socket Layer) protocol, and it does not guarantee end-to-end security between the mobile devices and the WAP servers. In this paper, we propose a new authentication protocol to solve this problem. Our solution is based on the design of a new network component that is called CRL-agent. Furthermore, we also analyze and evaluate the security strength of the proposed protocol.

This chapter introduces the first fully implemented two-way authentication security scheme for Internet-of-Things (IoT) based on existing Internet standards, specifically the Datagram Transport Layer Security (DTLS) protocol. By relying on an established standard, existing implementations, engineering techniques, and security infrastructure can be reused, which enables an easy security uptake. The proposed security scheme uses two public key cryptography algorithms, RSA (Rivest, Shamir und Adleman) and Elliptic Curve Cryptography (ECC), tailored for the resource heterogeneous nature of IoT devices. The two-way authentication solution presented is designed to work over standard communication stacks that offer UDP/IPv6 networking for Low power Wireless Personal Area Networks (LoWPANs). A prototype implementation of DTLS is presented here in the context of a system architecture, and the scheme’s feasibility (low overheads and high interoperability) is demonstrated through extensive evaluations on the DTLS-supporting platform OPAL as clusterhead with children of different IoT hardware platforms.

In the IoT era, 5G will enable various IoT services such as broadband access everywhere, high user and devices mobility, and connectivity of massive number of devices. Radio environment map (REM) can be applied to improve the utilization of radio resources for the access control of IoT devices by allocating them reasonable wireless spectrum resources. However, the primary problem of constructing REM is how to collect the large scale of data. Mobile crowd sensing (MCS), leveraging the smart devices carried by ordinary people to collect information, is an effective solution for collecting the radio environment information for building the REM. In this paper, we build a REM collecting prototype system based on MCS to collect the data required by the radio environment information. However, limited by the budget of the platform, it is hard to recruit enough participants to join the sensing task to collect the radio environment information. This will make the radio environment information of the sensing area incomplete, which cannot describe the radio information accuracy. Considering that the Kriging algorithm has been widely used in geostatistics principle for spatial interpolation for Kriging giving the best unbiased estimate with minimized variance, we utilize the Kriging interpolation algorithm to infer complete radio environment information from collected sample radio environment information data. The interpolation performance is analyzed based on the collected sample radio environment information data. We demonstrate experiments to analyze the Kriging interpolation algorithm interpolation results and error and compared them with the nearest neighbor (NN) and the inverse distance weighting (IDW) interpolation algorithms. Experiment results show that the Kriging algorithm can be applied to infer radio environment information data based on the collected sample data and the Kriging interpolation has the least interpolation error.

The reach of algebraic curves in cryptography goes far beyond elliptic curve or public key cryptography yet these other application areas have not been systematically covered in the literature. Addressing this gap, Algebraic Curves in Cryptography explores the rich uses of algebraic curves in a range of cryptographic applications, such as secret sh

Secure and efficient mutual authentication and key agreement schemes form the basis for any robust network communication system. Elliptic Curve Cryptography (ECC) has emerged as one of the most successful Public Key Cryptosystem that efficiently meets all the security challenges. Comparison of ECC with other Public Key Cryptosystems (RSA, Rabin, ElGamal) shows that it provides equal level of security for a far smaller bit size, thereby substantially reducing the processing overhead. This makes it suitable for constrained environments like wireless networks and mobile devices as well as for security sensitive applications like electronic banking, financial transactions and smart grids. With the successful implementation of ECC in security applications (e-passports, e-IDs, embedded systems), it is getting widely commercialized. ECC is simple and faster and is therefore emerging as an attractive alternative for providing security in lightweight device, which contributes to its popularity in the present scenario. In this paper, we have analyzed some of the recent password based authentication and key agreement schemes using ECC for various environments. Furthermore, we have carried out security, functionality and performance comparisons of these schemes and found that they are unable to satisfy their claimed security goals.

The Internet of Medical Things (IoMT) is a collection of medical equipment and software that can help patients get better care. The purpose of this study is to improve the security of data collected through remote health monitoring of patients utilizing Constrained Application Protocol (CoAP). Asymmetric cryptography techniques may be used to assure the security of such sensor networks. For communication between different IoMT devices and a remote server, the safe CoAP is compatible with the Datagram Transport Layer Security (DTLS) protocol for creating a secure session using existing algorithms such as Lightweight Establishment of Secure Session. The DTLS layer of CoAP, in contrast, has shortcomings in key control, session establishment, and multicast message exchange. As a consequence, for IoMT communication, the creation of an efficient protocol for safe CoAP session establishment is needed. Thus, to solve the existing problems related to key management and multicast security in CoAP, we have proposed an efficient and secure communication technique to establish a secure session key between IoMT devices and distant servers using lightweight Energy-Efficient and Secure CoAP Elliptic Curve Cryptography (E2SCEC2). The advantage of using E2SCEC2 over other identification methods such as Rivest-Shamir-Adleman (RSA) is its compact key size, which allows it to use a smaller key size. This article also compares these algorithms on parameters such as time spent generating keys, signature generation, and verification of E2SCEC2 and RSA algorithms, as well as energy consumption and radio duty cycle, to see if they are compatible in constrained environments.

The unprecedented increase in web-based services and digital systems has prompted the dire need for secure information transmission all over the global networks. Secure Sockets Layer (SSL) and Transport Layer Security (TLS) protocols form the basis of web communication that will provide confidentiality, authenticity, and integrity of data communication between different systems. In this work, we have critically compared and contrasted Transport Layer Security (TLS) and Secure Socket Layer (SSL), considering their design architectures, cryptographic mechanisms, and operational performance in modern applications. We took advantage of recent literature, global best practices, and international standards such as IETF RFC 8446 (TLS 1.3) and NIST SP 800-52 Rev.2 to evaluate security capability, vulnerabilities, and the strategies for migrations. TLS 1.3 is now the basic standard due to its enhanced efficiency, lower latency of handshake, and better encryption through AEAD (Authenticated Encryption with Associated Data) algorithms; however, compatibility with legacy systems and inconsistencies in configuration pose serious challenges. We concluded by recommending the best practices for developers, system architects, and cybersecurity professionals to build robust, standards-compliant web applications

With hardware support and software optimization, Public Key Cryptography (PKC) has been announced feasible on micro sensors recently [1][2][22][23]. A number of experiments proved that the Elliptic Curve Cryptography (ECC) is more suitable for resource constraint motes compared with RSA [2][3]. But even ECC based protocols still cost too much energy. In this paper, we propose C4W, an identity-based public key infrastructure specially designed for wireless sensor networks (WSNs), in which all nodes can generate others' ECC public keys directly from their identities. Without certificates, no energy will be consumed for certificates communication and verification, which makes C4W especially energy efficient. C4W uses a protocol without certificates to realize mutual authentication and key agreement. Compared with a simplified SSL (SSSL) protocol using an abbreviated certificate, C4W consumes lower than 35% energy, and the communication consumption of C4W is only 28.5% of that consumed by SSSL. Furthermore, the energy analysis of C4W illuminates that the expensive public key computational cost is almost neglectable compared with the heavy communication consumption in a large-scale WSNs, which gives the asymmetric key management in WSNs a bright future.

Elliptic curve cryptography (ECC) is based in one of the hardest arithmetic problems, the elliptic curve discrete logarithm problem, making ECC a reliable cryptographic technique. In addition to this advantage, ECC requires shorter keys compared to other public key algorithms, which suggests its use in low-end systems such as smart cards because of its efficiency and limited hardware requirements. Currently the leading smart card technology is Java card. Though both Java 2 standard edition (J2SE) 5.0 and Java card (JC) 2.2.1 include classes and interfaces making ECC available to Java programs, they are not complete, making it necessary to use additional, non-standard packages if the programmer wants to use ECC for different operations (digital signature, data encryption and decryption, etc.). In the present work, we provide a complete review of the state of the art of ECC in J2SE and Java card, with a complete list of operations available in both standard implementations and proprietary packages.

Elliptic curve cryptography is a public key cryptosystem based on the elliptic curve discrete logarithm problem. The reason for the attractiveness of ECC is that there is no sub-exponential algorithm known to solve the elliptic curve discrete logarithm problem. This leads to lower memory requirements, lower computation requirements and higher security than other public key cryptosystems. This project describes an implementation of a micro coded elliptic curve processor using FPGA technology. This processor implements optimal normal basis field operations. The design is generated by a parameterized module generator which can accommodate arbitrary n and also produce field multipliers with different speed/area tradeoffs. The control part of the processor is micro coded, enabling curve operations to be incorporated into the processor hence reducing the chip's I/O requirements. The micro coded approach also facilitates rapid development and algorithmic optimization. for example, projective and affine coordinates were supported using different sets of micro codes. The design was successfully tested on a Xilinx Spartan -II kit device. Elliptic curve processor is particularly suitable for recourse limited devices because of its lower requirements of memory and computation. It is applicable to be implanted into smart cards, cellular phones and other hand-held devices so that secure communication can be provided. For based on implement the FPGA Using Verilog HDL.

A public-key encryption algorithm and a practical hybrid scheme are proposed in this paper. This algorithm uses the advanced transform techniques, i.e. the Number Theoretic Transforms (NTTs) to diffuse data, and uses a non-linear technique based on the Elliptic Curve Discrete Logarithm Problem (ECDLP) to confuse data. The main advantage of the proposed algorithm is its high efficiency and capability. The plaintext can be encrypted in blocks in parallel, thus saves computational time. The proposed algorithm also can be easily applied in a hybrid scheme for practical applications.

Public‐key cryptosystems such as elliptic curve cryptography (ECC) and Rivest–Shamir–Adleman (RSA) are widely used for data security in computing systems. ECC provides a high level of security with a much smaller key than RSA, which makes ECC a preferred choice in many applications. This study proposes a multi‐key ECC based on the residue number system. The proposed architecture employees deep pipelining to allow the concurrent encryption of 21 keys. The proposed architectures are implemented on two different field programmable gate array (FPGA) platforms and results are compared with existing ECC architectures. The proposed implementation on Virtex‐7 FPGA achieves a throughput of 1816 kbps at a clock frequency of 73 MHz.

Several groupware applications like e-conferences, pay-per view, online games, etc. require a common session key to establish a secure communication among the group participants. For secure communication, such applications often need an efficient group key establishment protocol to construct a common session key for group communications. Conventional group key transfer protocols depends on mutually trusted key generation center (KGC) to generate and distribute the group key to each participant in each session. However, those approaches require extra communication overheads in the server setup. This paper presents an efficient and secure group key transfer protocol using elliptic curve cryptography (ECC). The proposed protocol demonstrates a novel group key transfer protocol, in which one of the group member plays the role of KGC (the protocol without an online KGC, which is based on elliptic curve discrete logarithm problem (ECDLP) and Shamir’s secret sharing scheme. The confidentiality of the proposed protocol is ensured by Shamir’s secret sharing, i.e., information theoretically secure and provides authentication using ECDLP. Furthermore, the proposed protocol resists against potential attacks (insider and outsider) and also significantly reduces the overheads of the system. The security analysis section of the present work also justifies the security attributes of the proposed protocol under various security assumptions.

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.

Background/Objectives: Today’s Technological world Information Security is an essential for commercial and legal trading, secrecy, truthfulness and non-reputability. The Elliptic Curve Cryptography (ECC) has become one of the latest trends in the field of Public-Key Cryptography (PKC). ECC promises a faster, efficient and more secured. In this paper, the Standard ECC and proposed Improved ECC (IECC) are compared. Methods/Statistical Analysis: The proposed IECC algorithm is designed to be more challenging as the repetitive characters of the text are replaced with the different cipher text in each of the iteration and outperforms the standard ECC in terms of cipher text, encryption, decryption time and security. This algorithm helps to assure end to end encryption for Online Social Network (OSN) users. Findings: The statistical analysis approach reveals a significant feature that the cipher text of IECC does not correlated with the plain text. This approach is improved ECC reduces more security than the Standard ECC. The proposed method is concluded that implemented IECC is better than standard ECC. Applications/Improvements: Except the proposed algorithm used for this research, the possibility of using other algorithms are implemented in future work. Keywords: Cryptosystem, Decryption, Elliptic Curve Cryptography, Encryption, Key Generation