Posts

Showing posts with the label Vernam entropy

Vernam entropy

  Android Java The "quality" of the sound file as a source of random numbers is not high. In a small area, integers change less than we would like. To improve the quality of "random" numbers, special processing and selection algorithms are needed. You can use several algorithms at the same time. Because Since the source of integers (sound file) in the same assembly of the Operating System on the same smartphones turns out to be the same, it is important that the processing algorithms of the sender and recipient are the same. It is clear that such an encryption key cannot be considered ideal for the Vernam code. The strength of the cipher will not be absolute, but the labor costs for cracking can be huge. This mechanism can be used to further protect already encrypted data. Countermeasures for such an algorithm can be to correct the speech synthesis code - adding "random" values to the synthesis parameters. But you can develop your own codec for encr...

Vernam entropy

  Key Generate Vernam's code is old, easy to program, low resource, fast.   But it depends on the quality of the random number generator. For commercial cryptography, you can use the digital stream of Internet TV. Better - news channels. Or Internet radio with news too. The fewer repetitions, the higher the probability that the bytes selected from the stream will be a random set.     In the application, you set the search in the stream for some sequence of bytes. For example from 10 values.   You need to select such a NUMBER of bytes for waiting (marker) that it happens 1-2 times a day.     After the length of the sequence is chosen, several of its varieties are written to the application.     The application is launched by the sender and receiver at the same time and listen to the same Internet stream. With a high probability, they will find the given sequence (marker) in the stream at the same time. After that, according to some ...

Vernam entropy

  Android Java We use splitting of the digital stream for stream encryption with the Vernam code. How to make it harder or impossible to hack a stream. Engineering solutions. Let's write sample applications for Android Java. Speech technology in encryption is not speech encryption. Well and then it is possible to consider enciphering on the basis of "other thinking". For example, based on huge programming objects. This encryption is likely to be stable even during quantum computers.       Then we'll come up with something else Vernam Entropy

Vernam entropy

  Vernam Code in Java To use the Vernam cipher, one of the problems is getting the cipher pad pages on both sides. From the sender and recipient. It is ideal to receive these encryption pages identical, synchronously in time, in unlimited quantity, of any required length and without a synchronization channel between the sender and the recipient. Let's write an Android Java application that will demonstrate such capabilities. As a source for generating encryption pages, we use a digital stream from Internet television or Internet radio. Such a digital stream is not random and we use special processing algorithms that will be sufficient for a commercial level of encryption with XOR transformation. Then we will show the technology for the strongest encryption using digital streams. XOR encryption