I'm a bit of a newbie and am trying to get some clarification and better
understanding on an issue (spurred by Seifred's controversial article):
How does using Stanford SRP solve (or does it?) verification, the MITM
problem, and need for a CA?
http://www-cs-students.stanford.edu/~tjw/srp/project.html
-Sean
--
+-----=[export-a-crypto-system-sig RSA-3-lines-PERL]=-----+
|#!/bin/perl -sp0777i<X+d*lMLa^*lN%0]dsXx++lMlN/dsM0<j]dsj|
|$/=unpack('H*',$_);$_=`echo 16dio\U$k"SK$/SM$n\EsN0p[lN*1|
|lK[d2%Sa2/d0$^Ixp"|dc`;s/\W//g;$_=pack('H*',/((..)*)$/) |
+--------=[http://www.cypherspace.org/~adam/rsa/]=--------+
"Most people would rather die than think, and most people do."
-- Bertrand Russell
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
