An Analysis of the Vector Decomposition Problem

DOI10.1007/978-3-540-78440-1_18zbMath1162.94359OpenAlexW2128334172WikidataQ61914048 ScholiaQ61914048MaRDI QIDQ5445460

Steven D. Galbraith, Eric R. Verheul

Publication date: 5 March 2008

Published in: Public Key Cryptography – PKC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78440-1_18

zbMATH Keywords

elliptic curvesDiffie-Hellman problemgeneralised discrete logarithm problemVector decomposition problem

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Hyperelliptic curves for the vector decomposition problem over fields of even characteristic ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ Fixed argument pairing inversion on elliptic curves ⋮ Homomorphic Encryption and Signatures from Vector Decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Short signatures from the Weil pairing
• A taxonomy of pairing-friendly elliptic curves
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Easy Decision Diffie-Hellman Groups
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Advances in Elliptic Curve Cryptography
• Abelian varieties over finite fields

This page was built for publication: An Analysis of the Vector Decomposition Problem