scientific article; zbMATH DE number 1689862
From MaRDI portal
Publication:2763028
Recommendations
- scientific article; zbMATH DE number 4081719
- Reductions of an elliptic curve with almost prime orders
- Reduction of elliptic curves over certain real quadratic number fields
- Reductions of points on elliptic curves
- On the mod p reductions of an elliptic curve
- On the embedding degree of reductions of an elliptic curve
- A note on elliptic curves with ordinary reduction
- Distribution of the traces of Frobenius on elliptic curves over function fields
- scientific article; zbMATH DE number 2246192
- Elliptic curves with everywhere good reduction
Cited in
(40)- Pairing-based cryptography on elliptic curves
- Scalable zero knowledge via cycles of elliptic curves
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- An optimal Tate pairing computation using Jacobi quartic elliptic curves
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- A taxonomy of pairing-friendly elliptic curves
- Extended dual system group and shorter unbounded hierarchical identity based encryption
- On the near prime-order MNT curves
- CCA updatable encryption against malicious re-encryption attacks
- Faster hashing to \({\mathbb G}_2\)
- Extended explicit relations between trace, definition field, and embedding degree
- Efficient statically-secure large-universe multi-authority attribute-based encryption
- Application of differential cryptography to a GN authentication hierarchy scheme
- On constructing parameterized families of pairing-friendly elliptic curves with =1
- The complexity of class polynomial computation via floating point approximations
- On the efficient implementation of pairing-based protocols
- On constructing families of pairing-friendly elliptic curves with variable discriminant
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Fast Hashing to G 2 on Pairing-Friendly Curves
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
- Shorter identity-based encryption via asymmetric pairings
- Provably-secure time-bound hierarchical key assignment schemes
- scientific article; zbMATH DE number 1406766 (Why is no real title available?)
- A brief history of pairings
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
- Real Hidden Identity-Based Signatures
- On the efficient generation of prime-order elliptic curves
- ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN CLASS INVARIANTS
- A survey of elliptic curves for proof systems
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits
- Revisiting cycles of pairing-friendly elliptic curves
- Pairings in rank-1 constraint systems
- Fuzzy perspective of online games by using cryptography and cooperative game theory
- Families of prime-order endomorphism-equipped embedded curves on pairing-friendly curves
- On cycles of pairing-friendly abelian varieties
- On pairs of primes with small order reciprocity
- Cycles of supersingular elliptic curves for pairing-based proof systems
- A comparison of MNT curves and supersingular curves
- Key continual-leakage resilient broadcast cryptosystem from dual system in broadcast networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763028)
