Bit Security of the CDH Problems over Finite Fields

DOI10.1007/978-3-319-31301-6_25zbMATH Open1396.94102OpenAlexW2408139740MaRDI QIDQ2807226FDOQ2807226

Authors: Tao Zhan, Hai-Bin Zhang, Mingqiang 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

Recommendations

• On the bit security of cryptographic primitives
• Bit security of the hyperelliptic curves Diffie-Hellman problem
• Revisiting homomorphic encryption schemes for finite fields
• On finite fields for pairing based cryptography
• On the bit security of the weak Diffie-Hellman problem
• scientific article; zbMATH DE number 927439
• Finite fields and cryptology
• scientific article; zbMATH DE number 426144
• Partially homomorphic encryption schemes over finite fields
• On the bit security of elliptic curve Diffie-Hellman

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Probabilistic encryption
• Title not available (Why is that?)
• A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
• Modern computer algebra
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• Security of polynomial transformations of the Diffie-Hellman key.
• A generalization of Komlós's theorem on random matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Security of All Bits Using List Decoding
• 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
• All bits in \(ax + b\bmod p\) are hard

Cited In (4)

• Hardness of computing individual bits for one-way functions on elliptic curves
• Hard-core predicates for a Diffie-Hellman problem over finite fields
• DRAT-based bit-vector proofs in CVC4
• Title not available (Why is that?)

This page was built for publication: Bit Security of the CDH Problems over Finite Fields

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