scientific article; zbMATH DE number 1221897

zbMath1044.11591MaRDI QIDQ4217446

Kiyomichi Araki, Takakazu Satoh

Publication date: 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Elliptic curves over local fields (11G07)

Related Items (23)

Multiplication polynomials for elliptic curves over finite local rings ⋮ 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 ⋮ Group structure of elliptic curves over \(\mathbb{Z}/N\mathbb{Z}\) ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Fault-based attack on Montgomery's ladder algorithm ⋮ Elliptic curve lifting problem and its applications ⋮ Computational hardness of IFP and ECDLP ⋮ Algebraic curves and cryptography ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? ⋮ Cryptographic implications of Hess' generalized GHS attack ⋮ Ramanujan's class invariants and their use in elliptic curve cryptography ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order ⋮ On the efficient generation of prime-order elliptic curves ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem ⋮ Construction of strong elliptic curves suitable for cryptographic applications ⋮ Lifting and Elliptic Curve Discrete Logarithms ⋮ Bitcoin security with a twisted Edwards curve

This page was built for publication: