Re: Evaluation of MegaSnakeOil by "expert" + "Primes in P"

From: Chris Card (ctcard_at_hotmail.com)
Date: 10/10/03 

Date: 10 Oct 2003 06:56:31 -0700

contact@technosoft21.com (Benjamin Choi) wrote in message news:<2ca0a833.0310090111.186f6e63@posting.google.com>...
> Ha, found this on MegaSnakeOil website:
<snipped>
> Jaime Milstein, Ph.D.
His cv certainly looks impressive, but doesn't seem to cover anything
related to cryptanalysis. His email address is there too, so I guess
you could ask him directly what cryptanalysis he performed.

I also browsed the Meganet site, and spotted this interesting item in
the news archive:

http://www.meganet.com/News/press/pressrelease12-30-98.htm

<BEGIN QUOTE>

MAJOR WORLDWIDE MATHEMATICAL BREAKTHROUGH – MEGANET CORPORATION
DEVELOPED FAST 100% DETERMINISTIC PRIME NUMBER TESTING. IT IS THE ONLY
DETERMINISTIC ALGORITHM IN THE WORLD TO WORK IN POLYNOMIAL TIME

--------------------------------------------------------------------------------
 
DECEMBER 30, 1998

Meganet Corporation, the company that challenged Microsoft (NASDAQ:
MSFT), Intel (NASDAQ: INTC), Dell (NASDAQ: DELL), AT&T (NYSE: T), NCR
(NYSE: NCR) and many other high tech companies with their unbreakable
Virtual Matrix Encryption, has announced today 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.5 Sec
2,000 bits primality test - 1 Sec
3,000 bits primality test - 3 Sec
4,000 bits primality test - 8 Sec
5,000 bits primality test - 15 Sec
6,000 bits primality test - 26 Sec
7,000 bits primality test
 - 41 Sec
8,000 bits primality test - 1:01Min
9,000 bits primality test - 1:27 Min
10,000 bits primality test - 1:58 Min

Those results are heretofore unheard of. The 1,000 bits test on a
Sparc II workstation takes 5 Minutes and it is still only
PROBABALISTIC. The gap in time is much greater for larger bit sizes.

The major breakthrough solves 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 has 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.

It's important to emphasize that there is a 100% mathematical proof
behind their T-Sequence, and further, it is a complete working product
tested successfully on over 1.3 million numbers without a single
mistake.

Meganet Corporation is seeking companies interested in this algorithm,
which generates large industrial grade prime numbers at record speeds,
and would be glad to demonstrate the technology to any interested
party on request.

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.

<END QUOTE>
Strangely that's the last mention of it! I wonder if A, K & S know?
:-)

Chris

Relevant Pages

  • Re: returning none when it should be returning a list?
    ... It divide next by the list of previous ... Your basic algorithm as described above sounds workable, ... the Sieve of Eratosthenesis a relatively simple ... If you want to look further into the subject, see the Primality Test ...
    (comp.lang.python)
  • Re: Towards a Formula for Primes
    ... The problem of finding an *efficient* test for primes, well, ... runs in polynomial time. ... use the "efficient" AKS test? ... to see a primality test that runs as fast as a coprimality test - now ...
    (sci.math)
  • Re: Towards a Formula for Primes
    ... runs in polynomial time. ... Which makes it efficient in a technical sense, but not in a real world ... to see a primality test that runs as fast as a coprimality test - now ... That is why the person I called "Herbert Herbert" (to spare his ...
    (sci.math)
  • Re: Another twin primes conjecture
    ... > being a quick primality test. ... the best known algorithm for this problem works in O). ... Assuming that my understanding of HPC is correct then your HPC-HPC ... Since there are already prime checker implementations no ...
    (sci.math)