Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves

Beuchat, Jean-Luc; López-Trejo, Emmanuel; Martínez-Ramos, L.; Mitsunari, Shigeo; Rodríguez-Henríquez, Francisco

doi:10.1007/978-3-642-10433-6_28

Cited by 44 publications

(50 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The software implementation results of 128-bit secure pairings computed over different elliptic curves are enlisted in Table 6. The most efficient software for computing 128-bit pairings on supersingular elliptic curves over F 2 1223 is proposed in [7]. It takes 3.08ms on eight parallel cores of a core i7 2.8GHz processor.…”

Section: Comparison With Existing Designsmentioning

confidence: 99%

“…However, to the best of our knowledge there is no hardware implementation results available in the literature which computes 128-bit secure pairings below one ms time limit. Highspeed software implementations reported in [6,7] compute 128-bit secure pairings in 0.832ms and 1.87ms. The work proposed by Beuchat et al [5] describes design architectures for η T pairings on supersingular elliptic curves over characteristic two and three fields for a maximum of 105-bit and 109-bit security, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields

Ghosh

Roychowdhury

Das

2011

Cryptographic Hardware and Embedded Systems – CHES 2011

View full text Add to dashboard Cite

Abstract. This paper presents an efficient architecture for computing cryptographic ηT pairing for providing 128-bit security. A cryptoprocessor is proposed for Miller's Algorithm with a new 1223-bit Karatsuba multiplier that exploits parallelism. To the best of our knowledge this is the first hardware implementation of 128-bit secure ηT pairing on supersingular elliptic curves over characteristic two fields. The design has been implemented on Xilinx FPGAs. The place-and-route results show that the proposed design takes only 190μs to complete an 128-bit secure ηT pairing on a Virtex-6 FPGA. The proposed cryptoprocessor achieves eight times speedup compared to the best known existing design. It also outperforms the previous designs with respect to area × time product.

show abstract

Section: Comparison With Existing Designsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields

Ghosh

Roychowdhury

Das

2011

Cryptographic Hardware and Embedded Systems – CHES 2011

View full text Add to dashboard Cite

show abstract

“…This paper presents IMAKA-Tate, a light-weight identity protection and mutual authentication using Identity-based Encryption (IBE) method. Particularly, it relies on cryptographic Tate (ƞT) pairing over super singular elliptic curves, ternary field [1]. IMAKATate method is tailored to tackle the specific challenges for security and privacy in the constrained nature of smart RFID.…”

Section: Introductionmentioning

confidence: 99%

Efficient Security and Privacy Protection for Emerging Smart RFID Communications

Sadikin¹,

Kyas²

2014

IJNDC

View full text Add to dashboard Cite

Due to its constrained nature, the use of smart RFID technology introduces tremendous security and privacy issues. This paper presents IMAKA-Tate: Identity protection, Mutual Authentication and Key Agreement using Tate pairing of Identity-based Encryption method. It is designed to tackle various challenges in the constrained nature of RFID applications by applying a light-weight cryptographic method with advanced-level 128 bit security protection. Thus, IMAKA-Tate protects the RFID system from various security and privacy threats (e.g. unauthorized tracking, cloning attack, etc.).

show abstract

“…Investigating the extent of parallelizing eta pairing on GPU platforms is an important area of current research. Although several implementations of eta pairing have already been published in the literature [3,5,11], most of them are CPU-based, and aim at improving the performance of single eta-pairing computations. However, many applications (like authentication in vehicular ad hoc networks) requir e computing large numbers of eta pairings in short intervals.…”

Section: Introductionmentioning

confidence: 99%

GPU-Based Implementation of 128-Bit Secure Eta Pairing over a Binary Field

Bose

Bhattacharya

Das

2013

Progress in Cryptology – AFRICACRYPT 2013

View full text Add to dashboard Cite

Abstract. Eta pairing on a supersingular elliptic curve over the binary field F 2 1223 used to offer 128-bit security, and has been studied extensively for efficient implementations. In this paper, we report our GPUbased implementations of this algorithm on an NVIDIA Tesla C2050 platform. We propose efficient parallel implementation strategies for multiplication, square, square root and inverse in the underlying field. Our implementations achieve the best performance when López-Dahab multiplication with four-bit precomputations is used in conjunction with one-level Karatsuba multiplication. We have been able to compute up to 566 eta pairings per second. To the best of our knowledge, ours is the fastest GPU-based implementation of eta pairing. It is about twice as fast as the only reported GPU implementation, and about five times as fast as the fastest reported single-core SIMD implementation. We estimate that the NVIDIA GTX 480 platform is capable of producing the fastest known software implementation of eta pairing.

show abstract

Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves

Cited by 44 publications

References 22 publications

High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields

High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields

Efficient Security and Privacy Protection for Emerging Smart RFID Communications

GPU-Based Implementation of 128-Bit Secure Eta Pairing over a Binary Field

Contact Info

Product

Resources

About