LinkBack URL
About LinkBacksThe Human Genome Project which was almost mapped completely by 2003 provided basic understanding of human DNA and several non-humans DNA. It benefited the science of medicine for conquering diseases and genetic anomalies. On the other hand, the science of public key encryption and decryption of internet access still relies in some respect on the prime factorization of a large number. This large number is simply the product of two large semiprimes. The product as a key is found in the public domain while the secret keys are the prime factors which can remain almost intractable for the code breakers and can require years of computer calculations.
However, an unbreakable code would, still in some ways, necessarily uses prime numbers. But instead of multiplications of primes, it uses differences of primes. This can be done by combining Goldbach conjecture with Erdös conjecture, such that there are three prime numbers: a, b, and c where c > b and b > a. They are related by the simple formula such that: a = ˝(c-b). For example if a = 2, then there are infinite number of pairs of (b, c) as solutions to the formula: the first 5 are (3, 7), (13, 17), (37, 41), (43, 47), and (67, 71). If a = 3 then these become: (5, 11), (11, 17), (13, 19), (17, 23), and (23, 29). If a = 5 then these are: (3, 13), (7, 17), (13, 23), (19, 29), and (31, 41). If a = 7 then these are: (3, 17), (5, 19), (17, 31), (23, 37), and (29, 43). The prime number a can be the public key while b and c are the secret keys which wherever and whenever permutated and combined become truly unbreakable.
Welcome to the ToeQuest.
Results 1 to 5 of 5
Thread: unbreakable
- 08-01-2008, 02:14 PM #1Raider of the lost time
- Join Date
- Nov 2003
- Location
- United States
- Posts
- 11,778
- Blog Entries
- 10
- Thanks Given
- 1,106
- Thanked 1,472x in 1,192 Posts
- Rep Power
- 158
unbreakable
Time independence: [∂E(g)]˛=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: ¶a(t)·¶r(t)=c˛
- 08-01-2008, 03:29 PM #2Moderator
- Join Date
- Aug 2005
- Location
- United Kingdom
- Posts
- 11,621
- Blog Entries
- 5
- Thanks Given
- 295
- Thanked 896x in 724 Posts
- Rep Power
- 154
Re: unbreakable I like the idea here you are suggesting,where do you think it will lead?
regards michael.Humilty,coupled with boldness,surprises truth to
reveal herself?
- 08-02-2008, 10:22 AM #3Raider of the lost time
- Join Date
- Nov 2003
- Location
- United States
- Posts
- 11,778
- Blog Entries
- 10
- Thanks Given
- 1,106
- Thanked 1,472x in 1,192 Posts
- Rep Power
- 158
Re: unbreakable
Hopefully, to unbreakable access internet encryptions.
Originally Posted by mkirkpatrick Time independence: [∂E(g)]˛=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: ¶a(t)·¶r(t)=c˛
- 08-02-2008, 11:33 AM #4Moderator
- Join Date
- Aug 2005
- Location
- United Kingdom
- Posts
- 11,621
- Blog Entries
- 5
- Thanks Given
- 295
- Thanked 896x in 724 Posts
- Rep Power
- 154
Re: unbreakable Originally Posted by AntonioLao 
That would bring an end to internet banking then?
regards michael.Humilty,coupled with boldness,surprises truth to
reveal herself?
- 08-12-2008, 12:47 PM #5Raider of the lost time
- Join Date
- Nov 2003
- Location
- United States
- Posts
- 11,778
- Blog Entries
- 10
- Thanks Given
- 1,106
- Thanked 1,472x in 1,192 Posts
- Rep Power
- 158
Re: unbreakable
On the contrary more secure but someone breakin to my account last few weeks and zero out and negative the balance. Originally Posted by mkirkpatrick Time independence: [∂E(g)]˛=[∂F(a)×∂r(a)]·[∂F(b)×∂r(b)] and Mass independence: ¶a(t)·¶r(t)=c˛
Reply With QuoteThread Information
Users Browsing this Thread
There are currently 1 users browsing this thread. (0 members and 1 guests)
Posting Permissions
Powered by vBulletin® Version 4.1.11
Copyright © 2012 vBulletin Solutions, Inc. All rights reserved.
Content Relevant URLs by vBSEO 3.6.0
Copyright © 2012 vBulletin Solutions, Inc. All rights reserved.
Content Relevant URLs by vBSEO 3.6.0
All times are GMT -4. The time now is 07:49 AM.
vBulletin 4.0 skin by CompleteVB
