Reducing elliptic curve logarithms to logarithms in a finite field
From MaRDI portal
Publication:4307376
DOI10.1109/18.259647zbMATH Open0801.94011DBLPjournals/tit/MenezesOV93OpenAlexW2111310412WikidataQ56016750 ScholiaQ56016750MaRDI QIDQ4307376FDOQ4307376
Authors: Tatsuaki Okamoto, Scott A. Vanstone, Alfred Menezes 
Publication date: 3 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.259647
Recommendations
finite fieldpublic key cryptographysupersingular elliptic curvesdiscrete logarithmselliptic curve logarithm
Cites Work
- Identity-based cryptosystems and signature schemes
- Practical Identity-Based Encryption Without Random Oracles
- Hierarchical ID-Based Cryptography
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Fuzzy Identity-Based Encryption
- Certificateless public key cryptography
- Oblivious transfer and polynomial evaluation
- Advances in Cryptology - EUROCRYPT 2004
- Reducing elliptic curve logarithms to logarithms in a finite field
- Advances in Cryptology – CRYPTO 2004
- Public Key Cryptography – PKC 2004
- Reducing Trust in the PKG in Identity Based Cryptosystems
- On the Security Loss in Cryptographic Reductions
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
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- 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
- Improving e-payment security using elliptic curve cryptosystem
- Pairing-based cryptography on elliptic curves
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Polynomial approximation of bilinear Diffie-Hellman maps
- Bootstrapping for approximate homomorphic encryption
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Ramanujan's class invariants and their use in elliptic curve cryptography
- On the asymptotic effectiveness of Weil descent attacks
- Return of GGH15: provable security against zeroizing attacks
- Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography
- Algorithms for black-box fields and their application to cryptography
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Constraining pseudorandom functions privately
- Batch RSA
- More Discriminants with the Brezing-Weng Method
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- Towards isogeny-based password-authenticated key establishment
- Extractors for binary elliptic curves
- Supersingular hyperelliptic curves of genus 2 over finite fields
- A brief history of pairings
- Linearizing torsion classes in the Picard group of algebraic curves over finite fields
- A self-pairing map and its applications to cryptography
- On the security of cryptosystem using automorphism groups
- An elliptic curve analogue of McCurley's key agreement scheme
- On the multi-user security of short Schnorr signatures with preprocessing
- Spreading alerts quietly and the subgroup escape problem
- Heuristics of the Cocks-Pinch method
- Isolated elliptic curves and the MOV attack
- Supersingular twisted Edwards curves over prime fields. II: Supersingular twisted Edwards curves with the \(j\)-invariant equal to \(66^3\)
- Supersingular twisted Edwards curves over prime fields. I: Supersingular twisted Edwards curves with \(j\)-invariants equal to zero and \(12^3\)
- Faster pairing computation on genus \(2\) hyperelliptic curves
- On the efficient implementation of pairing-based protocols
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
- Scalable zero knowledge via cycles of elliptic curves
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
- Cryptographic implications of Hess' generalized GHS attack
- A Weil pairing on the \(p\)-torsion of ordinary elliptic curves over \(K[\varepsilon]\)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- The discrete logarithm problem from a local duality perspective
- On the discrete logarithm problem for prime-field elliptic curves
- Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams
- Elliptic curve lifting problem and its applications
- On Random Number Generation for Kernel Applications
- A group key agreement protocol from pairings
- On the signature calculus for finite fields of order square of prime numbers
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
- Still wrong use of pairings in cryptography
- Signcryption with non-interactive non-repudiation
- Extended explicit relations between trace, definition field, and embedding degree
- On near prime-order elliptic curves with small embedding degrees
- Construction of strong elliptic curves suitable for cryptographic applications
- Bitcoin security with a twisted Edwards curve
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Exp function for Edwards curves over local fields
- On the near prime-order MNT curves
- On constructing parameterized families of pairing-friendly elliptic curves with \(\rho =1\)
- A survey on functional encryption
- The relationship between idealized models under computationally bounded adversaries
- On the cryptographic properties of algorithms accompanying the applications of standards GOST R 34.11-2012 and GOST R 34.10-2012
- Embedding finite fields into elliptic curves
- Preventing unknown key-share attack using cryptographic bilinear maps
- Revisiting cycles of pairing-friendly elliptic curves
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- On the efficient generation of prime-order elliptic curves
- К вопросу о сведении вычисления дискретных логарифмов на эллиптической кривой к вычислению дискретных логарифмов в конечном поле
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
- Digital signatures
- Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order
- A NEW BATCH IDENTIFICATION SCHEME
- On the security properties of Russian standardized elliptic curves
- Cryptanalysis of pairing-based cryptosystems over small characteristic fields
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits
- A key escrow-free identity-based signature scheme without using secure channel
- Solving modular cubic equations with Coppersmith's method
- On indifferentiable deterministic hashing into elliptic curves
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Identifying supersingular elliptic curves
- Bandwidth-efficient attribute-based key-insulated signatures with message recovery
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- Using abelian varieties to improve pairing-based cryptography
- Trapdoor DDH groups from pairings and isogenies
- Koblitz curves over quadratic fields
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- Using number fields to compute logarithms in finite fields
- Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- A pairing-based publicly verifiable secret sharing scheme
- Attribute-based key-insulated signature for Boolean formula
- An improved two-party identity-based authenticated key agreement protocol using pairings
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)
