Reducing elliptic curve logarithms to logarithms in a finite field

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

• Publication:3476742
• Elliptic Curve Cryptosystems
• scientific article; zbMATH DE number 438988
• Non Supersingular Elliptic Curves for Public Key Cryptosystems

zbMATH Keywords

finite fieldpublic key cryptographysupersingular elliptic curvesdiscrete logarithmselliptic curve logarithm

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52)

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)

• 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
• Extension of elliptic curves on Krasner hyperfields
• Binary Huff Curves
• ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem
• Elliptic curve implementation of zero-knowledge blobs
• An efficient dynamic authenticated key exchange protocol with selectable identities
• Algebraic curves and cryptography
• Pairings in Trusted Computing
• Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
• Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
• Elliptic curve cryptography: the serpentine course of a paradigm shift
• A round-optimal three-party ID-based authenticated key agreement protocol
• Optimal pairing computation over families of pairing-friendly elliptic curves
• A strong provably secure IBE scheme without bilinear map
• Efficient algorithms for Koblitz curves over fields of characteristic three
• Multi-designated verifiers signatures: anonymity without encryption
• Title not available (Why is that?)
• How to construct efficient signcryption schemes on elliptic curves
• Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
• Improved Pollard rho method for computing discrete logarithms over finite extension fields
• The generalized Weil pairing and the discrete logarithm problem on elliptic curves
• The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
• A note on cyclic groups, finite fields, and the discrete logarithm problem
• Efficient encodings to hyperelliptic curves over finite fields
• Provably secure non-interactive key distribution based on pairings
• A threshold signature scheme based on the elliptic curve cryptosystem
• New identity-based society oriented signature schemes from pairings on elliptic curves
• On the embedding degree of reductions of an elliptic curve
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• 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 \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
• A taxonomy of pairing-friendly elliptic curves
• Computation of discrete logarithms in prime fields
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
• Quantum permutation pad for universal quantum-safe cryptography
• Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• Short signatures without random oracles and the SDH assumption in bilinear groups
• An attack on disguised elliptic curves
• Cryptography on elliptic curves over \(p\) -adic number fields
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
• Elliptic curve cryptosystems and their implementation
• Elliptic curves suitable for pairing based cryptography
• Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Uniform encodings to elliptic curves and indistinguishable point representation
• On the \({\ell}\)-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
• Computational hardness of IFP and ECDLP
• Fault-based attack on Montgomery's ladder algorithm
• Further refinement of pairing computation based on Miller's algorithm
• On Cycles of Pairing-Friendly Elliptic Curves
• Elliptic curve cryptosystems in the presence of permanent and transient faults
• A public-key encryption scheme with pseudo-random ciphertexts
• New Constructions and Applications of Trapdoor DDH Groups
• Expander graphs based on GRH with an application to elliptic curve cryptography
• Koblitz curve cryptosystems
• Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems
• Injective encodings to binary ordinary elliptic curves
• Several security schemes constructed using ECC-based self-certified public key cryptosystems
• The Diffie-Hellman problem and generalization of Verheul's theorem
• Elliptic curve discrete logarithm problem over small degree extension fields
• Construction of metrics on the set of elliptic curves over a finite field
• 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

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)