Re: If you found a way of factoring large numbers fast...
- From: Phil Carmody <thefatphil_demunged@xxxxxxxxxxx>
- Date: 10 Mar 2006 09:28:17 +0200
"Tuvas" <tuvas21@xxxxxxxxx> writes:
I am taking a class in cryptology now, and we had the following
question come up. If you were suddenly struck with a way to factor a
large number fast, or to do a discrete log fast, what would you do?
First, in private, find out how fast "fast" is. I.e. the growth of
the work factor for problems of various sizes.
Then try to find challenges that you believe you on your own can
attack. The obvious ones would be the RSA factoring challenges,
of course.
If there is no known challenge, find the current record, and make
beating that your own personal challenge.
Start your machines crunching - beat the challenge you've chosen.
In the meantime, put on a batch of berry wine, or something.
When you have the result, publish it on sci.math, sci.crypt, the
NMBRTHRY mailing list, or other relevant places. Claim your prize
money if appropriate. Drink your berry wine.
You don't have to work out who to contact next, as the people who
are most interested will now contact you.
Deep down, you can't beat _results_ to prove that your theory is
sound in the field of computational number theory.
Phil
--
What is it: is man only a blunder of God, or God only a blunder of man?
-- Friedrich Nietzsche (1844-1900), The Twilight of the Gods
.
- Follow-Ups:
- References:
- Prev by Date: Re: Algorithm that can build Hierarchic Key Establishment
- Next by Date: Re: Algorithm that can build Hierarchic Key Establishment
- Previous by thread: Re: If you found a way of factoring large numbers fast...
- Next by thread: Re: If you found a way of factoring large numbers fast...
- Index(es):
Relevant Pages
|
