推断由线性同余产生的序列

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) Pub Date : 1982-11-03 DOI:10.1109/SFCS.1982.73

Joan B. Plumstead

{"title":"推断由线性同余产生的序列","authors":"Joan B. Plumstead","doi":"10.1109/SFCS.1982.73","DOIUrl":null,"url":null,"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.","PeriodicalId":127919,"journal":{"name":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"51","resultStr":"{\"title\":\"Inferring a sequence generated by a linear congruence\",\"authors\":\"Joan B. Plumstead\",\"doi\":\"10.1109/SFCS.1982.73\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":127919,\"journal\":{\"name\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"51\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1982.73\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1982.73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 51

摘要

假设已知{X0, X1，…一个人仅仅知道序列中的几个元素，就能有效地预测序列的剩余部分吗?对这个问题给出了肯定的回答，并给出了算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Inferring a sequence generated by a linear congruence

Suppose it is known that {X₀, X₁,...,X_n} is produced by a pseudo-random number generator of the form X_i+1 = aX_i + 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)

自引率

0.00%

发文量