Reducing elliptic curve logarithms to logarithms in a finite field
From MaRDI portal
Publication:4307376
Recommendations
Cites work
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Certificateless public key cryptography
- Efficient Identity-Based Encryption Without Random Oracles
- Fuzzy Identity-Based Encryption
- Hierarchical ID-Based Cryptography
- Identity-based cryptosystems and signature schemes
- Oblivious transfer and polynomial evaluation
- On the Security Loss in Cryptographic Reductions
- Practical Identity-Based Encryption Without Random Oracles
- Public Key Cryptography – PKC 2004
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Reducing elliptic curve logarithms to logarithms in a finite field
Cited in
(only showing first 100 items - show all)- Efficient Tate pairing computation using double-base chains
- New designing of cryptosystems based on quadratic fields
- On indifferentiable deterministic hashing into elliptic curves
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- A group key agreement protocol from pairings
- Construction of metrics on the set of elliptic curves over a finite field
- Identifying supersingular elliptic curves
- Bandwidth-efficient attribute-based key-insulated signatures with message recovery
- On Random Number Generation for Kernel Applications
- Using abelian varieties to improve pairing-based cryptography
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- On the signature calculus for finite fields of order square of prime numbers
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- Trapdoor DDH groups from pairings and isogenies
- Koblitz curves over quadratic fields
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Weakness in ID-based one round authenticated tripartite multiple-key agreement protocol with pairings
- Nonassociative algebraic structures in cryptography and coding
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
- Improving e-payment security using elliptic curve cryptosystem
- Still wrong use of pairings in cryptography
- Using number fields to compute logarithms in finite fields
- A pairing-based publicly verifiable secret sharing scheme
- Signcryption with non-interactive non-repudiation
- Extended explicit relations between trace, definition field, and embedding degree
- Pairing-based cryptography on elliptic curves
- On near prime-order elliptic curves with small embedding degrees
- Reducing elliptic curve logarithms to logarithms in a finite field
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
- An improved two-party identity-based authenticated key agreement protocol using pairings
- Attribute-based key-insulated signature for Boolean formula
- ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem
- Extension of elliptic curves on Krasner hyperfields
- Binary Huff Curves
- Elliptic curve implementation of zero-knowledge blobs
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- An efficient dynamic authenticated key exchange protocol with selectable identities
- Bootstrapping for approximate homomorphic encryption
- Polynomial approximation of bilinear Diffie-Hellman maps
- A round-optimal three-party ID-based authenticated key agreement protocol
- Optimal pairing computation over families of pairing-friendly elliptic curves
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Ramanujan's class invariants and their use in elliptic curve cryptography
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Pairings in Trusted Computing
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- A strong provably secure IBE scheme without bilinear map
- Algebraic curves and cryptography
- Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
- Construction of strong elliptic curves suitable for cryptographic applications
- Efficient algorithms for Koblitz curves over fields of characteristic three
- On the asymptotic effectiveness of Weil descent attacks
- Multi-designated verifiers signatures: anonymity without encryption
- Bitcoin security with a twisted Edwards curve
- Return of GGH15: provable security against zeroizing attacks
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography
- How to construct efficient signcryption schemes on elliptic curves
- scientific article; zbMATH DE number 697834 (Why is no real title available?)
- Algorithms for black-box fields and their application to cryptography
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
- On the near prime-order MNT curves
- Constraining pseudorandom functions privately
- On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields
- Batch RSA
- Exp function for Edwards curves over local fields
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- A survey on functional encryption
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- The relationship between idealized models under computationally bounded adversaries
- Towards isogeny-based password-authenticated key establishment
- On the cryptographic properties of algorithms accompanying the applications of standards GOST R 34.11-2012 and GOST R 34.10-2012
- More Discriminants with the Brezing-Weng Method
- A note on cyclic groups, finite fields, and the discrete logarithm problem
- The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
- Extractors for binary elliptic curves
- Provably secure non-interactive key distribution based on pairings
- Efficient encodings to hyperelliptic curves over finite fields
- Preventing unknown key-share attack using cryptographic bilinear maps
- Embedding finite fields into elliptic curves
- A threshold signature scheme based on the elliptic curve cryptosystem
- New identity-based society oriented signature schemes from pairings on elliptic curves
- Supersingular hyperelliptic curves of genus 2 over finite fields
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- On the embedding degree of reductions of an elliptic curve
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- Revisiting cycles of pairing-friendly elliptic curves
- Guest editorial: Special issue in honor of Scott A. Vanstone
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- The Q-curve construction for endomorphism-accelerated elliptic curves
- A taxonomy of pairing-friendly elliptic curves
- Computation of discrete logarithms in prime fields
- On the efficient generation of prime-order elliptic curves
- К вопросу о сведении вычисления дискретных логарифмов на эллиптической кривой к вычислению дискретных логарифмов в конечном поле
This page was built for publication: Reducing elliptic curve logarithms to logarithms in a finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307376)
