Optimised versions of the ate and twisted ate pairings

Authors:
Seiichi Matsuda;Naoki Kanayama;Florian Hess;Eiji Okamoto
Affiliations:
University of Tsukuba, Japan;University of Tsukuba, Japan;Technische Universität Berlin, Germany;University of Tsukuba, Japan
Venue:
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Year:
2007

Citing 11
Cited 20

Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
The Weil Pairing, and Its Efficient Calculation

Journal of Cryptology
Efficient pairing computation on supersingular Abelian varieties

Designs, Codes and Cryptography
Full-domain subgroup hiding and constant-size group signatures

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Implementing cryptographic pairings on smartcards

CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Compact group signatures without random oracles

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Pairing-Based cryptography at high security levels

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Pairing-Friendly elliptic curves of prime order

SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
The Eta Pairing Revisited

IEEE Transactions on Information Theory

Pairing Lattices

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Integer Variable Χ---Based Ate Pairing

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Skew Frobenius Map and Efficient Scalar Multiplication for Pairing---Based Cryptography

CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
All Pairings Are in a Group

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Improved Implementations of Cryptosystems Based on Tate Pairing

ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Faster Pairings on Special Weierstrass Curves

Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Efficient and generalized pairing computation on Abelian varieties

IEEE Transactions on Information Theory
Cross twisted Xate pairing with Barreto-Naehrig curve for multi-pairing technique

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On compressible pairings and their computation

AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Optimal pairings

IEEE Transactions on Information Theory
Accelerating twisted ate pairing with frobenius map, small scalar multiplication, and multi-pairing

ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Fixed argument pairings

LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Delaying mismatched field multiplications in pairing computations

WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Computing bilinear pairings on elliptic curves with automorphisms

Designs, Codes and Cryptography
Another elliptic curve model for faster pairing computation

ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
A method for efficient parallel computation of Tate pairing

International Journal of Grid and Utility Computing
Faster pairing computations on curves with high-degree twists

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Avoiding full extension field arithmetic in pairing computations

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa

Quantified Score

Hi-index	0.12

Visualization

Abstract

We observe a natural generalisation of the ate and twisted ate pairings, which allow for performance improvements in non standard applications of pairings to cryptography like composite group orders. We also give a performance comparison of our pairings and the Tate, ate and twisted ate pairings for certain polynomial families based on operation count estimations and on an implementation, showing that our pairings can achieve a speedup of a factor of up to two over the other pairings.