• DocumentCode
    2188682
  • Title

    Inferring a sequence generated by a linear congruence

  • Author

    Plumstead, Joan B. ; Plumstead, Joan B. ; Plumstead, Joan B. ; Plumstead, Joan B.

  • fYear
    1982
  • fDate
    3-5 Nov. 1982
  • Firstpage
    153
  • Lastpage
    159
  • Abstract
    Suppose it is known that {X0, X1,...,Xn} is produced by a pseudo-random number generator of the form Xi+1 = aXi + b mod m, but a, b, and m are unknown. Can one efficiently predict the remainder of the sequence with knowledge of only a few elements from that sequence? This question is answered in the affirmative and an algorithm is given.
  • Keywords
    Algorithm design and analysis; Computer science; Cryptography; Data analysis; Error correction; Inference algorithms; Power generation; Random number generation; Sections; Tiles;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1982. SFCS '08. 23rd Annual Symposium on
  • Conference_Location
    Chicago, IL, USA
  • ISSN
    0272-5428
  • Type

    conf

  • DOI
    10.1109/SFCS.1982.73
  • Filename
    4568387
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2188682