On Efficient Pairings on Elliptic Curves over Extension Fields

Zhang, Xusheng; Wang, Kunpeng; Lin, Dongdai

doi:10.1007/978-3-642-36334-4_1

Cited by 5 publications

(2 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides the binary fields F(2 m ) and prime fields F(p), there has been increased interest in use of Optimal extension fields F(p m ) that offers offer considerable computational advantages in software by selecting p and m specifically to match the underlying hardware used to perform the arithmetic operations. Besides, efficient methods have been devised for speeding up field arithmetic for elliptic curves over general extension fields [46]. The benefits of defining the extension on existing curves are to solve the ECDLP by using the index-calculus methods on the group of rational points.…”

Section: Extension Field Curvesmentioning

confidence: 99%

A Context-Aware Information-Based Clone Node Attack Detection Scheme in Internet of Things

Hameed¹,

Garg²,

Amin³

et al. 2021

Preprint

View full text Add to dashboard Cite

The rapidly expanding nature of the Internet of Things (IoT) networks is beginning to attract interest across a range of applications, including smart homes, smart transportation, smart health, and industrial contexts such as smart robotics. This cutting-edge technology enables individuals to track and control their integrated environment in real-time and remotely via a thousand IoT devices comprised of sensors and actuators that actively participate in sensing, processing, storing, and sharing information. Nonetheless, IoT devices are frequently deployed in hostile environments, wherein adversaries attempt to capture and breach them in order to seize control of the entire network. One such example of potentially malicious behaviour is the cloning of IoT devices, in which an attacker can physically capture the devices, obtain some sensitive information, duplicate the devices, and intelligently deploy them in desired locations to conduct various insider attacks. A device cloning attack on IoT networks is a significant security concern since it allows for selective forwarding, sink-hole, black-hole, and warm-hole attacks. To address this issue, this paper provides an efficient scheme for detecting clone node attack on IoT networks that makes use of semantic information about IoT devices known as context information sensed from the deployed environment to locate them securely. We design the location proof mechanism by combining location proofs and batch verification of the extended elliptic curve digital signature technique (ECDSA*) to accelerate the verification process at selected trusted nodes. We demonstrate the security of our proposed scheme and its resilience to secure clone node attack detection by conducting a comprehensive security analysis of our proposed scheme. The performance analysis and experimental results compared with existing studies suggest that our proposed scheme provides a high degree of detection accuracy with minimal detection time and significantly reduces the computation,

show abstract

Section: Extension Field Curvesmentioning

confidence: 99%

A Context-Aware Information-Based Clone Node Attack Detection Scheme in Internet of Things

Hameed¹,

Garg²,

Amin³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…For some embedding degrees, optimal (twisted) Ate pairing realizes a quite efficient bilinear mapping [10], [13], [31], [32]. The most popular target is of course BN curve whose embedding degree 12 because it is not only efficient but also appropriate for the near future security level.…”

Section: Viewpoint Of Optimal Ate Pairingmentioning

confidence: 99%

FPGA Implementation of Various Elliptic Curve Pairings over Odd Characteristic Field with Non Supersingular Curves

Nogami

Kagotani

Iokibe

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYPairing-based cryptography has realized a lot of innovative cryptographic applications such as attribute-based cryptography and semi homomorphic encryption. Pairing is a bilinear map constructed on a torsion group structure that is defined on a special class of elliptic curves, namely pairing-friendly curve. Pairing-friendly curves are roughly classified into supersingular and non supersingular curves. In these years, non supersingular pairing-friendly curves have been focused on from a security reason. Although non supersingular pairing-friendly curves have an ability to bridge various security levels with various parameter settings, most of software and hardware implementations tightly restrict them to achieve calculation efficiencies and avoid implementation difficulties. This paper shows an FPGA implementation that supports various parameter settings of pairings on non supersingular pairing-friendly curves for which Montgomery reduction, cyclic vector multiplication algorithm, projective coordinates, and Tate pairing have been combinatorially applied. Then, some experimental results with resource usages are shown.

show abstract

Accelerating Beta Weil Pairing with Precomputation and Multi-pairing Techniques

Kinoshita

Suzuki

2020

Advances in Information and Computer Security

View full text Add to dashboard Cite

On Efficient Pairings on Elliptic Curves over Extension Fields

Cited by 5 publications

References 31 publications

A Context-Aware Information-Based Clone Node Attack Detection Scheme in Internet of Things

A Context-Aware Information-Based Clone Node Attack Detection Scheme in Internet of Things

FPGA Implementation of Various Elliptic Curve Pairings over Odd Characteristic Field with Non Supersingular Curves

Accelerating Beta Weil Pairing with Precomputation and Multi-pairing Techniques

Contact Info

Product

Resources

About