Evidence that XTR is more secure than supersingular elliptic curve cryptosystems

DOI10.1007/s00145-004-0313-xzbMath1075.94011OpenAlexW2101458679MaRDI QIDQ1772226

Eric R. Verheul

Publication date: 15 April 2005

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-004-0313-x

zbMATH Keywords

Supersingular elliptic curvesDiffie-Hellman problemsInverting MOV embeddingXTR public key systems

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (25)

Pairing-based cryptography on elliptic curves ⋮ Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Trapdoor DDH groups from pairings and isogenies ⋮ XTR Algorithm: Efficient and Compact Subgroup Trace Representation ⋮ Cryptanalysis of Pairing-Based Cryptosystems Over Small Characteristic Fields ⋮ Shorter identity-based encryption via asymmetric pairings ⋮ Efficiently Computable Distortion Maps for Supersingular Curves ⋮ Elliptic curves withj= 0,1728 and low embedding degree ⋮ An improved two-party identity-based authenticated key agreement protocol using pairings ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Heuristics of the Cocks-Pinch method ⋮ Design of improved password authentication and update scheme based on elliptic curve cryptography ⋮ Algebraic curves and cryptography ⋮ Efficient Compression of SIDH Public Keys ⋮ On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ The Hidden Root Problem ⋮ Pairing Computation on Twisted Edwards Form Elliptic Curves ⋮ Revisiting Pairing Based Group Key Exchange ⋮ An Analysis of the Vector Decomposition Problem ⋮ The Diffie-Hellman problem and generalization of Verheul's theorem ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ A Killer Application for Pairings: Authenticated Key Establishment in Underwater Wireless Sensor Networks ⋮ Compact hierarchical identity-based encryption based on a harder decisional problem

This page was built for publication: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems