Secure bilinear Diffie-Hellman bits

DOI10.1007/978-3-540-27800-9_32MaRDI QIDQ5315276zbMATH OpenOpenAlexDBLPFDO

Authors Steven D. Galbraith, Herbie J. Hopkins, Igor E. Shparlinski

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98755, http://hdl.handle.net/2292/26662

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the bit security of elliptic curve Diffie-Hellman
• Identity-Based Encryption from the Weil Pairing
• Cryptography and Coding
• Pairing‐Based Cryptography
• An introduction to pairing-based cryptography

Cited in

(8)

• Computing pairings using x-coordinates only
• Batch Diffie-Hellman key agreement systems
• Secure simultaneous bit extraction from Koblitz curves
• Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
• Polynomial approximation of bilinear Diffie-Hellman maps
• The geometry of provable security: some proofs of security in which lattices make a surprise appearance
• A hidden number problem in small subgroups
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

This page was built for publication: Secure bilinear Diffie-Hellman bits

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