Abstract
Let 19, m and e be integers such that gcd(19, m) = 1. Then one can define the sequence (un) by the recurrence relation
with theinitial value \({{u}_{0}} = \nu \).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Bach, ‘Toward a theory of Pollard’s rho method’Inform. and Comp.90(1991), 139–155.
E. Bach and J. ShallitAlgorithmic Number TheoryMIT Press, 1996.
L. Blum, M. Blum and M. Shub, ‘A simple unpredictable pseudo-random number generator’SIAM J. Comp.15(1986), 364–383.
J. J. Brennan and B. Geist, ‘Analysis of iterated modular exponentiation: The orbit of\({{x}^{\alpha }} \)mod N’Designs Codes and Cryptography 13(1998), 229–245.
R. Canetti, J. B. Friedlander, S. Konyagin, M. Larsen, D. Lieman and I. E. Shparlinski, ‘On the statistical properties of the Diffie-Hellman distribution’Israel J. Math.(to appear).
R. Canetti, J. B. Friedlander and I. E. Shparlinski, ‘On certain exponential sums and the distribution of Diffle-Hellman triples’J. London Math. Soc.(to appear).
J. H. H. Chalk ‘The Vinogradov-Mordell-Tietäväinen inequalities’Indag. Math.42(1980), 367–374.
T. W. Cusick, ‘Properties of the x2modNpseudorandom number generator’IEEE Trans. Inform. Theory 41(1995), 1155–1159.
T. W. Cusick, C. Ding and A. RenvallStream CiphersandNumber TheoryElsevier, Amsterdam, 1998.
R. Fischlin and C. P. Schnorr, ‘Stronger security proofs for RSA and Rabin bits’Lect. Notes in Comp.Sci., Springer-Verlag, Berlin1233(1997), 267–279.
F. Griffin and I. E. Shparlinski, ‘On the linear complexity profile of the power generator’, Preprint, 1998, 1–11.
J. Hästad and M. Näslund, ‘The security of individual RSA bits’Proc 39th IEEE Symp. on Foundations of Comp. Sci.1998, 510–519.
J. C. Lagarias, ‘Pseudorandom number generators in cryptography and number theory’Proc. Symp. in Appl. Math.Amer. Math. Soc., Providence, RI42(1990), 115–143.
A. J. Menezes, P. C. van Oorschot and S. A. VanstoneHandbook of CryptographyCRC Press, Boca Raton, FL, 1996.
I. E. Shparlinski, ‘On the linear complexity of the power generator’Tech. Report. C/TR 98–12Dept. of Computing, Macquarie Uni., Sydney, 1998, 1–8.
D. R. StinsonCryptography: Theory and PracticeCRC Press, Boca Raton, FL, 1995.
I. M. VinogradovElements of Number TheoryDover Publ., NY, 1954.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London
About this paper
Cite this paper
Friedlander, J.B., Lieman, D., Shparlinski, I.E. (1999). On the Distribution of the RSA Generator. In: Ding, C., Helleseth, T., Niederreiter, H. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0551-0_14
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0551-0_14
Publisher Name: Springer, London
Print ISBN: 978-1-85233-196-2
Online ISBN: 978-1-4471-0551-0
eBook Packages: Springer Book Archive