Maria Isabel González Vasco, Igor E. Shparlinski  Home/Search
Context
Related
| mq.edu.au/~igor/DHbits.ps iacr.org/2000/020.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mq.edu.au/~igor/Publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element # of a finite field IFp 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 IF # p . We use some recent bounds of exponential sums to generalize this algorithm to the case when t is selected from a quite small subgroup of IF # p . Namely, our results apply to subgroups of size at... (Update)
Similar documents (at the sentence level):
15.8%: Security of the Most Significant Bits of the Shamir Message .. - Vasco, Shparlinski (Correct)
8.3%: Security of Most Significant Bits of g^x^2 - Shparlinski (2000) (Correct)
Active bibliography (related documents): More All
0.8: On the Generalized Hidden Number Problem and Bit Security of XTR - Shparlinski (2000) (Correct)
0.5: Sparse Polynomial Approximation in Finite Fields - Shparlinski (2000) (Correct)
0.5: The Hidden Number Problem in Extension Fields and Its.. - Vasco, Näslund.. (Correct)
Similar documents based on text: More All
0.8: Hidden Number Problem in Small Subgroups - Shparlinski, Winterhof (2003) (Correct)
0.6: Exponential Function Analogue of Kloosterman Sums - Shparlinski (Correct)
0.5: Smooth Orders and Cryptographic Applications - Pomerance, Shparlinski (Correct)
BibTeX entry: (Update)
@misc{ vasco-security,
author = "Maria Isabel González Vasco and Igor E. Shparlinski",
title = "On the Security of Diffie-Hellman Bits",
url = "citeseer.ist.psu.edu/309705.html" }
Citations (may not include all citations):1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1996
66 On Lovasz' lattice reduction and the nearest lattice point p.. (context) - Babai - 1986
64 Quasi-Monte Carlo methods and pseudo-random numbers (context) - Niederreiter - 1978
55 Hardness of computing the most significant bits of secret ke.. (context) - Boneh, Venkatesan - 1996
28 Springer-Verlag (context) - Prachar - 1957
27 Character sums with exponential functions and their applicat.. (context) - Konyagin, Shparlinski - 1999
22 The XTR public key system - Lenstra, Verheul - 2000
20 Factoring polynomials with rational coe#cients (context) - Lenstra, Lenstra et al. - 1982
19 A hierarchy of polynomial time basis reduction algorithms (context) - Schnorr - 1987
18 Exponential sums and their applications (context) - Korobov - 1992
14 Security of the most significant bits of the Shamir message .. (context) - Vasco, Shparlinski - 2000
12 Rounding in lattices and its cryptographic applications - Boneh, Venkatesan - 1997
10 A survey of hard core functions (context) - Vasco, Naslund - 2000
9 Certificates of recoverability with scalable recovery agent .. (context) - Verheul - 2000
7 Doing more with fewer bits - Brouwer, Pellikan et al. - 1999
4 Security of polynomial transformations of the Di#e--Hellman .. (context) - Shparlinski - 2000
2 Department of Mathematics (context) - Vinogradov, number et al. - 1954
Documents on the same site (http://www.comp.mq.edu.au/~igor/Publ.html): More
A Lower Bound for Primality - Allender, Saks, Shparlinski (1999) (Correct)
Finding Points on Curves over Finite Fields - Gathen, Shparlinski, Sinclair (1996) (Correct)
A Public Key Cryptosystem Based On Sparse Polynomials - Grant, Lieman, Shparlinski (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC