Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^4: Email security for monks?

by opqdonut (Acolyte)
on Oct 05, 2004 at 19:04 UTC ( #396724=note: print w/replies, xml ) Need Help??


in reply to Re^3: Email security for monks?
in thread Email security for monks?

What a good idea! I wonder if asymmetric key authentication could be implemented on perlmonks and other sites like slashdot so I wouldn't have to care about passwords.

I've always thought that rsa (or PGP) key authentication is the way to go, passwords are such a bother :)


J

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://396724]
help
Chatterbox?
[marto]: and until recently it wasn't and arguable (for some samples) probably isn't
[Veltro]: How did we get here? Oh yeah, advertisement. So let's get back there. What I ment to say is that I think it is possible to create an algorithm that filters out advertisement
[Veltro]: And yes, maybe your decoder needs the cloud to do so.
[marto]: for sane sources you should be able to do that locally

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (8)
As of 2018-05-24 12:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?