| home | help | back | first | fref | pref | prev | next | nref | lref | last | post |
X-Original-To: cryptography@metzdowd.com X-Original-To: cryptography@metzdowd.com Date: Sun, 16 Nov 2003 10:30:33 -0500 To: Eugen Leitl <eugen@leitl.org>, cryptography@metzdowd.com From: Tim Dierks <tim@dierks.org> In-Reply-To: <20031114105251.GD922@leitl.org> At 05:52 AM 11/14/2003, Eugen Leitl wrote: >Does anyone have robust code to generate globally unique IDs which won't >break XML parsing, >and work on several platforms? > >I was thinking of using an entropy pool to seed a cryptographic PRNG, used to >generate a sequence of SHA-1 hashes, dumped to an XML-armored representation. This is what GUIDs/UUIDs were designed for, and they're used broadly. They're standardized in ISO 11578 [1], although there's a very similar public description in an expired Internet Draft [2]. Microsoft also publishes a description of how they generate their GUIDs, but I can't find it right now. - Tim [1] http://www.iso.ch/iso/en/CatalogueDetailPage.CatalogueDetail?CSNUMBER=2229&ICS1=35&ICS2=100&ICS3=70 [2] http://www.ics.uci.edu/~ejw/authoring/uuid-guid/draft-leach-uuids-guids-01.txt PS - I'm looking for a full-time job. My resume is at http://www.dierks.org/tim/resume.html . Looking for architecture or technical management jobs; I'm in New York, NY, but I am willing to relocate. --------------------------------------------------------------------- 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 |