Bit Security of the CDH Problems over Finite Fields

DOI10.1007/978-3-319-31301-6_25zbMath1396.94102OpenAlexW2408139740MaRDI QIDQ2807226

Zhan, Tao, Hai-Bin Zhang, Ming-Qiang Wang

Publication date: 19 May 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-31301-6_25

zbMATH Keywords

finite fieldsnoisy oraclecomputational Diffie-Hellman problemList decodingCDH\(d\)-th CDH problemhard-core bitsmultiplication codepartial-CDH problem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Security of polynomial transformations of the Diffie-Hellman key.
• Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields
• Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves
• The Multivariate Hidden Number Problem
• A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• All Bits in ax + b mod p are Hard
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• The Security of All Bits Using List Decoding
• A public key cryptosystem and a signature scheme based on discrete logarithms
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• New directions in cryptography