Implementing the Tate pairing
From MaRDI portal
Recommendations
Cited in
(60)- An improved identity-based key agreement protocol and its security proof
- On the relationship between squared pairings and plain pairings
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Scalable zero knowledge via cycles of elliptic curves
- Efficient algorithms for Koblitz curves over fields of characteristic three
- On the distribution of irreducible trinomials over \(\mathbb F_3\)
- Further refinement of pairing computation based on Miller's algorithm
- Efficient pairing computation on supersingular abelian varieties
- Ordinary Abelian varieties having small embedding degree
- Generating more MNT elliptic curves
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Certificateless signature and proxy signature schemes from bilinear pairings
- Several security schemes constructed using ECC-based self-certified public key cryptosystems
- Efficient three-party authenticated key agreement protocol in certificateless cryptography
- Subgroup security in pairing-based cryptography
- An analysis of affine coordinates for pairing computation
- Efficient Algorithm for Tate Pairing of Composite Order
- On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
- Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks
- Implementing cryptographic pairings
- Identity-based authenticated key agreement protocol based on Weil pairing
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Secure and Efficient Group Key Agreements for Cluster Based Networks
- On Software Parallel Implementation of Cryptographic Pairings
- Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves
- An improved two-party identity-based authenticated key agreement protocol using pairings
- Provably secure three-party password-based authenticated key exchange protocol
- Efficient algorithms for pairing-based cryptosystems
- Efficient computations of the Tate pairing for the large MOV degrees
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- Easy Decision Diffie-Hellman Groups
- Boneh-Franklin IBE
- A mechanical approach to derive identity-based protocols from Diffie-Hellman-based protocols
- Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing
- Optimised Versions of the Ate and Twisted Ate Pairings
- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
- Topics in Cryptology – CT-RSA 2005
- Information Security and Cryptology - ICISC 2003
- Efficient compression of SIDH public keys
- Algebraic curves and cryptography
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- Chosen ciphertext secure authenticated group communication using identity-based signcryption
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
- Generic construction of trace-and-revoke inner product functional encryption
- An efficient dynamic authenticated key exchange protocol with selectable identities
- Zero-knowledge identification scheme based on Weil pairing
- Fuzzy perspective of online games by using cryptography and cooperative game theory
- Private key agreement and secure communication for heterogeneous sensor networks
- The Tate profile
- Biextensions in pairing-based cryptography
- Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode
- Efficient hardware implementation of finite fields with applications to cryptography
- A comparison of MNT curves and supersingular curves
- Formulas for cube roots in \(\mathbb F_{3^m}\)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- Non-interactive identity-based threshold signature scheme without random oracles
- Efficient Tate pairing computation using double-base chains
This page was built for publication: Implementing the Tate pairing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737495)
