Mathematical Relativity / Similar Mathematics and Public Key Encryption

The Mathematical Relativity / Similar Mathematics papers indirectly suggest a way to make reverse factoring of public keys back into their "primes" much more difficult. In these papers, I have demonstrated that there are an infinite number of fields (Rn,+n,*n,0n,1n) that are isomorphic to the Real field (R,+,*,0,1). Because of the isomorphism, you can take any mathematical proposition of the Real Field (R), or its subsets (S) and demonstrate a similar proposition in the Rn field or its corresponding Sn subsets . It is also possible to standardly numerate Rn or Sn (i.e., reverse the map of the isomorphism with respect to the numeric symbols but NOT the values [unless 0n = 0 and 1n = 1]):

0 ~ 0n
1 ~ 1n
2 ~ 2n
etc.

Consequently, all of the fields that I have proposed have a subset that can be considered to be "prime" with respect to the "positive integers" of that field when they are standardly numerated. Standard numeration of these fields provides notational or symbolical correspondence, but not similar value correspondence (unless 0n = 0 and 1n = 1).

Specifically, an element, An, of the meta-field (Rn,+n,*n,0n,1n) is considered to be a "positive integer", if, when standardly numerated, it is an element of the meta-set {1n,2n,3n,4n,...}. An element, An, of the meta-field (Rn,+n,*n,0n,1n) is considered to be "prime", if, when standardly numerated, it is an element of the meta-set {2n,3n,5n,7n,...}.

For example, in the field (R0,+0,*0,00,10) where 00 is equal to 0 and 10 is equal to -1, the values in this field that would be considered to be "positive integers", when standardly numerated, would be {-1 (1n), -2 (2n), -3 (3n), -4 (4n)} and those that would be considered "prime", when standardly numerated, would be {-2 (2n), -3 (3n), -5 (5n), -7 (7n), ...}. In the field (R0,+0,*0,00,10) where 00 is equal to 0 and 10 is equal to 1+i, the values in this field that would be considered to be "positive integers", when standardly numerated, would be {1+i,2+2i,3+3i,4+4i} and those that would be considered "prime", when standardly numerated, would be {2+2i,3+3i,5+5i,7+7i, ...}. In the field (R1,+1,*1,01,11) where 01 is equal to 1and 11 is equal to 2, the values in this field that would be considered to be "positive integers", when standardly numerated, would be {2,4,8,16,...} and those that would be considered "prime", when standardly numerated, would be {4,8,32,128,...}.

Now, instead of having just the usual prime subset of the Real field from which to generate public keys, you have an infinite number of "prime" subsets that can also be used to generate public keys. Each of these subsets of "primes" has a unique actual value that is difficult to reverse factor unless the eavesdropper knows what the original map was (the map can be exchanged between the sender and receiver using a previously, strongly encrypted message).

As a very simple illustration, consider the field (R0,+0,*0,00,10), where 00 = -57,814,193 and 10 = -57,814,192. It is relatively easy to generate a public key with the actual value of 0 using the "primes" -57,807,114 (7079n) and -57,806,026 (8167n). Please note: when you "multiply" the two "primes" together to get 0 you need to use the definition of multiplication found on the bottom of this page Sim Math Ver.2 p.1.

Without knowing what 00 and 10 are, it is extremely difficult for an eavesdropper to even begin to reverse factor the public key of 0, back into its primes of -57,807,114 and -57,806,026. And this public key generation can be done for any 00,10 and "prime" (20,30,50,70,...) subset of (R0,+0,*0,00,10).

I believe that this approach would not only make public key encryption much harder to decipher but also allow it to use less bandwidth. However, I have been told that because the isomorphism I have demonstrated is *trivial*, it offers no security advantages. Consequently, I will leave you with a small challenge. Here is a public key with the actual value of -3,361,507,832.75. When standardly numerated, it is only eight decimal digits in length. How long would it normally take to factor a number like this into its primes? How long will it take to factor the above public key of -3,361,507,832.75 into its "primes"?


Home PageTable Of Contents