{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T09:34:30Z","timestamp":1776764070242,"version":"3.51.2"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1007\/bf01225640","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T18:08:23Z","timestamp":1109354903000},"page":"255-260","source":"Crossref","is-referenced-by-count":8,"title":["On the period length of generalized inversive pseudorandom number generators"],"prefix":"10.1007","volume":"5","author":[{"given":"Klaus","family":"Huber","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Probabilistic Algorithms in Finite Fields. Proc. IEEE Symp. Found. Comp. Sci. 394?398 (1981)","DOI":"10.1109\/SFCS.1981.37"},{"issue":"2","key":"CR2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.2307\/1403647","volume":"60","author":"J. Eichenauer-Herrmann","year":"1992","unstructured":"Eichenauer-Herrmann, J.; Inversive Congruential Pseudorandom Numbers: a Tutorial. Int. Statistical Rev.60(2), 167?176 (1992)","journal-title":"Int. Statistical Rev."},{"key":"CR3","first-page":"315","volume":"27","author":"J. Eichenauer","year":"1986","unstructured":"Eichenauer, J., Lehn, J.: A non-linear congruential pseudo random number generator. Statist. Papers27, 315?326 (1986)","journal-title":"Statist. Papers"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1090\/S0025-5718-1988-0958641-1","volume":"51","author":"J. Eichenauer","year":"1988","unstructured":"Eichenauer, J., Lehn, J., Topuzoglu, A.: A non-linear congruential pseudo random number generator with power of two modulus. Math. Comp.51, 757?759 (1988)","journal-title":"Math. Comp."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0377-0427(90)90339-2","volume":"31","author":"J. Eichenauer-Herrmann","year":"1990","unstructured":"Eichenauer-Herrmann, J., Topuzoglu, A.: On the period length of congruential pseudorandom number sequences generated by inversions. J. Comp. Appl. Math.31, 87?96 (1990)","journal-title":"J. Comp. Appl. Math."},{"key":"CR6","first-page":"75","volume-title":"Finite Fields, Coding Theory, and Advances in Communications and Computing","author":"M. Flahive","year":"1992","unstructured":"Flahive, M., Niederreiter, H.: On Inversive Congruential Generators for Pseudorandom Numbers. In: Finite Fields, Coding Theory, and Advances in Communications and Computing, Mullen, G. L., Shiue, P. J.-S. (eds.), pp. 75?80. New York: Dekker 1992"},{"key":"CR7","first-page":"269","volume-title":"Cryptography and Coding","author":"J. Gordon","year":"1989","unstructured":"Gordon, J.: Fast Multiplicative Inverse In Modular Arithmetic. In: Beker, Piper (eds.) Cryptography and Coding, pp. 269?279. Oxford: Clarendon Press 1989"},{"key":"CR8","unstructured":"Hardy, G. H., Wright, E. M.: An introduction to the theory of numbers. Fifth edition, Oxford 1979"},{"key":"CR9","unstructured":"Landau, E.: Vorlesungen \u00fcber Zahlentheorie, Aus der Elementaren Zahlentheorie. Hirzel 1927, Reprint: Chelsea, New York, 1950"},{"key":"CR10","volume-title":"Finite Fields, Encyclopedia of Mathematics and its Applications. Vol. 20","author":"R. Lidl","year":"1984","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, Encyclopedia of Mathematics and its Applications. Vol. 20, University Press: Cambridge 1984"},{"key":"CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970081","volume-title":"Random Number Generation and Quasi-Monte Carlo Methods","author":"H. Niederreiter","year":"1992","unstructured":"Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Pennsylvania: Philadelphia 1992"},{"key":"CR12","unstructured":"Massey, J. L.: Cryptography: Fundamentals and Applications. (Copies of Transparencies), Advanced Technology Seminars, 1990"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. O. Rabin","year":"1980","unstructured":"Rabin, M. O.: Probabilistic Algorithms in Finite Fields. SIAM J. Comput.9, 273?280 (1980)","journal-title":"SIAM J. Comput."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01225640.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01225640\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01225640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:00:25Z","timestamp":1556625625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01225640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF01225640"],"URL":"https:\/\/doi.org\/10.1007\/bf01225640","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}