Jo o h h n L L a rm o o u u th Id e n n t tify in n g g IS O a a n n d d I IT U - T A A S N N .1 . R a p p p p o o rte u r o b je e c c ts – th e e j.larmouth@salford.ac.uk A S N .1 a a p p p ro a c h Study G St Grou oup 1 7 7 ASN. 1 Stud udy G Group up 1 7 7 Note, for best viewing, this presentation needs the Dom Casual and Brush Script fonts. ASN 1
S p e e a a k e rs p p re e a a m b le e n n o te e s s (SE)X-rated. Leave now, or shut me up. n Olivier Dubuisson or Phil Griffin might be better presenters. n But I was part of the Blood Spilling in 1985: Verbose n characters or computer-friendly numerics; new RA or re-use existing ones. Everyone likes their own identification scheme (particularly in n the MoU!). I am NOT selling ASN.1 OIDs as the universal solution for everything, but they ARE used and useful. Dry, boring, not sexy and very simple, with not much to say! n Stud udy G Group up 1 7 7 ASN 1
W h h y y t th h e e ra in b o w ? n An infinity of colours n A secondary rainbow (did you see it?) n Others to an infinity of internal reflections n Not really relevant, but it is a nice picture! n But an infinity of arcs and an infinity of depth is what OIDs are about Stud udy G Group up 1 7 7 ASN 1
T h e A A S N .1 a p p ro a c h t to id e n tific a tio n n One of many, many approaches n Is basically very simple n Has proved useful in many environments n Can be used without using ASN.1 n Unfortunately, it is hard to present it in a sexy way! Bu t I I w ill t il l try ! Stud udy G Group up 1 7 7 ASN 1
T h e re a re m m a n y a a p p ro a c h e s to o b je c t id id e n tific a tio n n Bar codes are well known n IP addresses are a binary form n URLs are well-known n URNs are less well-known n NSAP addresses are unused today n UUIDs are important too Stud udy G Group up 1 7 7 ASN 1
W h a t a a re e th e e d iffe e r re e n n c e s ? n Some are character-based, some are binary n Some need central allocation, others have various levels of hierarchy n Some are fixed length, others are variable length n To some extent it is horses for courses n They all are sisters! Stud udy G Group up 1 7 7 ASN 1
A re e O ID s n e e w w to th e e M o U M G ? n No! n Presented to the Geneva Business Objects Summit in November 2000 by William Lyons n Banking.ppt Stud udy G Group up 1 7 7 ASN 1
S o .. W W h a t is th t e m m e c h a n is m ? n A hierarchical structure of registration authorities n An object identifier tree n Arcs are numbered (zero to infinity) n Infinitely many arcs from each node n An RA allocates arcs beneath its node to subordinate RAs, and so on, to an infinite depth n Objects are identified by the path from the root to a leaf (or intermediate node) Stud udy G Group up 1 7 7 ASN 1
A s s m a ll p a rt o f t th e e O ID t tre e e e – G G e e t H H u n g ! Root joint-iso-itu-t (2) itu-t (0) iso (1) identified-organisation (3) ( Ofen called ICD ) standard recommendation(0) (0) dod (6) set (42) 8571 ISO: National Bodies: BSI: set- Companies House number vendors (9) oss (12) internet (1) abstract-syntax (2) Stud udy G Group up 1 7 7 ASN 1
N o o ta t tio n s a a n d e n c o o d d in g s o o f O f ID s n Very compact binary encoding (normally used in all computer comms except XML), see next slide n Simplest character encoding (used for XML and other Internet protocols) is (for example) 1.0.8571.2.29 n More readable (for human consumption) is {iso standard 8571 abstract-syntax (2) pci (29) } n Or {itu-t recommendation x 1081 pictures (0) le o n n a a r rd o (3)} P ic tu re f fo o l llo o w w s ! Stud udy G Group up 1 7 7 ASN 1
T h e b b i in n a a ry e n n c c o d d i in g n Roughly one octet per component n Uses bit 8 as a more bit n Top two components handled specially n {0 0} to {0 39} encodes into one octet only n {1 0} to {1 39} encodes into one octet only n {2 0} to {2 47} encodes into one octet only n {2 48} on will use two or more octets A n n d d n n o w th e p p ic tu re ! Stud udy G Group up 1 7 7 ASN 1
T h e e E E d ito r's v v e e rs r io n Stud udy G Group up 1 7 7 ASN 1
T h e o ffic ia l v v e rs io io n ! Stud udy G Group up 1 7 7 ASN 1
Bu t l le e t t's s e e e th e e (tw o ) v v id e e o o s ! n Not much to do with ASN.1 Object Identifiers, but I think interesting! n Part of the work of ITU-T SG17 n First an introduction by Leonardo himself, then a review of the Recommendation n (Click on the black display to start the video, and when finished click outside the video area to move to the next slide) Stud udy G Group up 1 7 7 ASN 1
Bu t o o n e m o re re p ic tu re re f firs rs t Stud udy G Group up 1 7 7 ASN 1
Stud udy G Group up 1 7 7 ASN 1
Stud udy G Group up 1 7 7 ASN 1
Ba a c c k to O O ID s a a g a a in i ! n Here is an OASIS of tranquillity: {oasis (2) tech-committees (45) xcbf(20) standard (0) version (2002)} or 2.45.20.0.2002 or <xxx xmlns="urn:oid:2.45.20.0.2002">…<\xxx> Stud udy G Group up 1 7 7 ASN 1
T ry a a n o th e e r r! n Facilitation of trade: {un-cefact(2) edi(50) invoice(0) version-2004(2) } or 2.50.0.2 or <xxx xmlns="urn:oid:2.50.0.2">…<\xxx> Stud udy G Group up 1 7 7 ASN 1
A re e a a l o n e n Face recognition: {iso standard 19794 part(5) version(1) } or 1.0.19794.5.1 or <xxx xmlns="urn:oid:1.0.19794.5.1">…<\xxx> Stud udy G Group up 1 7 7 ASN 1
IT T U U - T T T S A G R R e c o m m m m e e n d a tio n n Was requested to devise a uniform approach for XML namespace specification across all ITU-T Recommendations n Asked SG17 for advice n Was advised to recommend the use of the form: <xxx xmlns="urn:oid:0.0.6. ….">…<\xxx> Stud udy G Group up 1 7 7 ASN 1
W h a t a b o u t U U U U I ID s ? n Universally unique identifiers n Verbose – 128 bits (but only = 16 chars) n ISO/IEC 9834-8 | ITU-T Rec X.667 n Can self-generate OIDs at the rate of about 10 million per second n Unambiguous over the next 2000 years n Can optionally register them n OID is 2.25.xxx….. Stud udy G Group up 1 7 7 ASN 1
T im e e fo f r a n o th e e r p r p ic tu re e ! ! O ID s p p ro v id e e le e v v e e ls l in l le e v v e e l ls Stud udy G Group up 1 7 7 ASN 1
A ll v e e r ry g o o d , b u t a re e th e e y y u s e e d d ? n Not really very much? Depends on comparators! n Only 59,000 known to be allocated! Certainly many more in reality. n Telephone numbers will do better! n But in their field, OIDs have had a pretty good take-up n See http://oid.elibel.tm.fr Stud udy G Group up 1 7 7 ASN 1
S e e c c u rity a a lg o rith m u u s e e s s o o f O ID s n This is one area where OIDs are universally used. n Use a Digital Certificate, and you use an OID. – Secure Hash Algorithm 2 (SHA2) { joint-iso-itu-t(2) country(16) us(840) organization(1) gov(101) csor(3) nistAlgorithm(4) hashAlgs(2) – RSA Encryption { iso(1) member-body(2) us(840) rsadsi(113549) pkcs(1) 1 1 } Stud udy G Group up 1 7 7 ASN 1
O th e e r a r a re e a a s n Many ITU-T Recommendations n Biometrics and other ISO Standards n Many US ANSI X.9 specifications n US Banking specifications n UPU and international carrier parcel tracking n 3GPP Mobile phones n Not as widespread as bar-codes, but heavily used in computer communications protocols Stud udy G Group up 1 7 7 ASN 1
W W e e bs u p p p p o o rt n Go to http://oid.elibel.tm.fr n Number of OIDs n Details about an OID n Provide details about a (new) allocation of an OID n Much additional information Stud udy G Group up 1 7 7 ASN 1
T h e e E lib e e l O l O ID p a g e Stud udy G Group up 1 7 7 ASN 1
N N e e a r F F u u t tu u r re s n Web services (SOAP and all that) support to register or obtain UUID-based OIDs n Fast Web services support n Courtesy of the ITU-T TSB, France Telecom, Sun Microsystems, and OSS Nokalva Stud udy G Group up 1 7 7 ASN 1
R e q q u u e s ts f fo o r r to o p p - le v e l a a l llo c a a tio t n n s s n Formally, contact the ITU-T TSB or ISO/IEC SC6 Secretariat, for the attention of the ASN.1 Rapporteur, in both cases. n Informally, contact j.larmouth@salford.ac.uk Stud udy G Group up 1 7 7 ASN 1
Recommend
More recommend
