Publication:4737495
From MaRDI portal
zbMath1058.11072MaRDI QIDQ4737495
Steven D. Galbraith, Keith E. Harrison, David Soldera
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2369/23690324.htm
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11G05: Elliptic curves over global fields
11Y16: Number-theoretic algorithms; complexity
Related Items
Easy Decision Diffie-Hellman Groups, Optimised Versions of the Ate and Twisted Ate Pairings, Algebraic curves and cryptography, An improved two-party identity-based authenticated key agreement protocol using pairings, Provably secure three-party password-based authenticated key exchange protocol, The generalized Weil pairing and the discrete logarithm problem on elliptic curves, Chosen ciphertext secure authenticated group communication using identity-based signcryption, An efficient dynamic authenticated key exchange protocol with selectable identities, Zero-knowledge identification scheme based on Weil pairing, Private key agreement and secure communication for heterogeneous sensor networks, 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, An improved identity-based key agreement protocol and its security proof, On the relationship between squared pairings and plain pairings, 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, 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, An Analysis of Affine Coordinates for Pairing Computation, Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks, 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
