Cryptography and Coding
From MaRDI portal
Publication:5897510
DOI10.1007/11586821zbMATH Open1122.94038OpenAlexW2619930404MaRDI QIDQ5897510FDOQ5897510
Authors: Neal Koblitz, Alfred Menezes 
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11586821
Recommendations
Cited In (64)
- There is no safe pairing function over an arbitrary structure
- On cycles of pairing-friendly abelian varieties
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Applications of elliptic curve pairings in cryptography
- Using abelian varieties to improve pairing-based cryptography
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon’s Algorithm
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
- Computing bilinear pairings on elliptic curves with automorphisms
- Batch verification of short signatures
- Secure and Efficient Pairing at 256-Bit Security Level
- Title not available (Why is that?)
- Searching BN curves for SM9
- Still wrong use of pairings in cryptography
- What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?
- Pairing-based cryptography on elliptic curves
- On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one
- Security Analysis of the Strong Diffie-Hellman Problem
- Choosing and generating parameters for pairing implementation on BN curves
- Efficient optimal ate pairing at 128-bit security level
- Pairings in Trusted Computing
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- ECM on Graphics Cards
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- Optimised Versions of the Ate and Twisted Ate Pairings
- The pairing computation on Edwards curves
- Algorithmic Number Theory
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Updating key size estimations for pairings
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- A comparison of MNT curves and supersingular curves
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- Efficient self-pairing on ordinary elliptic curves
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
- Improving the computation of the optimal ate pairing for a high security level
- Another Approach to Pairing Computation in Edwards Coordinates
- On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
- SEMD: secure and efficient message dissemination with policy enforcement in VANET
- Discrete logarithm problems with auxiliary inputs
- Parallelizing the Weil and Tate pairings
- A taxonomy of pairing-friendly elliptic curves
- A brief history of pairings
- Faster hashing to \({\mathbb G}_2\)
- Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
- Efficient implementation of pairing-based cryptosystems
- Efficient algorithms for secure outsourcing of bilinear pairings
- Heuristics of the Cocks-Pinch method
- Pairing computation on Edwards curves with high-degree twists
- On Software Parallel Implementation of Cryptographic Pairings
- The number field sieve for integers of low weight
- Guide to pairing-based cryptography
- Faster Pairings on Special Weierstrass Curves
- On the relationship between squared pairings and plain pairings
- On the efficient implementation of pairing-based protocols
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- Efficient multiplication in finite field extensions of degree 5
- Title not available (Why is that?)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Information Security and Privacy
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
- Keyword-Based Delegable Proofs of Storage
- The Diffie-Hellman problem and generalization of Verheul's theorem
This page was built for publication: Cryptography and Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897510)
