An Analysis of the Vector Decomposition Problem

DOI10.1007/978-3-540-78440-1_18MaRDI QIDQ5445460zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Steven D. Galbraith, Eric R. Verheul

Publication date 5 March 2008

Published in Public key cryptography -- PKC 2008. 11th international workshop on practice and theory in public-key cryptography, Barcelona, Spain, March 9--12, 2008. Proceedings (Search for Journal in Brave)

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

zbMATH Keywords

Diffie-Hellman problemelliptic curvesgeneralised discrete logarithm problemVector decomposition problem

Mathematics Subject Classification ID

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

Recommendations

• ANALYSIS OF THE STRONG INSTANCE FOR THE VECTOR DECOMPOSITION PROBLEM
• The vector decomposition problem for elliptic and hyperelliptic curves
• Hyperelliptic curves for the vector decomposition problem over fields of even characteristic
• Homomorphic Encryption and Signatures from Vector Decomposition

Cites work

• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• A taxonomy of pairing-friendly elliptic curves
• Abelian varieties over finite fields
• Advances in Elliptic Curve Cryptography
• Easy Decision Diffie-Hellman Groups
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• scientific article; zbMATH DE number 438988 (Why is no real title available?)
• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 2081083 (Why is no real title available?)
• scientific article; zbMATH DE number 1406786 (Why is no real title available?)
• Short signatures from the Weil pairing
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• The vector decomposition problem for elliptic and hyperelliptic curves

Cited in

(6)

• Hyperelliptic curves for the vector decomposition problem over fields of even characteristic
• The vector decomposition problem for elliptic and hyperelliptic curves
• Homomorphic Encryption and Signatures from Vector Decomposition
• Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
• Fixed argument pairing inversion on elliptic curves
• ANALYSIS OF THE STRONG INSTANCE FOR THE VECTOR DECOMPOSITION PROBLEM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445460)