A new approach of elliptic curve Diffie-Hellman key exchange

Mehibel, Nissa; Hamadouche, M.

doi:10.1109/icee-b.2017.8192159

Cited by 28 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SAP employs Elliptic Curve Cryptography (ECC) to generate and exchange keys, and symmetric encryption scheme to encrypt transmitted messages. ECC is chosen because it has outperformed the existing key generation algorithms such as RSA, owing to its shorter key size and small computational overhead [16]. Short key size makes ECC faster and suitable for small and embedded devices.…”

Section: The Proposed Protocolmentioning

confidence: 99%

SAP: A Secure Low-latency Protocol for Mitigating High Computation Overhead in WI-FI Networks

Jain¹,

Wetzker²,

Laxmi³

et al. 2023

Preprint

View full text Add to dashboard Cite

<p>In this manuscript, we analyze the security offered by existing 802.11 protocols against one of the most basic yet detrimental Evil Twin (ET) attacks. To comprehensively protect Wi-Fi networks against such attacks, vulnerabilities in the IEEE 802.11 specifications were addressed by new and improved security mechanisms. Unfortunately, each of the existing 80 2.11 protocols resulted in a significant increase in communication and computation overhead, making them unsuitable for low latency applications such as health care, intelligent transportation systems, robotics, Industrial Internet of things (IIoT), etc. A protocol is needed which provides optimum security against contemporary network attacks while keeping the latency and overhead maintained. In this work, we propose a secure and low latency protocol known as SAP, which incurs low computation overhead, exchanges less number of messages, does not require any pre shared knowledge, and yet provides end to end security to messages exchanged, making it ideal for embedded and IIoT applications. The protocol is validated using formal verification techniques and experimental simulation.</p>

show abstract

Section: The Proposed Protocolmentioning

confidence: 99%

SAP: A Secure Low-latency Protocol for Mitigating High Computation Overhead in WI-FI Networks

Jain¹,

Wetzker²,

Laxmi³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Basis reduction is a technique for reducing the basis B of a given lattice L to a smaller basis B0 without changing the lattice L. Figure 5 depicts a two-dimensional lattice with two different bases. The basis determinant is shaded, and the right basis is reduced and orthogonal [31,32]. The following are the steps to change the basis while keeping the same lattice.…”

Section: Ecdsa -Disclosing the Private Key Using Lenstra-lenstra-lova...mentioning

confidence: 99%

Research on Elliptic Curve Crypto System with Bitcoin Curves – SECP256k1, NIST256p, NIST521p and LLL

Ulla

Sakkari²

2023

JCSANDM

View full text Add to dashboard Cite

Very recent attacks like ladder leak demonstrated feasibility to recover private key with side channel attacks using just one bit of secret nonce. ECDSA nonce bias can be exploited in many ways. Some attacks on ECDSA involve complicated Fourier analysis and lattice mathematics. In this paper will enable cryptographers to identify efficient ways in which ECDSA can be cracked on curves NIST256p, SECP256k1, NIST521p and weak nonce, kind of attacks that can crack ECDSA and how to protect yourself. Initially we begin with ECDSA signature to sign a message using private key and validate the generated signature using the shared public key. Then we use a nonce or a random value to randomize the generated signature. Every time we sign, a new verifiable random nonce value is created and way in which the intruder can discover the private key if the signer leaks any one of the nonce value. Then we use Lenstra–Lenstra–Lovasz (LLL) method as a black box, we will try to attack signatures generated from bad nonce or bad random number generator (RAG) on NIST256p, SECP256k1 curves. The analysis is performed by considering all the three curves for implementation of Elliptic Curve Digital Signature Algorithm (ECDSA).The comparative analysis for each of the selected curves in terms of computational time is done with leak of nonce and with Lenstra–Lenstra–Lovasz method to crack ECDSA. The average computational costs to break ECDSA with curves NIST256p, NIST521p and SECP256k1 are 0.016, 0.34, 0.46 respectively which is almost to zero depicts the strength of algorithm. The average computational costs to break ECDSA with curves SECP256K1 and NIST256p using LLL are 2.9 and 3.4 respectively.

show abstract

“…RSA, because of shorter key length for similar security levels [83]. Public keys can be used as static or ephemeral, which are not authenticated and temporary [105].…”

Section: A Security During Commissioning Of Secretsmentioning

confidence: 99%

Safety Architecture Proposal for Low-Latency Sensor/Actuator Networks using IO-Link Wireless

2022

View full text Add to dashboard Cite

In the field of production automation, IO-Link Wireless (IOLW) offers energy-efficient and cost-effective solutions for networking wireless sensors and actuators close to the machines on the industrial shop-floor. In this paper, a concept is presented to enhance IOLW with security-for-safety and safety features in order to make safety critical systems in industrial environments with performance characteristics dedicated to demanding applications feasible. As data security is of paramount importance, security mechanisms already implemented in other wireless protocols are investigated and security-for-safety mechanisms for IOLW are introduced. Potential cryptographic algorithms are evaluated for IOLW with respect to energy consumption and timing. Taking performance parameters into account, which are crucial for industrial manufacturing processes, a safety protocol data unit (SPDU) is described and evaluated for different payload length and cycle times. Finally, an outlook towards the implementation of a demonstrator setup completes this work.

show abstract

A new approach of elliptic curve Diffie-Hellman key exchange

Cited by 28 publications

References 7 publications

SAP: A Secure Low-latency Protocol for Mitigating High Computation Overhead in WI-FI Networks

SAP: A Secure Low-latency Protocol for Mitigating High Computation Overhead in WI-FI Networks

Research on Elliptic Curve Crypto System with Bitcoin Curves – SECP256k1, NIST256p, NIST521p and LLL

Safety Architecture Proposal for Low-Latency Sensor/Actuator Networks using IO-Link Wireless

Contact Info

Product

Resources

About