Re: Suggested Requirements for Multi-part Multi-Structured 822 Encoding
"Ned Freed, Postmaster" <NED@hmcvax.claremont.edu> Tue, 02 April 1991 00:02 UTC
Received: from dimacs.rutgers.edu by NRI.NRI.Reston.VA.US id aa06765; 1 Apr 91 19:02 EST
Received: by dimacs.rutgers.edu (5.59/SMI4.0/RU1.4/3.08) id AA05767; Mon, 1 Apr 91 18:44:19 EST
Received: from FRIGGA.CLAREMONT.EDU by dimacs.rutgers.edu (5.59/SMI4.0/RU1.4/3.08) id AA05761; Mon, 1 Apr 91 18:44:15 EST
Date: Mon, 01 Apr 1991 15:43:00 -0800
From: "Ned Freed, Postmaster" <NED@hmcvax.claremont.edu>
Subject: Re: Suggested Requirements for Multi-part Multi-Structured 822 Encoding
To: lau@eng.sun.com
Cc: ietf-smtp@dimacs.rutgers.edu
Message-Id: <C0B9DA4B18A0097C@HMCVAX.CLAREMONT.EDU>
X-Envelope-To: ietf-smtp@dimacs.rutgers.edu
X-Vms-To: IN%"lau@Eng.Sun.COM"
X-Vms-Cc: IN%"ietf-smtp@dimacs.rutgers.edu"
Sorry, I misspoke myself -- I gave the wrong reason why Dash-Count: can fail. I implied that it had something to do with line wrapping. This is incorrect. Dash-count: fails in the face of line truncation as opposed to line wrapping. Yes, some mailers truncate rather than wrap. If the part of the line or lines that gets truncated contains a dash, you're sunk. Cookies are immune to truncation so long as they are short enough not to get truncated. In practice they can be made short enough that this condition is met in all reasonable situations. It is also incorrect to characterize cookies as a two pass scheme. Properly implemented cookies are two pass in only a tiny percentage (literally one in 3E38) of cases. If you generate a very random string for use as a cookie (for example, take the current date/time as a string, concatenate your system name and the message headers onto it, and run it all through the MD4 algorithm (RFC1186), finally representing the result using the base-64 encoding that's already part of the RFC, which gives you a 24 character string) you can just assume that it never appears in the message. Of course, to be on the safe side, you scan the message as you process it and look for the string (just on the off chance, although realistically the chances of your hardware failing are much greater than the chance that you'll find the string), and just start over if you do find it in there! This approach may in fact take many passes, but on the average it takes one (and the standard deviation is, well, kinda small ;-). Dash counting, on the other hand, always takes two passes. Every time. Ned
- Suggested Requirements for Multi-part Multi-Struc… David Robinson
- Re: Suggested Requirements for Multi-part Multi-S… Dave Crocker
- Re: Suggested Requirements for Multi-part Multi-S… Ned Freed, Postmaster
- Re: Suggested Requirements for Multi-part Multi-S… Mark Crispin
- Re: Suggested Requirements for Multi-part Multi-S… Ned Freed, Postmaster
- Re: Suggested Requirements for Multi-part Multi-S… Vincent Lau
- Re: Suggested Requirements for Multi-part Multi-S… Steve Kille
- Re: Suggested Requirements for Multi-part Multi-S… Steve Kille
- Re: Suggested Requirements for Multi-part Multi-S… Ned Freed, Postmaster
- Re: Suggested Requirements for Multi-part Multi-S… Ned Freed, Postmaster