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

This publication has 12 references indexed in Scilit:

• Relationships among the Computational Powers of Breaking Discrete Log Cryptosystems
  Published by Springer Nature ,1995
• Block Reduced Lattice Bases and Successive Minima
  Combinatorics, Probability and Computing, 1994
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
  SIAM Journal on Computing, 1988
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
  SIAM Journal on Computing, 1988
• A hierarchy of polynomial time lattice basis reduction algorithms
  Theoretical Computer Science, 1987
• A Course in Number Theory and Cryptography
  Published by Springer Nature ,1987
• On Lovász’ lattice reduction and the nearest lattice point problem
  Combinatorica, 1986
• A public key cryptosystem and a signature scheme based on discrete logarithms
  IEEE Transactions on Information Theory, 1985
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976