[107760] in Cypherpunks

home help back first fref pref prev next nref lref last post

[Humor] Million Bit Keys

daemon@ATHENA.MIT.EDU (Eric Cordian)
Fri Jan 22 14:20:30 1999

From: Eric Cordian <emc@wire.insync.net>
To: cypherpunks@cyberpass.net
Date: Fri, 22 Jan 1999 13:05:01 -0600 (CST)
Reply-To: Eric Cordian <emc@wire.insync.net>

From an online newsletter on High Performance Computing, a surprise
appearance by our friends at Meganet, inventors of Virtual Matrix
Encryption.
 
We know it must be good, because...
 
A.  They have applied for patents in 72 countries.
B.  They have invented a polynomial time non-probabilistic primality test.
C.  It's been 8 months, and no one has responded to the VME Challenge.
D.  They mention Bruce's book.
 
-----
 
Tarzana, CA -- Meganet Corporation, who challenged Microsoft, Intel,
Dell, AT&T, NCR and many other high tech companies with their
unbreakable Virtual Matrix Encryption, have finished filing for a
worldwide patent for VME in 72 countries around the world. This is a
major step in making VME the de-facto encryption standard worldwide.
VME have filed for a patent in the following 72 countries:
 
AL - Albania, AM -- Armenia, AT - Austria, AU - Australia, AZ -
Azerbaijan, BA - Bosnia & Herzegovina, BB - Barbados, BG - Bulgaria,
BR - Brazil, BY - Belarus, CA - Canada, CH - Switzerland, LI -
Liechtenstein, CN - China, CU - Cuba, CZ - Czech Republic, DE -
Germany, DK - Denmark, EE - Estonia, ES - Spain, FI - Finland, GB -
United Kingdom, GE - Georgia, GH - Ghana, GM - Gambia, GW -
Guinea-Bissau, HR - Croatia, HU - Hungary, ID - Indonesia, IL -
Israel, IS - Iceland, JP - Japan, KE - Kenya, KG - Kyrgy/stan, KP -
Democratic People's Republic of Korea, KR - Republic of Korea, KZ -
Kazakhstan, LC - Saint Lucia, LK - Sri Lanka, LR - Liberia, LS -
Lesotho, LT - Lithuania, LU - Luxembourg, LV - Latvia, MD - Republic
of Moldova, MG - Madgascar, MK - Republic of Macedonia, MN -
Mongolia, MW - Malawi, MX - Mexico, NO - Norway, NZ - New Zealand, PL
- Poland, PT - Portugal, RO - Romania, RU - Russian Federation, SD -
Sudan, SE - Sweden, SG - Singapore, SI - Slovenia, SK - Slovakia, SL -
Sierra Leone, TJ - Tajikistan, TM - Turkmenistan, TR - Turkey, TT -
Trinidad & Tobago, UA - Ukraine, UG - Uganda, US - United States of
America, UZ - Uzbekistan, VN - Vietnam, YU- Yugoslavia, ZW - Zimbabwe.
 
There has been a tremendous worldwide response to Meganet
Corporation's announcement last week of the result of 13 years of
Research & Development in the prime number testing area -- the world's
first and only POLYNOMIAL TIME, 100% DETERMINISTIC PRIMALITY TESTING.
It is NOT a probabilistic test like the other algorithms in the
market, but 100% deterministic. The algorithm is in POLYNOMIAL TIME,
therefore much faster than even the probabilistic algorithms. Meganet
Corporation have implemented the algorithm in an ANSI C application
running on a single CPU 450 MHz PC Computer. Some sample results:
 
1,000 bits primality test  --  0.11 Sec
2,000 bits primality test  --  0.87 Sec
4,000 bits primality test  --  6.98 Sec
8,000 bits primality test  --  55.81 Sec
16,000 bits primality test  --  7.44 Min
32,000 bits primality test  --  59.53 Min
64,000 bits primality test  --  7.94 Hours
128,000 bits primality test  --  2.65 Days
 
Corporations such as IBM research labs, AT&T research Labs, Nokia IP
research labs & hundreds other research labs around the world have
flooded Meganet Corporation with inquiries about this worldwide
mathematical breakthrough.
 
Those results are unheard of. The 1,000 bits test on a Sparc II
workstation takes 5 Minutes and it is still only PROBABALISTIC
Rabin-Miller test (Applied Cryptography II). The gap in time is much
greater for larger bit sizes.
 
The major breakthrough is solving a 400 year old mathematical problem
-- how to positively identify a prime number without spending
exponential time in dividing the number by all the primes up to its
root. The solution Meganet Corporation have developed is based on a
newly designed Mathematical Sequence called the T-Sequence. Once a
number is transformed to the T-Sequence, its quadratic residue has
definitive characteristics if it's a prime number that can be easily
determined in polynomial time by performing a binary decomposition.
 
This latest development further establishes the status of Meganet
Corporation as a leader in the Data Security & Encryption field.
Meganet Corporation is the developer of Virtual Matrix Encryption,
which is the strongest available encryption product in the market,
including the PROVEN unbreakable Virtual Matrix Algorithm and a 1
MILLION BIT SYMMETRIC KEY. The retail product is sold nationwide for
over 8 months now, and the ongoing $ 1,200,000.00 challenge to break
VME is at it's 8th month with no challenger. The challenges emphasizes
Meganet Corporation's confidence that VME is an unbreakable algorithm.
 
For further information visit http://www.meganet.com

-- 
Eric Michael Cordian 0+
O:.T:.O:. Mathematical Munitions Division
"Do What Thou Wilt Shall Be The Whole Of The Law"
 


home help back first fref pref prev next nref lref last post