[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: KeyNote
Ron,
you may be right about the implementation. I was thinking about something
else.
I've been thinking for some time that we should formalize such a naming for
encryption algorithms, to cut down on some of the relatively valueless
offerings on sci.crypt (ie., someone presents a "new algorithm" which is
merely another statement in such a key naming using well known primitives).
Your proposal fit in with that earlier wish of mine, even though we're
not talking about general encryption algorithms here, only signature verification.
- Carl
At 05:54 PM 4/5/97 EST, Ron Rivest wrote:
>
>I was thinking of the more functional style early on, but thought you
>(or others) might object to the extra implementation cost, so I
>limited it to one function call per statement. I still prefer the one
>function call per statement, because of the more complex semantic
>issues that come up with the more general style (e.g. in what order
>are arguments evaluated, what about common subexpressions, how are
>errors handled, etc.). But if you want to make this work, we can.
>But I think it is important that the sequential style always be an
>option; the functional style you are proposing is basically just
>taking some variable that is only defined once and only used once, and
>moving its definition to its use.
>
> Cheers,
> Ron
>==============================================================================
>To: spki@c2.net
>From: Carl Ellison <cme@cybercash.com>
>Subject: Re: "KeyNote" -- how to describe cryptographic keys.
>Cc: blampson@microsoft.com, burt@rsa.com
>
>At 03:56 PM 4/5/97 -0500, Carl Ellison wrote:
>> wouldn't it be even clearer to use:
>>
>> (public-key (let object-hash (md5 object))
>> (equal object-hash (rsa signature (const &03)(const &0435))))
>
>Or, for that matter,
>
> (public-key (equal (md5 object) (rsa signature (const &03)(const &0435))))
>
>?
>
>
>+------------------------------------------------------------------+
>|Carl M. Ellison cme@cybercash.com http://www.clark.net/pub/cme |
>|CyberCash, Inc. http://www.cybercash.com/ |
>|207 Grindall Street PGP 2.6.2: 61E2DE7FCB9D7984E9C8048BA63221A2 |
>|Baltimore MD 21230-4103 T:(410) 727-4288 F:(410)727-4293 |
>+------------------------------------------------------------------+
>
>
>
>
+------------------------------------------------------------------+
|Carl M. Ellison cme@cybercash.com http://www.clark.net/pub/cme |
|CyberCash, Inc. http://www.cybercash.com/ |
|207 Grindall Street PGP 2.6.2: 61E2DE7FCB9D7984E9C8048BA63221A2 |
|Baltimore MD 21230-4103 T:(410) 727-4288 F:(410)727-4293 |
+------------------------------------------------------------------+
References:
- KeyNote
- From: rivest@theory.lcs.mit.edu (Ron Rivest)