Security of polynomial transformations of the Diffie-Hellman key

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Finite Fields Their Appl.

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S1071-5797(03)00048-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Security of most significant bits of gx2

  2002cited by this paper
• Security of the most significant bits of the Shamir message passing scheme

  2002cited by this paper
• Exponential Sums and Lattice Reduction: Applications to Cryptography

  2002cited 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
• On the Insecurity of a Server-Aided RSA Protocol

  2001cited by this paper
• On the Generalised Hidden Number Problem and Bit Security of XTR

  2001cited by this paper
• An overview of the XTR public key system

  2001influential reference
• A Survey of Hard Core Functions

  2001cited by this paper
• Key Improvements to XTR

  2000influential reference
• On the Security of Diffie-Hellman Bits

  2000cited by this paper
• Certificates of Recoverability with Scale Recovery Agent Security

  2000influential reference
• On the statistical properties of Diffie-Hellman distributions

  2000cited by this paper
• The XTR Public Key System

  2000influential reference
• Doing More with Fewer Bits

  1999influential reference
• Number Theoretic Methods in Cryptography: Complexity lower bounds

  1999cited by this paper
• On The Correlation Of Binary M-sequences

  1999cited by this paper
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes

  1996cited by this paper

• Research on Key Agreement Security Technology Based on Power Grid Internet of Things

  2020cites this paper
• Hidden Number Problems

  2017cites this paper
• Bit Security of the CDH Problems over Finite Fields

  2015cites this paper
• The Security of Polynomial Information of Diffie-Hellman Key

  2015influential citation
• An efficient improved group key agreement protocol based on Diffie-Hellman key exchange

  2010cites this paper
• Polynomial analysis of DH secrete key and bit security

  2008cites this paper
• The Diffie-Hellman key exchange protocol and non-abelian nilpotent groups

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

  2005cites this paper
• Advances in Cryptology — CRYPTO 2002

  2002cites this paper
• The Hidden Number Problem in Extension Fields and Its Applications

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

  2002cites this paper
• Exponential Sums and Lattice Reduction: Applications to Cryptography

  2002cites this paper
• A Survey of Hard Core Functions

  2001cites this paper
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

  2001influential citation
• Sparse polynomial approximation in finite fields

  2001cites this paper
• On the Security of Diffie-Hellman Bits

  2000cites this paper