Aggregated path authentication for efficient BGP security
Proceedings of the 12th ACM conference on Computer and communications security
On the relationship between squared pairings and plain pairings
Information Processing Letters
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Special polynomial families for generating more suitable pairing-friendly elliptic curves
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Information Sciences: an International Journal
An efficient session key generation for NTDR networks based on bilinear paring
Computer Communications
A Secure IPv6-based Urban Wireless Mesh Network (SUMNv6)
Computer Communications
Efficient Certificateless Signature Schemes
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field
Journal of Systems Architecture: the EUROMICRO Journal
Efficient pth root computations in finite fields of characteristic p
Designs, Codes and Cryptography
Secure-TWS: Authenticating node to multi-user communication in shared sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Faster Pairings on Special Weierstrass Curves
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
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 the relationship between squared pairings and plain pairings
Information Processing Letters
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
New software speed records for cryptographic 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
An analysis of affine coordinates for pairing computation
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A variant of Miller's formula and algorithm
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Enhanced Certificate-Based Encryption from pairings
Computers and Electrical Engineering
A p2p market place based on aggregate signatures
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
A new method of building more non-supersingular elliptic curves
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
ID-based authenticated key agreement for low-power mobile devices
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
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
Side channel attacks and countermeasures on pairing based cryptosystems over binary fields
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
High-speed parallel software implementation of the ηT pairing
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Refinement of miller's algorithm over edwards curves
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Pairing-Friendly elliptic curves of prime order
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
On the efficient implementation of pairing-based protocols
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Algebraic curves and cryptography
Finite Fields and Their Applications
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Remarks on Cheon's algorithms for pairing-related problems
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Traitor tracing with optimal transmission rate
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
Pairing-based cryptosystems rely on the existence of bilinear, nondegenerate, efficiently computable maps (called pairings) over certain groups. Currently, all such pairings used in practice are related to the Tate pairing on elliptic curve groups whose embedding degree is large enough to maintain a good security level, but small enough for arithmetic operations to be feasible. In this paper we describe how to construct ordinary (non-supersingular) elliptic curves containing groups with arbitrary embedding degree, and show how to compute the Tate pairing on these groups efficiently.