Android Open Source

  Prime Digits 3 mod 4 A Java module 3 mod 4 for the application CzechBigIntPrimeNumber  (The application cannot encrypt data ) for searching prime numbers has been written and tested. BBS Module The application cannot encrypt data. To create encryption applications, you must contract with a company that has the appropriate licenses.

  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.

  Application Guide Czech Entropy PRNG Block 4  Shared Links  https://www.upload-apk.com/CyMRIyvMX9xsGnI     Software synchronous random number generator Czech Entropy PRNG Block 4 is a program for Android that generates random numbers of 1024 bits. The app doesn't just generate numbers. By downloading the utility to your own smartphone, you can set the trigger data to generate an array of 50 random numbers. Triggering data - text in English or numbers longer than 100 characters. Additionally, if you specify the same trigger data, the application will generate the same set of random numbers. If users of the same version of the application, for example, in different countries, enter the same trigger data, the application will create the same 1024-bit arrays of random numbers. In this case, no synchronization channels are used. To improve the quality of generated random numbers, several generation levels with different algorithms and special quality improvement me...

  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/

  Block 4 We are working on a new version of the application  Czech Entropy PRNG Block 4 . The interface and random number generation algorithm will be significantly redesigned (compared to Block 3). The application will still be able to generate an array of 50 large pseudo-random numbers. New Edition

  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

  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

  Application prototype The application prototype generated an array of large numbers. Quality has not yet been assessed. To work with very large numbers, all program modules will need to be modernized Czech Entropy PRNG The application only generates an array of numbers

  Notes The Czech Entropy PRNG   application for generating pseudorandom numbers will change significantly. Development of the application  Czech XOR Calculator is not possible now, because... to create such programs you need an official license. Naturally, I don’t have it. Until this problem is solved, interesting ideas for information processing will remain just ideas. It is possible that they have already been invented by someone, used, but not published. Or maybe this is all still new. Sieve of Eratosthene

  Edition Block 2 Ver. 0.35.6  Czech Entropy PRNG Block 2   DOUBLE Int Mode 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

  Square method First version of the post-processing module using the floating square method. Only one layer. No adaptation. Orange dots are the original array of numbers. The blue dots are from post-processing. The quality can be improved further. Czech Entropy PRNG

  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

  Array Generation Analytic The 2D entropy indicator showed problems in the existing algorithms of the Czech Entropy PRNG application. If the basic version of generating "random" numbers gives such a distribution on the plane The problems of distributing points on a plane are obvious. If you connect the options PRNG Mode 2 and Encalibration Mode 2 , the distribution will become different The number distribution is different, but not better (for encryption) Connecting the PRNG MultiMode 3 option gives a different distribution of numbers on the plane. Better than the second picture. But even on a short array it is noticeable that the generation of numbers needs to be improved. This can be done through post-processing. The corresponding module is currently under development. It is clear that the ability to evaluate the resulting arrays of numbers is very important for PRNG We will also develop 2D indicators of other types Android Java Programming

  No putterns I am currently correcting the errors and inaccuracies found. An idea appeared on how to eliminate patterns in the generated array (2D entropy). This will result in an array of more than 60 numbers. Size will vary. Czech Entropy PRNG Czech XOE Calculator