Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys

DOI10.1007/978-3-540-85174-5_5zbMath1183.94038OpenAlexW1815075800MaRDI QIDQ3600214

Dimitar Jetchev, Ramarathnam Venkatesan

Publication date: 10 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_5

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

RSA and Elliptic Curve Least Significant Bit Security ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ On the Bit Security of Elliptic Curve Diffie–Hellman ⋮ Optimal Randomness Extraction from a Diffie-Hellman Element ⋮ Expander graphs based on GRH with an application to elliptic curve cryptography

This page was built for publication: Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys