The discrete logarithm problem on elliptic curves of trace one
From MaRDI portal
Publication:1304977
DOI10.1007/s001459900052zbMath0963.11068OpenAlexW2046569422WikidataQ56047758 ScholiaQ56047758MaRDI QIDQ1304977
Publication date: 24 June 2001
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459900052
Related Items
Generating anomalous elliptic curves ⋮ Nonlinearities in elliptic curve authentication ⋮ Bootstrapping for approximate homomorphic encryption ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ On Random Number Generation for Kernel Applications ⋮ Isolated elliptic curves and the MOV attack ⋮ Multiplication polynomials for elliptic curves over finite local rings ⋮ A survey of elliptic curves for proof systems ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ DiSSECT: distinguisher of standard and simulated elliptic curves via traits ⋮ Weak instances of class group action based cryptography via self-pairings ⋮ Elliptic loops ⋮ Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ Group structure of elliptic curves over \(\mathbb{Z}/N\mathbb{Z}\) ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ A Weil pairing on the \(p\)-torsion of ordinary elliptic curves over \(K[\varepsilon\)] ⋮ Elliptic curve lifting problem and its applications ⋮ Computational hardness of IFP and ECDLP ⋮ Amicable Pairs and Aliquot Cycles for Elliptic Curves ⋮ Algebraic curves and cryptography ⋮ Improving e-payment security using elliptic curve cryptosystem ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem ⋮ Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? ⋮ Cryptographic implications of Hess' generalized GHS attack ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ On the asymptotic effectiveness of Weil descent attacks ⋮ Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem ⋮ Construction of strong elliptic curves suitable for cryptographic applications ⋮ Expander graphs based on GRH with an application to elliptic curve cryptography ⋮ Lifting and Elliptic Curve Discrete Logarithms ⋮ Strong Forward Security in Identity-Based Signcryption ⋮ Bitcoin security with a twisted Edwards curve
