IDEAS home Printed from
   My bibliography  Save this paper

Portable random number generators


  • Gerald P. Dwyer
  • K. B. Williams


Computers are deterministic devices, and a computer-generated random number is a contradiction in terms. As a result, computer-generated pseudorandom numbers are fraught with peril for the unwary. We summarize much that is known about the most well-known pseudorandom number generators: congruential generators. We also provide machine-independent programs to implement the generators in any language that has 32-bit signed integers-for example C, C++, and FORTRAN. Based on an extensive search, we provide parameter values better than those previously available.

Suggested Citation

  • Gerald P. Dwyer & K. B. Williams, 1999. "Portable random number generators," FRB Atlanta Working Paper 99-14, Federal Reserve Bank of Atlanta.
  • Handle: RePEc:fip:fedawp:99-14

    Download full text from publisher

    File URL:
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    1. Sangjoon Kim, Neil Shephard & Siddhartha Chib, "undated". "Stochastic volatility: likelihood inference and comparison with ARCH models," Economics Papers W26, revised version of W, Economics Group, Nuffield College, University of Oxford.
    2. Sangjoon Kim & Neil Shephard & Siddhartha Chib, 1998. "Stochastic Volatility: Likelihood Inference and Comparison with ARCH Models," Review of Economic Studies, Oxford University Press, vol. 65(3), pages 361-393.
    3. McCullough, B D, 1999. "Econometric Software Reliability: EViews, LIMDEP, SHAZAM and TSP," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 14(2), pages 191-202, March-Apr.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Tang, Hui-Chin, 2006. "Theoretical analyses of forward and backward heuristics of multiple recursive random number generators," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1760-1768, November.

    More about this item


    Programming (Mathematics) ; Computers;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:fip:fedawp:99-14. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Elaine Clokey). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.