Efficient Self-pairing on Ordinary Elliptic Curves

Wu, Hongyan; Feng, Rongquan

doi:10.1007/978-3-642-38236-9_26

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

2015

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Later this idea also has been generalized to the hyper elliptic curves [19]. The author of [20] and [21] proposed the efficient self-pairings on ordinary elliptic curves and self pairings on supersingular elliptic curves with embedding degree 3 respectively.…”

Section: Introductionmentioning

confidence: 99%

Efficient Signature Scheme From Self-Pairing on Elliptic Curves

Kumar¹,

Pal²,

Arvind³

2015

Int. J. of Pure and Appl. Math.

View full text Add to dashboard Cite

A Self-pairing e s (P, P ) is a special subclass of bilinear pairing where both input points in a group are equal. Self-pairings have some interesting applications in cryptographic scheme and protocols. Recently some novel methods for constructing self-pairings on supersingular elliptic curves have been proposed. In this paper we first give the construction of self-pairings on some supersingular elliptic curves. We will show that the proposed self pairings are efficient than the general pairings on the corresponding curves. Secondly, we present a digital signature scheme from self-pairing on elliptic curves. We also show that the signature scheme from self-pairing is more efficient than the previous one.

show abstract

Section: Introductionmentioning

confidence: 99%