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)- Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
- Quantum permutation pad for universal quantum-safe cryptography
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- A brief history of pairings
- Linearizing torsion classes in the Picard group of algebraic curves over finite fields
- On the security of cryptosystem using automorphism groups
- A self-pairing map and its applications to cryptography
- Short signatures without random oracles and the SDH assumption in bilinear groups
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Cryptography on elliptic curves over \(p\) -adic number fields
- Elliptic curve cryptosystems and their implementation
- An attack on disguised elliptic curves
- An elliptic curve analogue of McCurley's key agreement scheme
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Elliptic curves suitable for pairing based cryptography
- On the multi-user security of short Schnorr signatures with preprocessing
- Spreading alerts quietly and the subgroup escape problem
- Isolated elliptic curves and the MOV attack
- Heuristics of the Cocks-Pinch method
- Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
- Digital signatures
- 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
- A NEW BATCH IDENTIFICATION SCHEME
- Supersingular twisted Edwards curves over prime fields. II: Supersingular twisted Edwards curves with the j-invariant equal to 66³
- Supersingular twisted Edwards curves over prime fields. I: Supersingular twisted Edwards curves with \(j\)-invariants equal to zero and \(12^3\)
- On the security properties of Russian standardized elliptic curves
- Faster pairing computation on genus 2 hyperelliptic curves
- On the efficient implementation of pairing-based protocols
- Uniform encodings to elliptic curves and indistinguishable point representation
- 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
- 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
- Cryptanalysis of pairing-based cryptosystems over small characteristic fields
- A Weil pairing on the \(p\)-torsion of ordinary elliptic curves over \(K[\varepsilon]\)
- Cryptographic implications of Hess' generalized GHS attack
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Further refinement of pairing computation based on Miller's algorithm
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits
- The discrete logarithm problem from a local duality perspective
- Elliptic curve cryptosystems in the presence of permanent and transient faults
- On Cycles of Pairing-Friendly Elliptic Curves
- On the discrete logarithm problem for prime-field elliptic curves
- 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
- A key escrow-free identity-based signature scheme without using secure channel
- Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams
- Injective encodings to binary ordinary elliptic curves
- Elliptic curve lifting problem and its applications
- Several security schemes constructed using ECC-based self-certified public key cryptosystems
- Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems
- The Diffie-Hellman problem and generalization of Verheul's theorem
- Solving modular cubic equations with Coppersmith's method
- Elliptic curve discrete logarithm problem over small degree extension fields
- 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
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)
