Figure - available via license: Creative Commons Attribution-ShareAlike 4.0 International
Content may be subject to copyright.
![Comparison of ECC and RSA key sizes [3]](publication/365334830/figure/tbl1/AS:11431281096749227@1668279597453/Comparison-of-ECC-and-RSA-key-sizes-3.png)
Source publication
![Figure 1. Pictorial representation of operations in ECC [23]; (a) Point...](publication/365334830/figure/fig1/AS:11431281096770646@1668279597158/Pictorial-representation-of-operations-in-ECC-23-a-Point-addition-b-Point_Q320.jpg)
![Comparison of ECC and RSA key sizes [3]](publication/365334830/figure/tbl1/AS:11431281096749227@1668279597453/Comparison-of-ECC-and-RSA-key-sizes-3_Q320.jpg)
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 cut...
Contexts in source publication
Context 1
... ECC is widely applied for securing data on devices in resource constrained environment such as IoT and WSN devices [12]. This suitability of ECC in resource starve devices stems from the fact that ECC provides equal security for lesser key bit size than RSA [18] as shown by the comparison of the key sizes in Table 1. As a result, ECC supports low computation device capabilities, enabling them to perform more effectively [4]. ...Context 2
... order to ascertain the effects of changing the sizes of keys on the encryption/decryption time, throughput and energy consumption during encryption and decryption processes on the schemes under consideration, average encryption/decryption time, throughput and power consumption during encryption/decryption processes were calculated and compared. Table 10 shows the recorded encryption and decryption time during the experiment when different key sizes were encrypted and decrypted using three different ECC schemes. Average encryption and decryption time is calculated as shown in Table 11. ...Context 3
... 10 shows the recorded encryption and decryption time during the experiment when different key sizes were encrypted and decrypted using three different ECC schemes. Average encryption and decryption time is calculated as shown in Table 11. Table 12 shows the calculated encryption and decryption throughputs for the three ECC schemes under consideration. ...Context 4
... encryption and decryption time is calculated as shown in Table 11. Table 12 shows the calculated encryption and decryption throughputs for the three ECC schemes under consideration. The energy consumption during encryption and decryption processes for each of the three ECC schemes are shown in Table 13. ...Context 5
... 12 shows the calculated encryption and decryption throughputs for the three ECC schemes under consideration. The energy consumption during encryption and decryption processes for each of the three ECC schemes are shown in Table 13. Although the corresponding encryption and decryption time in Table 10 appear to be the same for the three schemes for each data size, there is variation in the values when the number of decimal places is considered. ...Context 6
... energy consumption during encryption and decryption processes for each of the three ECC schemes are shown in Table 13. Although the corresponding encryption and decryption time in Table 10 appear to be the same for the three schemes for each data size, there is variation in the values when the number of decimal places is considered. This explains the reason why the average encryption/decryption time calculated are not the same for the three schemes under consideration. ...Context 7
... explains the reason why the average encryption/decryption time calculated are not the same for the three schemes under consideration. The bar chart in Figure 8 represents the information in Table 11. The bar chart shows that the encryption and decryption time for the three ECC schemes are approximately the same. ...Context 8
... result implies that the modification done in IAECC does not make its encryption and decryption time higher than that of the existing ECC schemes. The bar chart in Figure 9 represents the information in Table 12 where the encryption and decryption throughputs of the three ECC schemes were compared. As can be seen, the encryption and decryption throughputs of the three schemes are approximately equal. ...Context 9
... result implies that the modification in IECC does not make its encryption and decryption throughputs lower than the encryption and decryption of the existing ECC schemes. Figure 10 represents the information in Table 13 where the encryption and decryption energy consumption of the three ECC schemes were compared. The results in the Figure 9 reveals that the energy consumption of the system during encryption and decryption are approximately equal. ...Similar publications
Elliptic curve cryptography (ECC) is a kind of public key cryptosystem. In this paper, we will present some ECC algorithms and also give mathematical explanations on the working of these algorithms. Also we will discuss Elliptic curve in its application in digital signature generation and verification so as to securely transmit the data across diff...
This paper looks at the mathematical concepts that makes up the two most widily used cryptosystems, Elliptic Curve Cryptography and the Rivest-Shamir-Adleman algorithm, to analyze and compare their effectiveness for secure and efficient communication on the internet. Data will be collected and analyzed mainly through quantitative research methods,...
Elliptic Curve Cryptography (ECC) is one of the strongest and most efficient cryptographic techniques in modern cryptography. This paper gives the following introduction: The introduction of cryptography’s development; the introduction of the elliptic curve; the principle of ECC; the horizontal comparison between ECC and other types of cryptography...
![Figure 6. Shows Elliptic Curve Doubling point [20].](publication/374716179/figure/fig4/AS:11431281198338643@1697292876402/Shows-Elliptic-Curve-Doubling-point-20_Q320.jpg)
Encryption is regarded as essential within the safety measures used to protect data via unsafe transport methods. Elliptic Curve encryption (ECC), one of the several asymmetric encryption algorithms currently in use, has become popular because of its high level of security and small key sizes. In contrast to Rivest, Shamir and Adleman (RSA), for in...
This paper develops an asymmetric color image encryption algorithm based on elliptic curve
cryptography(ECC), five dimensions(5D) hyperchaotic system, and DNA dynamic coding. To embed
the characteristics of original image in the image encryption algorithm, this algorithm builds a
mathematical model to strengthen the connection between the original...
Citations
... This includes proper selection of cryptographic parameters, secure implementation of cryptographic primitives, and proper handling of keys and encrypted information. Additionally, it is important to regularly assess the security of this protocol in light of new developments in cryptography and computer science to ensure that it continues to provide a high level of security [20]- [22]. ...
... For example, the application of Cipher Block Chaining (CBC) mode by [29], [33] makes the systems not able to distribute encryption/decryption functionality across processors or cores in multiprocessor or multicore systems. In addition, these systems are also vulnerable to Man-in-the-Middle-Attack (MIMA), Chosen Plaintext Attacks (CPA), and Chosen Ciphertext Attacks (CCA) [34]. ...
... With increased security, it also became better with delays and traffic congestion. The ECC-based scheme proposed for edge computing and the internet of things by [33] is vulnerable to MIMA, CPA, and CCA attacks [34]. In addition, the application of CBC makes it difficult for the scheme to apply a domain decomposition programming model which can efficiently maximize the resources when used for parallelization in multiprocessor/multicore systems. ...
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. Elliptic Curve Diffie-Helman (ECDH) was used for the key exchange algorithm and Elliptic Curve Digital Signature Algorithm (ECDSA) for authentication among the communicating nodes. Security analysis of the model and comparative performance analysis with the existing ones were. The results of the security analysis reveal that the proposed model meets up with the security requirements and resists various security attacks, 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.
