Security of the Most Significant Bits of the Shamir Message Passing Scheme

@article{Vasco2000SecurityOT,
  title={Security of the Most Significant Bits of the Shamir Message Passing Scheme},
  author={Maria Isabel Gonzalez Vasco and Igor E. Shparlinski},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2000},
  volume={7}
}
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element α of a finite field Fp of p elements from rather short strings of the most significant bits of the remainder modulo p of αt for several values of t selected uniformly at random from Fp*. Unfortunately the applications to the computational security of most significant bits of private keys of some finite field exponentiation based cryptosystems given by Boneh and Venkatesan are not quite… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 19 CITATIONS

Public Key Cryptography – PKC 2004

  • Lecture Notes in Computer Science
  • 2004
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

New Results on the Hardness of ElGamal and RSA Bits Based on Binary Expansions

  • 2015 2nd International Conference on Information Science and Control Engineering
  • 2015
VIEW 2 EXCERPTS
CITES METHODS

On the bit security of the weak Diffie-Hellman problem

  • Inf. Process. Lett.
  • 2010
VIEW 1 EXCERPT
CITES BACKGROUND