Finding A Quantum One-Way Function

For context: This was before I had completely learned about RSA cryptography, and had a string of bad teachers on Diaspora. There happens to RSA caculators floating around. I still think a quantum one-way function is possible though.

Here is the math problem of a quantum resistant one-way function

              p                p

(sp * rp)  * (sp * rp)

P represents a prime number, s represents a set value for the originating prime value. R equalsa random value. RP equals a random iterated prime value. Exponential p represents the amount oftimes each multiplication problem in brackets repreat, such as (73 * 89) to the 101st power.

This creates a floating point number, with a hundred or more zeros behind it. The maximum value can extend into the hundreds of zero behind the float.Here are the rules for using the one way function: remove duplicates, encipher plaintext, remove duplicates, recipher ciphertext. This creates a nearly infinite amount of compression of a phrase. There are practical limitations for this quantum resistant function: even with a key, it would still takes more than a billion years to reverse the process. Suggesting that, while not technically a hash value, it would take an impractical amount of even quantum computing power to reverse.

Time will tell whether such one-way functions will continue to be necessary, or if we'lleventually switch to quantum symmetric cryptography.One other problem is that this method functions at its best, when compressing large documents rather than single words. A word like sandwich might be reduced to only two characters, but a relatively large document like a novel would be able to compress more and therefore more easily inhibit crypto analyses. A smaller word wouldn't be able to do the more than billion transformation order to compress the plaintext.Also a limitation, it must be done automatically as such one way function is an extremely slow and arduous process.

You might get up and have a cup of coffee while the program is encryptingyour plaintext.Perhaps this is why Quantum Cryptography seems so far to be planned around using one-time pads (a form of highly secure symmetric crypto) instead of public key            cryptography.Here is an example of such a one way function: 

( 101*79 ) ^2 * ( 101*13 )^110     = or, 6.501548401×10³⁵⁰

See why trying for secure quantum resistant public key is kind of absurd? The amount of computing power that it would take to make the function secure, would require an immense-amount of time.This is why I'm hedging my bets on symmetric cryptography.


Kommentare

beta
Feenstaub

Navigation

Sprachen

Social Media