Edwin El Mahassni, Igor Shparlinski  Home/Search
Context Related
| mq.edu.au/~igor/ECPRNG.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: Introduction Let p be a prime and let m # 1 be an integer. We denote by IF q the field of q = p m and by IF p the field of q = p elements which we also identify with the set {0, 1, . . . , p - 1}. Let w 0 and g be given elements of IF q . We recall that the linear congruential generator of pseudorandom numbers is the sequence w 1 , w 2 , . . . of elements of IF q defined by the recurrence relation w n = gw n-1 , n = 1, 2, . . . , (1) with the initial value w 0 . Let E be an elliptic... (Update)
Context of citations to this paper: More
...0 1 distribution of the one stage LFSR over supersingular elliptic curves over nite elds of characteristic 2. Mahassni and Shparlinski [9] obtained a general bound for the 0 1 distribution of the one stage LFSR on elliptic curves over nite elds. Hallgren [8] discussed some...
Cited by: More
Linear Recursive Sequences over Elliptic Curves - Gong, Lam (2001) (Correct)
Active bibliography (related documents): More All
0.5: On the Linear Complexity of the Naor-Reingold.. - Shparlinski, Silverman (2000) (Correct)
0.5: On The Uniformity Of Distribution Of The Naor-Reingold.. - Shparlinski (2000) (Correct)
0.3: Linear Complexity of the Naor-Reingold Pseudo-random Function - Shparlinski (1999) (Correct)
Similar documents based on text: More All
0.4: On the Multidimensional Distribution of the Subset Sum.. - Conflitti, Shparlinski (Correct)
0.3: On the Uniformity of Distribution of the Elliptic Curve.. - Mahassni, Shparlinski (Correct)
0.3: On Some Uniformity of Distribution Properties of ESIGN - Mahassni, Shparlinski (Correct)
BibTeX entry: (Update)
E.E. Mahassni and I. Shparlinski, On the Uniformity of Distribution of Congruential Generators over Elliptic Curves, preprint, November 2000. http://citeseer.ist.psu.edu/mahassni00uniformity.html More
@misc{ mahassni00uniformity,
author = "E. Mahassni and I. Shparlinski",
title = "the Uniformity of Distribution of Congruential Generators over Elliptic
Curves",
text = "E.E. Mahassni and I. Shparlinski, On the Uniformity of Distribution of
Congruential Generators over Elliptic Curves, preprint, November 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/mahassni00uniformity.html" }
Citations (may not include all citations):309 Random number generation and quasi--Monte Carlo methods (context) - Niederreiter - 1992
237 The arithmetic of elliptic curves (context) - Silverman - 1995
119 Elliptic Curves in Cryptography - Blake, Seroussi et al. - 1999
64 Quasi-Monte Carlo methods and pseudo-random numbers (context) - Niederreiter - 1978
33 Lattice reduction: A toolbox for the cryptanalyst - Joux, Stern - 1998
29 Improving the parallelized Pollard lambda search on anomalou.. - Gallant, Lambert et al. - 2000
27 Character sums with exponential functions and their applicat.. (context) - Konyagin, Shparlinski - 1999
23 Stronger security proofs for RSA and Rabin bits (context) - Fischlin, Schnorr - 2000
22 Pseudorandom number generators in cryptography and number th.. (context) - Lagarias - 1990
21 Reconstructing truncated integer variables satisfying linear.. (context) - Frieze, Hastad et al. - 1988
20 Faster attacks on elliptic curve cryptosystems - Wiener, Zuccherato - 1999
17 discrepancies and applications (context) - Drmota, Tichy - 1997
15 Why textbook ElGamal and RSA encryption are insecure - Boneh, Joux et al.
14 The security of individual RSA bits (context) - Hastad, Naslund - 1998
11 the linear complexity of the Naor-- Reingold pseudo-random f.. - Shparlinski, Silverman
10 How to predict congruential generators (context) - Krawczyk - 1992
10 A survey of hard core functions (context) - Vasco, Naslund
9 Elliptic curve pseudorandom sequence generators - Gong, Berwson et al. - 2000
6 Linear congruential generators over elliptic curves - Hallgren - 1994
5 the Naor--Reingold pseudo-random number function from ellipt.. (context) - Shparlinski - 2000
4 Exponential sums and group generators for elliptic curves ov.. - Kohel, Shparlinski - 2000
1 A note on the x-coordinate of points on an elliptic curve in.. - Smart
1 Hard core Bits for the elliptic curve Di#e-- Hellman secret (context) - Boneh, Shparlinski - 2000
1 Evaluation and Implementation of Secure Electronic Voting (context) - Lindholm - 2001
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)
Security of Most Significant Bits of g^x^2 - 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