Generatory liczb losowych : algorytmy, testowanie, zastosowania

• Autorzy: Kotulski Z.
• Języki publikacji: PL

Słowa kluczowe

PL

losowość; liczby losowe; generatory liczb losowych; generatory ciągów bitów

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Matematyka Stosowana : matematyka dla społeczeństwa
• Rocznik: 2001
• Tom: Nr 2
• Strony: 32--66
• Opis fizyczny: Bibliogr. 70 poz., rys., tab.

Twórcy

autor

Kotulski Z.

• Instytut Podstawowych Problemów Techniki, Polska Akademia Nauk, 00-049 Warszawa, ul. Świętokrzyska 21, Polska,

Bibliografia

• [1] M. Abramowitz, I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables, National Bureau of Standards, Apllied Mathematics Series 55, 1964.
• [2] W. B. Alexi, B. Chor, O. Goldreich, C. P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole, SIAM J. Comput. 17 (1988), 194-209.
• [3] L. Blum, M. Blum, M. Shub, A simple unpredictable pseudo-random number generator, SIAM J. Comput. 15 (1986), 364-383.
• [4] A. Beardon, Iteration of Rational Functions, Springer, New York, 1991.
• [5] K. G. Beauchamp, Walsh Functions and their Applications, Academic Press, London, 1975.
• [6] H. Beker, F. Piper, Cipher Systems: the Protection of Communication, Wiley, New York, 1982.
• [7] E. Bollt, Y.-C. Lai, C. Grebogi, Coding, channel capacity, and noise resistance in communicating with chaos, Phys. Rev. Lett. 79 (1997), 3787-3790.
• [8] R. Brown, L. O. Chua, Clarifying chaos: examples and counterexamples, Internat. J. Bifurcation Chaos 6 (1996), 219-249.
• [9] A. Compagner, Definitions of randomness, Amer. J. Phys. 59 (1991), 700-705.
• [10] C. Ding, G. Xiao, W. Shan, The Stability Theory of Stream Ciphers, Springer, Berlin, 1991.
• [11] Cz. Domański, Testy statystyczne, PWE, Warszawa, 1990.
• [12] J. Eichenauer, J. Lehn, A non-linear congruential pseudo-random number generator, Statist. Pap. 27 (1986), 315-326.
• [13] G. S. Fishman, Monte Carlo: Concepts, Algorithms, and Applications, Springer, New York, 1996.
• [14] FIPS 140-2, Security Requirements for Cryptographic Modules, NIST 1999.
• [15] FIPS 186-2, Digital Signature Standard, NIST 2000.
• [16] J. Gawinecki, J. Szmidt, Zastosowanie ciał skończonych i krzywych eliptycznych w kryptografii, Wydawnictwo WAT, Warszawa, 1999.
• [17] S. Goldwasser, M. Bellare, Lecture Notes on Cryptography, preprint, August 1999 (w internecie).
• [18] S. W. Golomb, Shift Register Sequences, Holden-Day, San Francisco, 1967.
• [19] J. A. Gonzalez, R. Pino, Chaotic and stochastic functions, Physica 276A (2000), 425-440.
• [20] K. Górski, A. Paszkiewicz, A. Zugaj, Z. Kotulski, J. Szczepański, Własności ciągów generowanych przez najmniejsze pierwiastki pierwotne liczb pierwszych, w: Krajowe Sympozjum Telekomunikacji (Bydgoszcz, 1998), Wyd. Inst. Telekomunikacji PW, tom B, 1998, 143-151.
• [21] K. Górski, Z. Kotulski, A. Paszkiewicz, J. Szczepański, A. Zugaj, Generatory losowych ciągów binarnych w kryptografii, opracowanie, 250 stron, Warszawa, 1999.
• [22] T. Habutsu, Y. Nishio, I. Sasase, S. Mori, A secret key cryptosystem by iterating a chaotic map, w: Eurocrypt’91, 1991, 127-140.
• [23] P. Hellekalek, Good random number generators are (not so) easy to find, Math. Comput. Simulation 46 (1998), 485-505.
• [24] M. Kac, What is random?, Amer. Sci. 71 (1983), 405-406.
• [25] S. Katsura, W. Fukuda, Exactly solvable models showing chaotic bahavior, Physica 130A (1985), 597-605.
• [26] D. E. Knuth, The Art of Computer Programming - Seminumerical Algorithms, Vol. 2, 3rd ed., Addison-Wesley, Reading, 1997.
• [27] N. Koblitz, Wykład z teorii liczb i kryptografii, WNT, Warszawa, 1995.
• [28] —, Algebraiczne aspekty kryptografii, WNT, Warszawa 2000.
• [29] T. Kohda, A. Tsuneda, Statistic of chaotic binary sequences, IEEE Transactions on Information Theory 43, (1997), 104-112.
• [30] Z. Kotulski, J. Szczepański, Discrete chaotic cryptography, Ann. Phys. 6 (1997), 381-394.
• [31] Z. Kotulski, J. Szczepański, K. Górski, A. Paszkiewicz, A. Zugaj, The application of discrete chaotic dynamical systems in cryptography — DCC Method, Internat. J. Bifurcation Chaos 9 (1999), 1121-1135.
• [32] Z. Kotulski, J. Szczepański, K. Górski, A. Górska, A. Paszkiewicz, On constructive approach to chaotic pseudorandom number generators, w: Proc. Regional Conference on Military Communication and Information Systems. CIS Solutions for an Enlarged NATO, RCMIS 2000 (Zegrze, 2000), tom 1, 191-203.
• [33] L. Kuipers, H. Niederreiter, Uniform Distribution of Sequences, Wiley, New York, 1974.
• [34] D. H. Lehmer, Mathematical methods in large-scale computing units, w: Proc. 2nd Sympos. on Large-Scale Digital Calculating Machinery (Cambridge, MA, 1949), Ann. Comp. Lab. Harvard University 26 (1951), 141-146.
• [35] P. L’Ecuyer, Random Number Generation, w: J. Banks (ed.), Handbook of Simulation, rozdział 4, Wiley, New York, 1998.
• [36] Y. Li, Z. Xie, The wavelet detection of hidden periodicities in time series, Statist. Probab. Lett. 35 (1997), 9-23.
• [37] U. M. Maurer, A universal statistical test for random bit generator, J. Cryptology 5 (1992), 89-105.
• [38] A. Menezes, P. van Oorschot, C. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, 1996.
• [39] P. S. Naidu, Modern Spectrum Analysis of Time Series, CRC Press, Boca Raton, 1995.
• [40] H. Niederreiter, The linear complexity profile and the jump complexity of keystream sequences, w: Advances in Cryptology (Aarhus, 1990), Lecture Notes in Comput. Sci. 473, Springer, Berlin, 1991, 174-188.
• [41] —, Random Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia, 1992.
• [42] —, New developments in uniform pseudorandom number and vector generation, w: H. Niederreiter, P. J.-S. Shiue (red.), Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Lecture Notes in Statist. 106, Springer, Heidelberg, 1995.
• [43] E. Ott, C. Grebogi, J. A. Yorke, Controlling chaos, Phys. Rev. Lett. 64 (1990), 1196-1199.
• [44] U. Parlitz, L. O. Chua, Lj. Kocarev, K. S. Halle, A. Shang, Transmission of digital signals by chaotic synchronization, Internat. J. Bifurcation Chaos 2 (1992), 973-977.
• [45] A. Paszkiewicz, K. Górski, A. Górska, Z. Kotulski, K. Kulesza, J. Szczepański, Proposals of graph-based ciphers, theory and implementations, w: Proc. Regional Conf. on Military Communication and Information Systems. CIS Solutions for an Enlarged NATO, RCMCIS 2001 (Zegrze, 2001) (w druku).
• [46] L. M. Pecora, T. L. Caroll, Synchronization in chaotic systems, Phys. Rev. Lett. 64 (1990), 821-824.
• [47] W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery, Numerical Recipes in C. The Art of Scientific Computing, 2nd ed., Cambridge Univ. Press, Cambridge, 1992.
• [48] C. Radhakrishna Rao, Statystyka i prawda, PWN, Warszawa, 1994.
• [49] O. Reingold, Pseudo-Random Synthesizers, Functions and Permutations, The Weizmann Institute of Science, 1998 (praca doktorska).
• [50] P. Ribenboim, Mała księga wielkich liczb pierwszych, WNT, Warszawa, 1997.
• [51] M. Rosenblatt, Procesy stochastyczne, PWN, Warszawa, 1967.
• [52] R. Rueppel, Analysis and Design of Stream Ciphers, Springer, Berlin, 1986.
• [53] B. Schneier, Kryptografia dla praktyków. Protokoły, algorytmy i programy źródłowe w języku C, WNT, Warszawa, 1995.
• [54] H. G. Schuster, Chaos deterministyczny, PWN, Warszawa, 1995.
• [55] J. Szczepański, Z. Kotulski, On topologically equivalent ergodic and chaotic reflection laws leading to different types of particle’s motion, Arch. Mech. 50 (1998), 865-875.
• [56] J. Szczepański, K. Górski, Z. Kotulski, A. Paszkiewicz, A. Zugaj, Some models of chaotic motion of particles and their application to cryptography, Arch. Mech. 51 (1999), 509-528.
• [57] —, —, —, —, On some models of pseudorandom number generators based on chaotic dynamical systems, Proc. RCMCIS’99 (Zegrze, 1999), vol. 3, 213-220.
• [58] J. Szczepański, Z. Kotulski, Pseudorandom number generators based on chaotic dynamical systems, Open Systems Information Dynamics 8 (2001) (w druku).
• [59] —, —, Error Analysis with Applications in Engineering, Lastran Corporation, Rochester, 2000.
• [60] T. J. Taylor, On stochastic and chaotic motion, Stochastics Stochastics Rep. 43 (1993), 179-197.
• [61] —, Time series, stochastic and chaotic, w: W. A. Barnett et al. (eds.), Nonlinear Dynamics and Economics (Florence, 1992), Cambridge Univ. Press, Cambridge, 1996.
• [62] Y. Wang, Detection of jumps and curps by wavelets, Biometrics 82 (1995), 385-397.
• [63] S. Wegenkittl, On empirical testing of pseudorandom number generators, w: G. De Pietro et al. (eds.), Proceedings of the international workshop Parallel Numerics’95, CEI-PACT Project, WP5.1.2.1.2., 1995.
• [64] P. D. Welch, The use of fast Fourier transform for estimation of power spectra: A method based on time averaging over short, modified periodograms, IEEE Trans. Automatic Control AU-15 (1973), 70-73.
• [65] R. Wieczorkowski, R. Zieliński, Komputerowe metody generacji liczb losowych, WNT, Warszawa, 1997.
• [66] A. C. Yao, Theory and applications of trapdoor functions, w: Proc. 23rd IEEE Symposium on Foundations of Computer Science, IEEE, Chicago, 1982, 80-91.
• [67] C. K. Yuen, Testing random number generators by Walsh transform, IEEE Trans. Computers C-26 (1977), 329.
• [68] R. Zieliński, Metody Monte Carlo, WNT, Warszawa, 1970.
• [69] —, Generatory liczb losowych, WNT, Warszawa, 1972.
• [70] —, Wytwarzanie losowości, Wiad. Mat. 29 (1992), 189-203.