Android Open Source

Neural Network in PRNG The greatest share of PRNG vulnerability is created by constant parameters: constant (even if considered crypto-resistant) generation algorithm, constant length of generated numbers, constant (on some interval of generated numbers) master key. Using neural networks with feedback in PRNG leads to inflation of crypto-resistance. With the help of neural networks it is easy to make ALL generator parameters variable. At every step. The complication of cryptanalysis is especially effective with preliminary distortion of encrypted data. For example, when using several layers of encryption. Of course, we are not talking about stream encryption. Let's write an example of a neural network in Java from one neuron, emulating a network of 6 neurons. Then we'll teach it to rebuild the structure and change parameters. But for now we won't study learning. Android JAVA

  Czech Entropy PRNG 1024 bit Work will be carried out for some time to improve the quality of generated numbers, correct errors and create an indicator of number distribution. The Block 5 version will add the ability to use your own large prime numbers. It is planned to create a separate application to search for such large prime numbers. This will bring the PRNG application Czech Entropy PRNG as close as possible to the CSPRNG   Czech Entropy PRNG The application cannot encrypt data. To create encryption applications, you must contract with a company that has the appropriate licenses.

  PRNG 1024 bits Screenshots Entered text as initial data for PRNG Generated 1024 bits numbers https://www.upload-apk.com/CyMRIyvMX9xsGnI Czech Entropy PRNG The application cannot encrypt data. To create encryption applications, you must contract with a company that has the appropriate licenses.

  Big Int Application version Czech Entropy PRNG Block 4 has an improved mechanism for generating pseudo-random numbers with a size of 1024 bits. This version is available for download. The next version Block 5 will add the ability to enter a pair of prime numbers (high-dimensional) for use when generating an array of pseudo-random numbers. An interesting topic is phase data encryption. However, there are significant limitations on the development of encryption programs. You must either be licensed or work for a company that is officially licensed. This is an open issue for now. Czech Entropy PRNG http://shmeleff.com/CzechEntropy.apk

  Android PRNG Application Version Block 4 1024 bits in near time Czech Entropy PRNG http://czechentropy.freetzi.com/

  Finding Prime Numbers I have to do something I didn’t want to waste time on :-) We will look for very large prime numbers. I'll write a separate program. I'll test it for speed. If it's quick, I'll add it to the Czech Entropy PRNG app. And that is not all

 Czech Entropy PRNG 1024 bit How to improve the distribution of pseudo-random numbers generated by a software generator (PRNG). The idea is to use the "sliding square method". Everything is clear from the pictures. The random number generator will create a very large array of pseudo-random numbers, from which we will select a number to use and look at the distribution. Figure 1 shows that the distribution is not the best. We will create a certain number of squares in the free areas (no smaller than the specified size) and select from the generated array additional values that fall into the given squares in Figure 2 (orange dots) Figures 3 and 4 show the resulting distribution. Next, you can use the second stage of working with smaller squares. And so on until the distribution estimation algorithm shows the desired result of the quality of the set of numbers. You can make an interesting generator if at the next stage you use triangles rather than squares. Select the number of ...

  Generation algorithm The generation algorithm is written completely differently. Now the application does not depend on the hardware and Android build. Generating very large numbers is fast. The Block 3 prototype can generate 1K+ numbers. Czech Entropy PRNG

 0.35.5 Block 2 A new mechanism for generating an array of pseudo-random numbers. Basic version. Before modifications There are still reruns. But the mechanism has already been finalized and tests built into the application are being prepared. Least The Frequency Monobit Test and The Cumulative Sums Test. There may also be a discrete transform test  Fourier. Czech XOR Calculator

  Statistics and indicators Application Czech Entropy PRNG contains several modules for its operation. The first modules used are the source data expansion module (there is only one so far) and the module for sampling numbers from a huge file obtained after expanding the source data. The sampling module has so far been in its simplest form. Let's look at a few pictures from the graphical indicator First generating an array of numbers based on the entered text It can be seen that the distribution of numbers is not the best. But we use the MultiMode mode, when the generated array is used as the source data. It would be nice if the distribution changed noticeably There is some result. The simplest indicator shows that the distribution has changed. Let's repeat the cycle again with the resulting array of numbers The impression is that for the simplest algorithm everything is not bad. Not too bad. Another cycle The distribution has changed. But what patterns are there in such...

 Squares algorithm Once the floating square algorithm is integrated into the application and the mixing algorithm is tested, the Czech Entropy PRNG application will use 4 different pseudo-random number generation algorithms simultaneously. The number of numbers will exceed 60 values. But the Czech XOR Calculator application limits the length of the encrypted message to complicate cryptanalysis. It will also have built-in protection against reuse of the same key. Czech Entropy PRNG

  Czech Entropy PRNG There is a clear need to develop additional indicators for quickly assessing generated arrays of pseudo-random numbers. Of course, it makes no sense to embed N-dimensional indicators into a smartphone screen. But 2D indicators can still be invented. This will allow you to discard frankly “bad” initial phrases. Czech Encryption APP

  Android Java Interesting to try it Czech Entropy PRNG

  Post-processing 30. Dec. 2023  A new pseudo-random number post-processing module has been prototyped to improve entropy quality using squares. Once testing and preparation of the module is completed, the module will be integrated into the application. The previous simple versions of the processing mode will be replaced. Next, we will develop a module of multilayer squares to improve entropy Czech Entropy PRNG

 Czech Entropy PRNG A method has been developed for the hidden diffusion of numbers into any files or data blocks. Requests to the server, sending or receiving data, binary files. New methods for expanding the source data for PRNG have been invented. The methods do not depend on the hardware platform and Android version. You can make any expansion coefficients. The resulting binary code depends very much on the parameters chosen and the number of conversion levels. https://apkadmin.com/n4g9a5vm9m78/CzechEntropy.apk.html Android JAVA

  Expansion module The development of the third source data extension module for the Czech Entropy PRNG application has begun. Unlike the TTS-based expansion module currently used, the new module will be hardware-independent (and independent of the Android version). The sender and recipient of messages will be able to use different smartphones. The module will be added. Those. It will remain possible to use the previous data expansion algorithms. Czech XOR Calculator

  Next Property Single-bit Density Analytic added https://drive.google.com/file/d/1in6sX45yDGty7NyDGCskZhJYJ4wo8V_T/view?usp=sharing Czech Entropy PRNG

  Single-bit Density The module for analyzing and displaying one-bit density in an array of numbers works like this Czech Entropy PRNG

  Singe bit density A module of analysis and display of a single -bit density in an array of numbers has been developed. Testing Czech Entropy PRNG

  Android PRNG A second activity with online guidance has been added to the application. In the next version, the possibilities for manually selecting parameters for generating “random” numbers will be expanded. Work continues on the mask module for transmitting data to the generator input (MCULTIMODE mode) Download page:  https://appsenjoy.com/en/ZsyGTTW0VHkiih9/file Czech Entropy PRNG