Impossible Analysis Paper at Crypto98

Vladimir Z. Nuri vznuri at netcom.com
Thu Sep 10 12:11:39 PDT 1998



a proof that you have an unbreakable cypher has a lot
of implications to the P=?NP question. if the analysis
is novel and elegant, than it might very well leads to
insights into P=?NP of computer science.






More information about the cypherpunks-legacy mailing list