New Results on the Hardness of Diffie-Hellman Bits

No abstract is available for this paper.

• Publication year

  2004

• Venue

  International Conference on Theory and Practice of Public Key Cryptography

• Publication date

  2004-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-24632-9_12
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Random Oracle Model

  2005cited by this paper
• On the Bit Security of NTRUEncrypt

  2003cited by this paper
• The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces

  2003cited by this paper
• Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order

  2003cited by this paper
• Cryptographic Applications of Analytic Number Theory

  2003cited by this paper
• Nearly One-Sided Tests and the Goldreich–Levin Predicate

  2003influential reference
• Bit Security of NTRU

  2003cited by this paper
• Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation

  2003cited by this paper
• The Hidden Number Problem in Extension Fields and Its Applications

  2002cited by this paper
• Hidden Number Problem with the Trace and Bit Security of XTR and LUC

  2002cited by this paper
• Security of most significant bits of gx2

  2002cited by this paper
• The Insecurity of the Digital Signature Algorithm with Partially Known Nonces

  2002influential reference
• Security of the most significant bits of the Shamir message passing scheme

  2002cited by this paper
• A Survey of Hard Core Functions

  2001cited by this paper
• The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces

  2001cited by this paper
• Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption

  2001cited by this paper
• On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme

  2001cited by this paper
• A sieve algorithm for the shortest lattice vector problem

  2001cited by this paper
• The Two Faces of Lattices in Cryptology

  2001cited by this paper
• New bounds for Gauss sums derived from kth powers

  2000cited by this paper
• Lattice Reduction in Cryptology: An Update

  2000cited by this paper
• On the Security of Diffie-Hellman Bits

  2000influential reference
• Character Sums with Exponential Functions and their Applications: Multiplicative Translations of Arbitrary Sets Modulo p

  1999cited by this paper
• Security of Allmost ALL Discrete Log Bits

  1998cited by this paper
• Relations among Notions of Security for Public-Key Encryption Schemes

  1998cited by this paper
• Security of Almost ALL Discrete Log Bits

  1998cited by this paper
• Rounding in lattices and its cryptographic applications

  1997influential reference
• Stronger Security Proofs for RSA and Rabin Bits

  1997cited by this paper
• Lower Bounds for Discrete Logarithms and Related Problems

  1997influential reference
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes

  1996influential reference
• An Introduction to Computational Learning Theory

  1994influential reference
• Random oracles are practical: a paradigm for designing efficient protocols

  1993cited by this paper
• A hard-core predicate for all one-way functions

  1989cited by this paper
• ALGORITHMIC GEOMETRY OF NUMBERS

  1987cited by this paper
• How to generate cryptographically strong sequences of pseudo random bits

  1982cited by this paper
• Electronic Colloquium on Computational Complexity, Report No. 37 (1999) The Security of all RSA and Discrete Log Bits

  year unknowncited by this paper

• On the Bit Security of Elliptic Curve Diffie-Hellman

  2017cites this paper
• Hidden Number Problems

  2017cites this paper
• Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem

  2017cites this paper
• Finding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations

  2016cites this paper
• New Results on the Hardness of ElGamal and RSA Bits Based on Binary Expansions

  2015cites this paper
• Mathematics of Public Key Cryptography

  2012cites this paper
• More efficient DDH pseudorandom generators

  2010cites this paper
• A Summary of Recent and Old Results on the Security of the Diffie-Hellman Key Exchange Protocol in Finite Groups

  2009cites this paper
• Statistical analysis of the Diffie-Hellman key exchange protocol in a finite group

  2007cites this paper
• Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes

  2006cites this paper
• On the bit security of the Diffie-Hellman key

  2005cites this paper