| Alternate document: Details Security of Polynomial Transformations of the Diffe-Hellman Key (00) Igor E. Shparlinski |
Igor E. Shparlinski  Home/Search
Context
Related
| mq.edu.au/~igor/DHbitsDiag.ps 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 IF p = {0, . . . , p - 1} 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 . Gonzalez Vasco and Shparlinski, using bounds of exponential sums, have generalized this algorithm to the case where t is selected from a subgroup of IF # p . In turn, this... (Update)
Similar documents (at the sentence level): More
14.7%: On the Security of Diffie-Hellman Bits - Vasco, Shparlinski (Correct)
7.3%: The Insecurity of the Digital Signature Algorithm with.. - Nguyen, Shparlinski (2000) (Correct)
7.3%: Security of the Most Significant Bits of the Shamir Message .. - Vasco, Shparlinski (Correct)
Active bibliography (related documents): More All
0.5: Polynomial Representations of the Diffie-Hellman Mapping - Mahassni, Shparlinski (Correct)
0.3: The Hidden Number Problem in Extension Fields and Its.. - Vasco, Näslund.. (Correct)
0.2: On the Generalized Hidden Number Problem and Bit Security of XTR - Shparlinski (2000) (Correct)
Similar documents based on text: More All
0.8: Hidden Number Problem in Small Subgroups - Shparlinski, Winterhof (2003) (Correct)
0.4: On the Hardness of Approximating the Permanent of.. - Codenotti, Shparlinski (Correct)
0.4: Playing "Hide-and-Seek" in Finite Fields: The Hidden Number.. - Shparlinski (2002) (Correct)
BibTeX entry: (Update)
@article{ shparlinski00security,
author = "Igor Shparlinski",
title = "Security of Polynomial Transformations of the Diffie--Hellma",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
number = "041",
year = "2000",
url = "citeseer.ist.psu.edu/shparlinski00security.html" }
Citations (may not include all citations):55 Hardness of computing the most significant bits of secret ke.. (context) - Boneh, Venkatesan - 1996
38 Elements of number theory (context) - Vinogradov - 1954
34 The insecurity of the Digital Signature Algorithm with parti.. - Nguyen, Shparlinski - 2000
27 Character sums with exponential functions and their applicat.. (context) - Konyagin, Shparlinski - 1999
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
6 Character sums with exponential functions - Friedlander, Hansen et al.
2 The relationship between breaking the Di#e-- Hellman protoco.. (context) - Maurer, Wolf - 1999
1 Shparlinski On a new exponential sum (context) - Lieman
Documents on the same site (http://www.cs.mq.edu.au/~igor/Publ.html): More
A Public Key Cryptosystem Based On Sparse Polynomials - Grant, Krastev, Lieman.. (1998) (Correct)
On the Uniformity of Distribution of Congruential.. - Mahassni, Shparlinski (2000) (Correct)
Some Doubly Exponential Sums over ... - Friedlander, Shparlinski (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