* Stephan V Bechtolsheim wrote on Fri, Jun 05, 2009 at 18:20 -0700:
> > This is hardly anything remotely resembling a formal proof,
> > of course. But it should give you the basic idea -- it's a
> > difficult problem because the numbers are big.
> Your argument only applies to "your algorithm". The question is
> whether there exists something else besides a trial / brute
> force / clever brute force approach.

If I understood correctly, there is an algorithm known that
solves it in polynominal time, the Shor-Algorithm, which is
running on any suited quantum computer :-) Some other
algorithms for machines able to run non-deterministic algorithms
would also be possible I think (I'm not sure if this is really
true that having a non-deterministic-machine would be sufficient.
Is it?).

So I think it is a difficult problem because the numbers are big
and the computers are small :-)

oki,

Steffen


 
About Ingenico: Ingenico is the world’s leading provider of payment solutions, 
with over 15 million terminals deployed across the globe. Delivering the very 
latest secure electronic payment technologies, transaction management and the 
widest range of value added services, Ingenico is shaping the future direction 
of the payment solutions market. Leveraging on its global presence and local 
expertise, Ingenico is reinforcing its leadership by taking banks and 
businesses beyond payment through offering comprehensive solutions, a true 
source of differentiation and new revenues streams.
 This message may contain confidential and/or privileged information. If you 
are not the addressee or authorized to receive this for the addressee, you must 
not use, copy, disclose or take any action based on this message or any 
information herein. If you have received this message in error, please advise 
the sender immediately by reply e-mail and delete this message. Thank you for 
your cooperation.
 P Please consider the environment before printing this e-mail
 
 
______________________________________________________________________
OpenSSL Project                                 http://www.openssl.org
User Support Mailing List                    openssl-users@openssl.org
Automated List Manager                           majord...@openssl.org

Reply via email to