Android Open Source

  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

  Android Java The application layout extracts the encryption key from the Internet radio bitstream using an algorithm that can be repeated and give the same result in another instance of the application. XOR encrypts text, sends SMS to itself, receives SMS and decodes text. Contains all modules for a real application that encrypts text of any length with a Vernam code (restrictions on SMS). Independently receives the same keys (cipher pads) without a synchronization channel. https://github.com/vallshmeleff/radiorandgentwo Vernam Entropy

  Android Java      Many algorithms can be devised to generate random numbers from an internet radio digital stream. But these will be "pseudo-random" numbers. You can improve their quality if you use the "splitting" of digital streams. Splitting can be linear (periodic) and non-linear. Periodic splitting - when you divide the original stream of numbers, for example, into 10 streams, sending every tenth number to your own stream. Nonlinear splitting - when numbers are selected from the source stream according to some given algorithm. Something like: first, fifth, seventh, nineteenth, etc. And already in the new streams, the given sequence of bytes is taken and a random number is selected and the cipherbook page is formed. Note Vernam Encryption

  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       

RSA  Obfuscation For the same security, an elliptic curve algorithm (such as ECDSA) requires a smaller key length than RSA. On the other hand, RSA has been used for a long time, everyone knows how to write Java code and process data. But strong RSA requires increasingly longer encryption keys. In real commercial use of the RSA encryption algorithm, extremely high security can be achieved by using data obfuscation. Here this is not the usual obfuscation of the code, but the transformation of the correct code into "wrong". When the decryption keys or ciphertext are deliberately corrupted and the decryption operation cannot be performed. There can be a large number of processing options. Two code for such processing will not be too big. For example - repositotry https://github.com/vallshmeleff/androidrsa File https://github.com/vallshmeleff/androidrsa/blob/main/RSACode.java   Method   public String ObfuscationD ( String SourceText , String e , String d ) This is the e...

 RSA or ECC RSA may no longer be as strong an encryption algorithm as ECC, but there are some things that can be done to make it very resistant to hacking. At the same time, the main part of the data can be encrypted by the "built-in" software of the Android OS using RSA. Very curious if anyone can hack the following text: "tyubbgh,llet5gcghu8jhxwrtred9lmjnvvtr5gg4dwelmmb75"   Unlikely And all because the text was "masked" without using any logic. Randomly selected bytes were replaced by others. And the replacement option is known only to the receiving party. Those. the text was encrypted and deliberately corrupted. It can be either text or a decryption key. The problem of the stability of any encryption algorithm is the complexity of the logic used. And if there is no logic in the data initially, then it cannot be decoded directly. https://github.com/vallshmeleff Obfuscation    

  RSA Large Text Methods for RSA encryption of large texts have been tested. Now the methods are being connected to the application project   https://github.com/vallshmeleff/sqliteandrsa   to work with the data base of the SQLite. For example, one full in each entry will be encrypted. RSA Large Text