Security of the most significant bits of the Shamir message passing scheme

Mathematics of Computation

Volumn 71, Issue 237, 2002, Pages 333-342

  Vasco, Maria Isabel González ^a   Shparlinski, Igor E ^a  

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

Bit security; Cryptography; Exponential sums; Shamir message passing scheme

Indexed keywords

EID: 0036003397     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-01-01358-8     Document Type: Article

References (14)

1. Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
2. A survey of hard core functions
3. On the security of Diffie-Hellman bits
4. Factoring polynomials with rational coefficients
5. Algorithmic geometry of numbers
6. On the distribution of digits in periodic fractions
7. Lattice reduction in cryptology: An update
8. Quasi-Monte Carlo methods and pseudo-random numbers
9. A hierarchy of polynomial time basis reduction algorithms