Re: Factoring problem, solved
From: robert j. kolker (nowhere_at_nowhere.net)
Date: 01/20/05
- Next message: Hormel Trappitus: "test message sci.crypt"
- Previous message: Paul Rubin: "Re: Combine Secure 3DES Encryption with ability to count occurence of known plaintext - how to accomodate both aims?"
- In reply to: jstevh_at_msn.com: "Factoring problem, solved"
- Next in thread: Brian Hetrick: "Re: Factoring problem, solved"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 19 Jan 2005 19:45:43 -0500
jstevh@msn.com wrote:
>
> It is CRITICAL that the information be taken seriously as soon as
> possible so that some other method can be used for Internet security,
> and quickly implemented.
Submit your stuff to a reputable mathematics journal or have a
mathematician with an established repuatation read and vet your stuff.
Until then you have made an unsubstantied claim, which is empty and
worthless.
Bob Kolker
- Next message: Hormel Trappitus: "test message sci.crypt"
- Previous message: Paul Rubin: "Re: Combine Secure 3DES Encryption with ability to count occurence of known plaintext - how to accomodate both aims?"
- In reply to: jstevh_at_msn.com: "Factoring problem, solved"
- Next in thread: Brian Hetrick: "Re: Factoring problem, solved"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
