RSA and Blum—Blum—Shub Generators of Pseudo-Random Numbers

  • Igor Shparlinski
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 17)

Abstract

Let ϑ, m and e be integers such that gcd(ϑ, m) = 1.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Basel AG 1999

Authors and Affiliations

  • Igor Shparlinski
    • 1
  1. 1.School of Mathematics, Physics, Computing and ElectronicsMacquarie UniversityAustralia

Personalised recommendations