Theodore Hong schrieb:
>
> Ian Clarke <ian at octayne.com> wrote:
> > On Mon, Aug 21, 2000 at 09:21:59PM +0700, Oskar Sandberg wrote:
> > > And we better hope somebody invents a Quantum proof Assymetric algorithm
> > > within the next four years - so that the inevitable patent has time to
> > > expire before our current version grow completely pointless.
> >
> > I am not an expert on this, but I have a suspicion that quantum
> > computers can crack *any* assymetric algorithm, present or future.
>
> probably true - a general purpose quantum computer should be able to solve
> exponential problems in linear time. since as far as I understand modern
> cryptography is based on the infeasibility of exponential computation,
> we'll need something completely different.
something based on
f(long a,b)
{
var long c;
var long t=a;
for(c=0;c++;c==b){
t=pow(t,a);
}
return t;
}
where pow(a,b) means a to the bth power.
(excuse my bad C-syntax.. i don't use C. i hope you can understand what
it should mean)
of course we'd need quantum-computers for crypto, then.
> theo
--
Machine-Independent, adj.:
Does not run on any existing machine.
_______________________________________________
Freenet-dev mailing list
Freenet-dev at lists.sourceforge.net
http://lists.sourceforge.net/mailman/listinfo/freenet-dev
