[19254] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

RE: crypto for the average programmer

daemon@ATHENA.MIT.EDU (Whyte, William)
Wed Dec 14 16:31:42 2005

X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Wed, 14 Dec 2005 14:16:10 -0500
From: "Whyte, William" <WWhyte@ntru.com>
To: "Travis H." <solinym@gmail.com>,
	"Peter Gutmann" <pgut001@cs.auckland.ac.nz>
Cc: <cryptography@metzdowd.com>


> On 12/14/05, Peter Gutmann <pgut001@cs.auckland.ac.nz> wrote:
> > I don't know if there's any site tracking this, but (as the=20
> tutorial says) you
> > can either go with PKCS #1 (the de facto standard, easy to=20
> implement and
> > widely used) ...
>=20
> Actually, I'm embarassed to admit this but I've seen PKCS before but
> never with enough context to know what it was; I thought it was some
> kind of RSA proprietary mumbo-jumbo.  But, oh dear, it involves ASN.1.
>  That rules out use by the layperson.  I've run into ASN.1 before with
> regard to SNMP, and it struck me as infinitely more complex than
> anything I'd ever need to query packet counts on my router.

Have a look at PKCS#1. There's hardly any ASN.1 in it at all and
the structures are relatively simple. There's also a PKCS examples
document that talks you through it.

William

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com

home help back first fref pref prev next nref lref last post