Effects of Instruction-Set Extensions on an Embedded Processor: A Case Study on Elliptic Curve Cryptography over GF(2/sup m/)

Bartolini, Sandro; Branovic, Irina; Giorgi, Roberto; Martinelli, Enrico

doi:10.1109/tc.2007.70832

Cited by 15 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is 44% faster than Karatsuba's method, which was employed in [40]. The result is particularly interesting because it contrasts sharply with results presented in [41], which claims that Karatsuba's is the most appropriate method for embedded devices. Besides the cryptographic code, a node needs to store its private key and public parameters in order to run ID-NIKDS.…”

Section: B Performancementioning

confidence: 71%

TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks

Oliveira

Aranha

Gouvêa

et al. 2011

Computer Communications

171

View full text Add to dashboard Cite

Abstract-Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between resilience and storage. Further, even though conventional public key and elliptic curve cryptosystems are computationally feasible on sensor nodes, protocols based on them are not. They require exchange and storage of large keys and certificates, which is expensive. Using Pairing-based Cryptography (PBC) protocols, conversely, parties can agree on keys without any interaction. In this work, we (i) show how security in WSNs can be bootstrapped using an authenticated identitybased non-interactive protocol and (ii) present TinyPBC, to our knowledge, the most efficient implementation of PBC primitives for an 8-bit processor. TinyPBC is able to compute pairings in about 5.5s on an ATmega128L clocked at 7.3828-MHz (the MICA2 and MICAZ node microcontroller).

show abstract

Section: B Performancementioning

confidence: 71%

TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks

Oliveira

Aranha

Gouvêa

et al. 2011

Computer Communications

171

View full text Add to dashboard Cite

show abstract

“…This process distinguishes it from other cryptography techniques. The use of an elliptic curve over a Galois field (GF ()) enhances computational efficiency and reduces complexities related to rounding errors [33]. GF (Q)'s values must exceed 1.…”

Section: A Low Complexity Elliptic Galois Cryptographymentioning

confidence: 99%

“…The encrypted data is hidden using the Optimal Matrix based XOR (OM-XOR) technique [34]. The image blocks are optimized through the ZSADE optimization algorithm, which selects the block from the complete image to conceal the data [33]. The following steps are involved in completing the process.…”

Section: Optimal Matrix Based Xormentioning

confidence: 99%

EGCrypto: A Low-Complexity Elliptic Galois Cryptography Model for Secure Data Transmission in IoT

Kaur¹,

AlZubi

Walia

et al. 2023

IEEE Access

View full text Add to dashboard Cite

In recent years, data security has been a challenging endeavor, especially when the data is being transmitted every second. Internet of Things (IoT) involves continuously sending data over public networks, making the data vulnerable to various security threats. Therefore, ensuring the secure end-to-end communication of IoT data is critical. Cryptography and steganography have proven effective in providing secure connectivity for IoT devices. However, challenges in existing approaches include scalability, computational complexity, implementation, key management, trade-offs, evolving threats, and hyperparameter tuning. Therefore, in this paper, we propose EGCrypto, an efficient and secure model for IoT networks. EGCrypto utilizes a low-complexity elliptic Galois cryptography approach along with matrix XOR steganography to enhance security. To optimize its performance, we employ the zoning evolution of control attributes and adaptive mutation based self-adaptive differential evolution with fitness and diversity ranking. These techniques are utilized to fine-tune the hyperparameters of EGCrypto, enhancing its effectiveness and efficiency. The confidential IoT data is encrypted using low-complexity elliptic Galois cryptography. Following encryption, the encrypted data is embedded or hidden into cover blocks of an image, which are selected using the optimization algorithm. This ensures secure data communication in IoT architectures, as the encrypted data is transferred safely and can be easily recovered and decrypted at the receiving end. The experimental results demonstrate that EGCrypto outperforms competitive models with improvements of 1.8473% in peak signal to noise ratio (PSNR), 1.5490% in strutural similarity index metric (SSIM), 1.7682% in normalized root mean square error (NRMSE), 1.3829% in carrier capacity, and 1.9372% in embedding efficiency.

show abstract

“…Some of the biggest challenges in the field of wireless communication are to provide a high security for various application services, to reduce power consummation of various processes and low bandwidth usage for communication media [2]. So it is very important to find out suitable asymmetric key cryptosystem to offer the same.…”

Section: Introductionmentioning

confidence: 99%

Optimizing point Doubling Operations in ECC Zp

Sakthivel¹,

Nedunchezhian²

2012

IJCA

View full text Add to dashboard Cite

Today a wireless network has minimum power consume and less security access. Based on these the suitable way of providing a security system for wireless application is to select the Elliptic Curve Cryptography. But this public key cryptography has required more number of clock cycles to compute its point operations. One of the point operations called point multiplication requires a lot of clock cycles to compute result. This proposed technique reduces the number of clock cycles of point multiplication for parallel processing by reducing number of dependent and independent operations. General TermsWireless network,security system and dependent and independent operations.

show abstract

Effects of Instruction-Set Extensions on an Embedded Processor: A Case Study on Elliptic Curve Cryptography over GF(2/sup m/)

Cited by 15 publications

References 26 publications

TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks

TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks

EGCrypto: A Low-Complexity Elliptic Galois Cryptography Model for Secure Data Transmission in IoT

Optimizing point Doubling Operations in ECC Zp

Contact Info

Product

Resources

About