![]() ![]() Shparlinski, “On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders”, Applied algebra, algebraic algorithms and error-correcting codes (Honolulu, HI, 1999), Lecture Notes in Comput. Shparlinski, “Exponential sums with Dickson polynomials”, Finite Fields Appl., Vol. Winterhof, “On the lower bound of the linear complexity over F p of Sidelnikov sequences”, preprint 2005.ĭ. Chan, “A fast algorithm for determining the complexity of a binary sequence with period 2 n, IEEE Trans. Shparlinski, “On the distribution of the power generator”, Math. Shparlinski, “Corrigendum to: Period of the power generator and small values of Carmichael’s function”, Math. Shparlinski, “Period of the power generator and small values of Carmichael’s function”, Math. Sárközy, “On the pseudorandomness of the signs of Kloosterman sums”, J. ![]() Niederreiter, “On inversive congruential generators for pseudorandom numbers”, Finite fields, coding theory, and advances in communications and computing (Las Vegas, NV, 1991), Lecture Notes in Pure and Appl. Kyureghyan, “One-error linear complexity over F p of Sidelnikov sequences”, Sequences and Their Applications SETA 2004, Lecture Notes in Comput. Eichenauer-Herrmann, “Statistical independence of a new class of inversive congruential pseudorandom numbers”, Math. ![]() Lehn, “A nonlinear congruential pseudorandom number generator”, Statist. Topuzoğlu, “A multiple recursive nonlinear congruential pseudo random number generator”, Manuscripta Math., Vol. Winterhof, “Lattice structure and linear complexity profile of nonlinear pseudorandom number generators”, Appl. Winterhof, “Counting functions and expected values for the lattice profile at n”, Finite Fields Appl., Vol. Shan, The stability theory of stream ciphers, Lecture Notes in Computer Science, Vol. Renvall, Stream ciphers and number theory, Revised edition. Winterhof, “Linear complexity profile of binary sequences with small correlation measure”, preprint 2005. Winterhof, “Nonlinearity of binary sequences with small autocorrelation”, Proceedings of the Second International Workshop on Sequence Design and its Applications in Communications (IWSDA ′05), to appear. Winterhof, “Some notes on the two-prime generator”, IEEE Trans. Winterhof, “On the non-linearity and sparsity of Boolean functions related to the discrete logarithm”, preprint 2005. Bourgain, “Mordell’s exponential sum estimate revisited”, J. Shparlinski, “Predicting nonlinear pseudorandom number generators”, Math. Shparlinski, “Predicting the inversive generator”, Lecture Notes in Comput. Paterson, “Permutation polynomials, de Bruijn sequences, and linear complexity”, J. Dai, “On the complexity of pseudo-random sequences-or: If you can describe a sequence it can’t be random”, Advances in cryptology-EUROCRYPT ′89 (Houthalen, 1989), Lecture Notes in Comput. Doumen, “Pseudorandom sequences from elliptic curves”, Finite fields with applications to coding theory, cryptography and related areas (Oaxaca, 2001), Springer, Berlin, 37–52 (2002). Winterhof, “On the k-error linear complexity over F p of Legendre and Sidelnikov sequences”, preprint 2005. Winterhof, “On the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials”, Des. However, be careful of the Monte Carlo fallacy.H. ![]() If you're just guessing that the random generator is temporarily biased, and that this bias will re-establish a baseline (balanced 0s and 1s) in the reasonably short-term then you can compare the count of each 0s and 1s and say the other is more likely based on the deviation from your baseline. If so, you have your "repeating section." If not, move "CURRENTPOINT" along and repeat the LOOP until you run out of letters. See if these blocks all equal your picked letters. LOOP: Pick letter(s) from Start to "CURRENTPOINT"īreak the rest of your binary string into blocks of the same size. I'd be inclined to convert this idea to code: "CURRENTPOINT" is end of first letter. Now, as for your question, if you're looking at true pattern matching. Java is probably an "easy-to-get-running-and-work-with" language but I'm sure there's better threads on here about which language to start with (Python or something probably wins because experienced programmers love it).īy the way, your English is fine (I didn't notice you were a non-native English speaker). You should look into picking up a basic language, and most are going to say PHP but I'm wary of recommending that to a beginner (it's pretty easy to get working though, see:XAMPP). This is a decent question but I think if "you can barely play solitaire" it might be out of your reach right now. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |