Hard-core predicates for a Diffie-Hellman problem over finite fields

DOI10.1007/978-3-642-40084-1_9MaRDI QIDQ2849392zbMATH OpenOpenAlexFDO

Authors Nelly Fazio, Rosario Gennaro, Irippuge Milinda Perera, William E. Skeith

Publication date 17 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40084-1_9

zbMATH Keywords

Diffie-Hellman problemelliptic curvesfinite fieldshard-core bits

Mathematics Subject Classification ID

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

Recommendations

• Bit Security of the CDH Problems over Finite Fields
• On the unpredictability of bits of the elliptic curve Diffie-Hellman scheme
• The complexity of computing hard core predicates
• Bits Security of the Elliptic Curve Diffie–Hellman Secret Keys
• Public Key Cryptography – PKC 2004

Cited in

(6)

• Bit Security of the CDH Problems over Finite Fields
• The multivariate hidden number problem
• On the representation of Boolean predicates of the Diffie-Hellman function
• Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
• Public Key Cryptography – PKC 2004
• On the hardness of the finite field isomorphism problem

This page was built for publication: Hard-core predicates for a Diffie-Hellman problem over finite fields

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