Pages that link to "Item:Q4307376"

The following pages link to Reducing elliptic curve logarithms to logarithms in a finite field (Q4307376):

Displaying 50 items.

• How to construct efficient signcryption schemes on elliptic curves (Q293455) (← links)
• The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves (Q321311) (← links)
• An improved two-party identity-based authenticated key agreement protocol using pairings (Q414861) (← links)
• A round-optimal three-party ID-based authenticated key agreement protocol (Q425537) (← links)
• Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
• Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
• On the \({\ell}\)-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\) (Q501160) (← links)
• Computational hardness of IFP and ECDLP (Q505664) (← links)
• A pairing-based publicly verifiable secret sharing scheme (Q545465) (← links)
• ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem (Q556108) (← links)
• The generalized Weil pairing and the discrete logarithm problem on elliptic curves (Q596141) (← links)
• An efficient dynamic authenticated key exchange protocol with selectable identities (Q639064) (← links)
• Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510) (← links)
• The Diffie-Hellman problem and generalization of Verheul's theorem (Q735041) (← links)
• A strong provably secure IBE scheme without bilinear map (Q743115) (← links)
• Uniform encodings to elliptic curves and indistinguishable point representation (Q782846) (← links)
• Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology (Q814764) (← links)
• Trapdoor DDH groups from pairings and isogenies (Q832364) (← links)
• Multi-designated verifiers signatures: anonymity without encryption (Q845986) (← links)
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
• Cryptanalysis of tripartite and multi-party authenticated key agreement protocols (Q867668) (← links)
• Guest editorial: Special issue in honor of Scott A. Vanstone (Q887413) (← links)
• Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
• A Weil pairing on the \(p\)-torsion of ordinary elliptic curves over \(K[\varepsilon]\) (Q927739) (← links)
• Efficient Tate pairing computation using double-base chains (Q954437) (← links)
• New designing of cryptosystems based on quadratic fields (Q954438) (← links)
• Improving e-payment security using elliptic curve cryptosystem (Q968357) (← links)
• Ramanujan's class invariants and their use in elliptic curve cryptography (Q988264) (← links)
• On the embedding degree of reductions of an elliptic curve (Q989443) (← links)
• Extractors for binary elliptic curves (Q1009079) (← links)
• Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← links)
• Linearizing torsion classes in the Picard group of algebraic curves over finite fields (Q1024380) (← links)
• Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
• On the security of cryptosystem using automorphism groups (Q1029031) (← links)
• Computation of discrete logarithms in prime fields (Q1179517) (← links)
• Elliptic curve implementation of zero-knowledge blobs (Q1180510) (← links)
• A note on cyclic groups, finite fields, and the discrete logarithm problem (Q1196516) (← links)
• Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
• Batch RSA (Q1363068) (← links)
• Pairing-based cryptography on elliptic curves (Q1616164) (← links)
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
• Return of GGH15: provable security against zeroizing attacks (Q1631349) (← links)
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
• Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
• Isolated elliptic curves and the MOV attack (Q1676235) (← links)
• Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
• Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
• Injective encodings to binary ordinary elliptic curves (Q1726692) (← links)