Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
--***************************************************************************--
-- IEEE Std 1609.2: Base Data Types --
--***************************************************************************--
/**
* @brief NOTE: Section references in this file are to clauses in IEEE Std
* 1609.2 unless indicated otherwise. Full forms of acronyms and
* abbreviations used in this file are specified in 3.2.
*/
Ieee1609Dot2BaseTypes {iso(1) identified-organization(3) ieee(111)
standards-association-numbered-series-standards(2) wave-stds(1609) dot2(2)
base(1) base-types(2) major-version-2(2) minor-version-2(2)}
DEFINITIONS AUTOMATIC TAGS ::= BEGIN
EXPORTS ALL;
--***************************************************************************--
-- Integer Types --
--***************************************************************************--
/**
* @class Uint3
*
* @brief This atomic type is used in the definition of other data structures.
* It is for non-negative integers up to 7, i.e., (hex)07.
*/
Uint3 ::= INTEGER (0..7)
/**
* @class Uint8
*
* @brief This atomic type is used in the definition of other data structures.
* It is for non-negative integers up to 255, i.e., (hex)ff.
*/
Uint8 ::= INTEGER (0..255)
/**
* @class Uint16
*
* @brief This atomic type is used in the definition of other data structures.
* It is for non-negative integers up to 65,535, i.e., (hex)ff ff.
*/
Uint16 ::= INTEGER (0..65535)
/**
* @class Uint32
*
* @brief This atomic type is used in the definition of other data structures.
* It is for non-negative integers up to 4,294,967,295, i.e.,
* (hex)ff ff ff ff.
*/
Uint32 ::= INTEGER (0..4294967295)
/**
* @class Uint64
*
* @brief This atomic type is used in the definition of other data structures.
* It is for non-negative integers up to 18,446,744,073,709,551,615, i.e.,
* (hex)ff ff ff ff ff ff ff ff.
*/
Uint64 ::= INTEGER (0..18446744073709551615)
/**
* @class SequenceOfUint8
*
* @brief This type is used for clarity of definitions.
*/
SequenceOfUint8 ::= SEQUENCE OF Uint8
/**
* @class SequenceOfUint16
*
* @brief This type is used for clarity of definitions.
*/
SequenceOfUint16 ::= SEQUENCE OF Uint16
--***************************************************************************--
-- OCTET STRING Types --
--***************************************************************************--
/**
* @class Opaque
*
* @brief This is a synonym for ASN.1 OCTET STRING, and is used in the
* definition of other data structures.
*/
Opaque ::= OCTET STRING
/**
* @class HashedId3
*
* @brief This type contains the truncated hash of another data structure.
* The HashedId3 for a given data structure is calculated by calculating the
* hash of the encoded data structure and taking the low-order three bytes of
* the hash output. If the data structure is subject to canonicalization it
* is canonicalized before hashing. The low-order three bytes are the last
* three bytes of the hash when represented in network byte order. See
* Example below.
*
* <br><br><b>Example</b>: Consider the SHA-256 hash of the empty string:
*
* <br>SHA-256("") =
* e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b78<b>52b855</b>
*
* <br><br>The HashedId3 derived from this hash corresponds to the following:
*
* <br>HashedId3 = 52b855.
*/
HashedId3 ::= OCTET STRING (SIZE(3))
/**
* @class SequenceOfHashedId3
*
* @brief This type is used for clarity of definitions.
*/
SequenceOfHashedId3 ::= SEQUENCE OF HashedId3
/**
* @class HashedId8
*
* @brief This type contains the truncated hash of another data structure.
* The HashedId8 for a given data structure is calculated by calculating the
* hash of the encoded data structure and taking the low-order eight bytes of
* the hash output. If the data structure is subject to canonicalization it
* is canonicalized before hashing. The low-order eight bytes are the last
* eight bytes of the hash when represented in network byte order. See
* Example below.
*
* <br><br>The hash algorithm to be used to calculate a HashedId8 within a
* structure depends on the context. In this standard, for each structure
* that includes a HashedId8 field, the corresponding text indicates how the
* hash algorithm is determined.
*
* <br><br><b>Example</b>: Consider the SHA-256 hash of the empty string:
*
* <br>SHA-256("") =
* e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934c<b>a495991b7852b855</b>
*
* <br><br>The HashedId8 derived from this hash corresponds to the following:
*
* <br>HashedId8 = a495991b7852b855.
*/
HashedId8 ::= OCTET STRING (SIZE(8))
/**
* @class HashedId10
*
* @brief This type contains the truncated hash of another data structure.
* The HashedId10 for a given data structure is calculated by calculating the
* hash of the encoded data structure and taking the low-order ten bytes of
* the hash output. If the data structure is subject to canonicalization it
* is canonicalized before hashing. The low-order ten bytes are the last ten
* bytes of the hash when represented in network byte order. See Example below.
*
* <br><br>The hash algorithm to be used to calculate a HashedId10 within a
* structure depends on the context. In this standard, for each structure
* that includes a HashedId10 field, the corresponding text indicates how the
* hash algorithm is determined.
*
* <br><br><b>Example</b>: Consider the SHA-256 hash of the empty string:
*
* <br>SHA-256("") =
* e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b<b>934ca495991b7852b855</b>
*
* <br><br>The HashedId10 derived from this hash corresponds to the following:
*
* <br>HashedId10 = 934ca495991b7852b855.
*/
HashedId10 ::= OCTET STRING (SIZE(10))
/**
* @class HashedId32
*
* @brief This type contains the truncated hash of another data structure.
* The HashedId32 for a given data structure is calculated by calculating the
* hash of the encoded data structure and taking the low-order thirty two
* bytes of the hash output. If the data structure is subject to
* canonicalization it is canonicalized before hashing. The low-order thirty
* two bytes are the last thirty two bytes of the hash when represented in
* network byte order. See Example below.
*
* <br><br>The hash algorithm to be used to calculate a HashedId32 within a
* structure depends on the context. In this standard, for each structure
* that includes a HashedId32 field, the corresponding text indicates how the
* hash algorithm is determined.
*
* <br><br><b>Example</b>: Consider the SHA-256 hash of the empty string:
*
* <br>SHA-256("") =
* e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855
*
* <br><br>The HashedId32 derived from this hash corresponds to the following:
*
* <br>HashedId32 =
* e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855.
*/
HashedId32 ::= OCTET STRING (SIZE(32))
--***************************************************************************--
-- Time Structures --
--***************************************************************************--
/**
* @class Time32
*
* @brief This type gives the number of (TAI) seconds since 00:00:00 UTC, 1
* January, 2004.
*/
Time32 ::= Uint32
/**
* @class Time64
*
* @brief This type gives the number of (TAI) microseconds since 00:00:00
* UTC, 1 January, 2004.
*/
Time64 ::= Uint64
/**
* @class ValidityPeriod
*
* @brief This structure gives the validity period of a certificate. The
* start of the validity period is given by start and the end is given by
* start + duration.
*
* @param start contains the starting time of the validity period.
*
* @param duration contains the duration of the validity period.
*/
ValidityPeriod ::= SEQUENCE {
start Time32,
duration Duration
}
/**
* @class Duration
*
* @brief This structure represents the duration of validity of a
* certificate. The Uint16 value is the duration, given in the units denoted
* by the indicated choice. A year is considered to be 31556952 seconds,
* which is the average number of seconds in a year; if it is desired to map
* years more closely to wall-clock days, this can be done using the hours
* choice for up to seven years and the sixtyHours choice for up to 448. In
* this structure:
*
* @param microseconds contains the duration in microseconds.
*
* @param milliseconds contains the duration in milliseconds.
*
* @param seconds contains the duration in seconds.
*
* @param minutes contains the duration in minutes.
*
* @param hours contains the duration in hours.
*
* @param sixtyHours contains the duration in sixty-hour periods.
*
* @param years contains the duration in years.
*/
Duration ::= CHOICE {
microseconds Uint16,
milliseconds Uint16,
seconds Uint16,
minutes Uint16,
hours Uint16,
sixtyHours Uint16,
years Uint16
}
--***************************************************************************--
-- Location Structures --
--***************************************************************************--
/**
* @class GeographicRegion
*
* @brief This structure represents a geographic region of a specified form.
* A certificate is not valid if any part of the region indicated in its
* scope field lies outside the region indicated in the scope of its issuer.
*
* <br><br><b>Critical information fields</b>:
* <ul>
* <li> If present, this is a critical information field as defined in 5.2.6.
* An implementation that does not recognize the indicated CHOICE when
* verifying a signed SPDU shall indicate that the signed SPDU is invalid.</li>
*
* <li> If selected, rectangularRegion is a critical information field as
* defined in 5.2.6. An implementation that does not support the number of
* RectangularRegion in rectangularRegions when verifying a signed SPDU shall
* indicate that the signed SPDU is invalid. A compliant implementation shall
* support rectangularRegions fields containing at least eight entries.</li>
*
* <li> If selected, identifiedRegion is a critical information field as
* defined in 5.2.6. An implementation that does not support the number of
* IdentifiedRegion in identifiedRegion shall reject the signed SPDU as
* invalid. A compliant implementation shall support identifiedRegion fields
* containing at least eight entries.</li>
* </ul>
*
* <b>Parameters</b>:
*
* @param circularRegion contains a single instance of the CircularRegion
* structure.
*
* @param rectangularRegion is an array of RectangularRegion structures
* containing at least one entry. This field is interpreted as a series of
* rectangles, which may overlap or be disjoint. The permitted region is any
* point within any of the rectangles.
*
* @param polygonalRegion contains a single instance of the PolygonalRegion
* structure.
*
* @param identifiedRegion is an array of IdentifiedRegion structures
* containing at least one entry. The permitted region is any point within
* any of the identified regions.
*/
GeographicRegion ::= CHOICE {
circularRegion CircularRegion,
rectangularRegion SequenceOfRectangularRegion,
polygonalRegion PolygonalRegion,
identifiedRegion SequenceOfIdentifiedRegion,
...
}
/**
* @class CircularRegion
*
* @brief This structure specifies a circle with its center at center, its
* radius given in meters, and located tangential to the reference ellipsoid.
* The indicated region is all the points on the surface of the reference
* ellipsoid whose distance to the center point over the reference ellipsoid
* is less than or equal to the radius. A point which contains an elevation
* component is considered to be within the circular region if its horizontal
* projection onto the reference ellipsoid lies within the region.
*/
CircularRegion ::= SEQUENCE {
center TwoDLocation,
radius Uint16
}
/**
* @class RectangularRegion
*
* @brief This structure specifies a rectangle formed by connecting in
* sequence: (northWest.latitude, northWest.longitude), (southEast.latitude,
* northWest.longitude), (southEast.latitude, southEast.longitude), and
* (northWest.latitude, southEast.longitude). The points are connected by
* lines of constant latitude or longitude. A point which contains an
* elevation component is considered to be within the rectangular region if
* its horizontal projection onto the reference ellipsoid lies within the
* region. A RectangularRegion is valid only if the northWest value is north
* and west of the southEast value, i.e., the two points cannot have equal
* latitude or equal longitude.
*/
RectangularRegion ::= SEQUENCE {
northWest TwoDLocation,
southEast TwoDLocation
}
/**
* @class SequenceOfRectangularRegion
*
* @brief This type is used for clarity of definitions.
*/
SequenceOfRectangularRegion ::= SEQUENCE OF RectangularRegion
/**
* @class PolygonalRegion
*
* @brief This structure defines a region using a series of distinct
* geographic points, defined on the surface of the reference ellipsoid. The
* region is specified by connecting the points in the order they appear,
* with each pair of points connected by the geodesic on the reference
* ellipsoid. The polygon is completed by connecting the final point to the
* first point. The allowed region is the interior of the polygon and its
* boundary.
*
* <br><br>A point which contains an elevation component is considered to be
* within the polygonal region if its horizontal projection onto the
* reference ellipsoid lies within the region.
*
* <br><br>A valid PolygonalRegion contains at least three points. In a valid
* PolygonalRegion, the implied lines that make up the sides of the polygon
* do not intersect.
*
* <br><br><b>Critical information fields</b>:
* <ul>
* <li> If present, this is a critical information field as defined in 5.2.6.
* An implementation that does not support the number of TwoDLocation in the
* PolygonalRegion when verifying a signed SPDU shall indicate that the signed
* SPDU is invalid. A compliant implementation shall support PolygonalRegions
* containing at least eight TwoDLocation entries.</li>
* </ul>
*/
PolygonalRegion ::= SEQUENCE SIZE (3..MAX) OF TwoDLocation
/**
* @class TwoDLocation
*
* @brief This structure is used to define validity regions for use in
* certificates. The latitude and longitude fields contain the latitude and
* longitude as defined above.
*
* <br><br>NOTE: This data structure is consistent with the location encoding
* used in SAE J2735, except that values 900 000 001 for latitude (used to
* indicate that the latitude was not available) and 1 800 000 001 for
* longitude (used to indicate that the longitude was not available) are not
* valid.
*/
TwoDLocation ::= SEQUENCE {
latitude Latitude,
longitude Longitude
}
/**
* @class IdentifiedRegion
*
* @brief This structure indicates the region of validity of a certificate
* using region identifiers.
*
* <br><br><b>Critical information fields</b>:
* <ul>
* <li> If present, this is a critical information field as defined in 5.2.6.
* An implementation that does not recognize the indicated CHOICE when
* verifying a signed SPDU shall indicate that the signed SPDU is invalid.</li>
* </ul>
*/
IdentifiedRegion ::= CHOICE {
countryOnly CountryOnly,
countryAndRegions CountryAndRegions,
countryAndSubregions CountryAndSubregions,
...
}
/**
* @class SequenceOfIdentifiedRegion
*
* @brief This type is used for clarity of definitions.
*/
SequenceOfIdentifiedRegion ::= SEQUENCE OF IdentifiedRegion
/**
* @class CountryOnly
*
* @brief This is the integer representation of the country or area
* identifier as defined by the United Nations Statistics Division in October
* 2013 (see normative references in Clause 2).
*/
CountryOnly ::= Uint16
/**
* @class CountryAndRegions
*
* @brief In this structure:
*
* @param countryOnly is a CountryOnly as defined above.
*
* @param region identifies one or more regions within the country. If
* countryOnly indicates the United States of America, the values in this
* field identify the state or statistically equivalent entity using the
* integer version of the 2010 FIPS codes as provided by the U.S. Census
* Bureau (see normative references in Clause 2). For other values of
* countryOnly, the meaning of region is not defined in this version of this
* standard.
*/
CountryAndRegions ::= SEQUENCE {
countryOnly CountryOnly,
regions SequenceOfUint8
}
/**
* @class CountryAndSubregions
*
* @brief In this structure:
* <br><br><b>Critical information fields</b>:
* <ul>
* <li> If present, this is a critical information field as defined in 5.2.6.
* An implementation that does not recognize RegionAndSubregions or
* CountryAndSubregions values when verifying a signed SPDU shall indicate
* that the signed SPDU is invalid. A compliant implementation shall support
* CountryAndSubregions containing at least eight RegionAndSubregions
* entries.</li>
* </ul>
*
* <b>Parameters</b>:
*
* @param country is a CountryOnly as defined above.
*
* @param regionAndSubregions identifies one or more subregions within
* country. If country indicates the United States of America, the values in
* this field identify the county or county equivalent entity using the
* integer version of the 2010 FIPS codes as provided by the U.S. Census
* Bureau (see normative references in Clause 2). For other values of
* country, the meaning of regionAndSubregions is not defined in this version
* of this standard.
*/
CountryAndSubregions ::= SEQUENCE {
country CountryOnly,
regionAndSubregions SequenceOfRegionAndSubregions
}
/**
* @class RegionAndSubregions
*
* @brief In this structure:
* <br><br><b>Critical information fields</b>:
* <ul>
* <li> RegionAndSubregions is a critical information field as defined in
* 5.2.5. An implementation that does not detect or recognize the the region
* or subregions values when verifying a signed SPDU shall indicate that the
* signed SPDU is invalid.</li>
* </ul>
*
* <b>Parameters</b>:
*
* @param region identifies a region within a country as specified under
* CountryAndRegions.
*
* @param subregions identifies one or more subregions as specified under
* CountryAndSubregions.
*/
RegionAndSubregions ::= SEQUENCE {
region Uint8,
subregions SequenceOfUint16
}
/**
* @class SequenceOfRegionAndSubregions
*
* @brief This type is used for clarity of definitions.
*/
SequenceOfRegionAndSubregions ::= SEQUENCE OF RegionAndSubregions
/**
* @class ThreeDLocation
*
* @brief This structure contains an estimate of 3D location. The details of
* the structure are given in the definitions of the individual fields below.
*
* <br><br>NOTE: The units used in this data structure are consistent with the
* location data structures used in SAE J2735, though the encoding is
* incompatible.
*/
ThreeDLocation ::= SEQUENCE {
latitude Latitude,
longitude Longitude,
elevation Elevation
}
/**
* @class Latitude
*
* @brief This type contains an INTEGER encoding an estimate of the latitude
* with precision 1/10th microdegree relative to the World Geodetic System
* (WGS)-84 datum as defined in NIMA Technical Report TR8350.2.
*/
Latitude ::= NinetyDegreeInt
/**
* @class Longitude
*
* @brief This type contains an INTEGER encoding an estimate of the longitude
* with precision 1/10th microdegree relative to the World Geodetic System
* (WGS)-84 datum as defined in NIMA Technical Report TR8350.2.
*/
Longitude ::= OneEightyDegreeInt
/**
* @class Elevation
*
* @brief This structure contains an estimate of the geodetic altitude above
* or below the WGS84 ellipsoid. The 16-bit value is interpreted as an
* integer number of decimeters representing the height above a minimum
* height of −409.5 m, with the maximum height being 6143.9 m.
*/
Elevation ::= Uint16
/**
* @class NinetyDegreeInt
*
* @brief The integer in the latitude field is no more than 900,000,000 and
* no less than −900,000,000, except that the value 900,000,001 is used to
* indicate the latitude was not available to the sender.
*/
NinetyDegreeInt ::= INTEGER {
min (-900000000),
max (900000000),
unknown (900000001)
} (-900000000..900000001)
/**
* @class KnownLatitude
*
* @brief The known latitudes are from -900,000,000 to +900,000,000 in 0.1
* microdegree intervals.
*/
KnownLatitude ::= NinetyDegreeInt (min..max)
/**
* @class UnknownLatitude
*
* @brief The value 900,000,001 indicates that the latitude was not
* available to the sender.
*/
UnknownLatitude ::= NinetyDegreeInt (unknown)
/**
* @class OneEightyDegreeInt
*
* @brief The integer in the longitude field is no more than 1,800,000,000
* and no less than −1,799,999,999, except that the value 1,800,000,001 is
* used to indicate that the longitude was not available to the sender.
*/
OneEightyDegreeInt ::= INTEGER {
min (-1799999999),
max (1800000000),
unknown (1800000001)
} (-1799999999..1800000001)
/**
* @class KnownLongitude
*
* @brief The known longitudes are from -1,799,999,999 to +1,800,000,000 in
* 0.1 microdegree intervals.
*/
KnownLongitude ::= OneEightyDegreeInt (min..max)
/**
* @class UnknownLongitude
*
* @brief The value 1,800,000,001 indicates that the longitude was not
* available to the sender.
*/
UnknownLongitude ::= OneEightyDegreeInt (unknown)
--***************************************************************************--
-- Crypto Structures --
--***************************************************************************--
/**
* @class Signature
*
* @brief This structure represents a signature for a supported public key
* algorithm. It may be contained within SignedData or Certificate.
*
* <br><br><b>Critical information fields</b>: If present, this is a critical
* information field as defined in 5.2.5. An implementation that does not
* recognize the indicated CHOICE for this type when verifying a signed SPDU
* shall indicate that the signed SPDU is invalid.
*/
Signature ::= CHOICE {
ecdsaNistP256Signature EcdsaP256Signature,
ecdsaBrainpoolP256r1Signature EcdsaP256Signature,
...,
ecdsaBrainpoolP384r1Signature EcdsaP384Signature
}
/**
* @class EcdsaP256Signature
*
* @brief This structure represents an ECDSA signature. The signature is
* generated as specified in 5.3.1.
*
* <br><br>If the signature process followed the specification of FIPS 186-4
* and output the integer r, r is represented as an EccP256CurvePoint
* indicating the selection x-only.
*
* <br><br>If the signature process followed the specification of SEC 1 and
* output the elliptic curve point R to allow for fast verification, R is
* represented as an EccP256CurvePoint indicating the choice compressed-y-0,
* compressed-y-1, or uncompressed at the sender’s discretion.
*
* <br><br>Encoding considerations: If this structure is encoded for hashing,
* the EccP256CurvePoint in rSig shall be taken to be of form x-only.
*
* <br><br>NOTE: When the signature is of form x-only, the x-value in rSig is
* an integer mod n, the order of the group; when the signature is of form
* compressed-y-*, the x-value in rSig is an integer mod p, the underlying
* prime defining the finite field. In principle this means that to convert a
* signature from form compressed-y-* to form x-only, the x-value should be
* checked to see if it lies between n and p and reduced mod n if so. In
* practice this check is unnecessary: Haase’s Theorem states that difference
* between n and p is always less than 2*square-root(p), and so the chance
* that an integer lies between n and p, for a 256-bit curve, is bounded
* above by approximately square-root(p)/p or 2^(−128). For the 256-bit
* curves in this standard, the exact values of n and p in hexadecimal are:
*
* <br><br>NISTp256:
* <ul>
* <li> p = FFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF
* </li>
* <li> n = FFFFFFFF00000000FFFFFFFFFFFFFFFFBCE6FAADA7179E84F3B9CAC2FC632551
* </li>
* </ul>
*
* Brainpoolp256:
* <ul>
* <li> p = A9FB57DBA1EEA9BC3E660A909D838D726E3BF623D52620282013481D1F6E5377
* </li>
* <li> n = A9FB57DBA1EEA9BC3E660A909D838D718C397AA3B561A6F7901E0E82974856A7
* </li>
* </ul>
*/
EcdsaP256Signature ::= SEQUENCE {
rSig EccP256CurvePoint,
sSig OCTET STRING (SIZE (32))
}
/**
* @class EcdsaP384Signature
*
* @brief This structure represents an ECDSA signature. The signature is
* generated as specified in 5.3.1.
*
* <br><br>If the signature process followed the specification of FIPS 186-4
* and output the integer r, r is represented as an EccP384CurvePoint
* indicating the selection x-only.
*
* <br><br>If the signature process followed the specification of SEC 1 and
* output the elliptic curve point R to allow for fast verification, R is
* represented as an EccP384CurvePoint indicating the choice compressed-y-0,
* compressed-y-1, or uncompressed at the sender’s discretion.
*
* <br><br>Encoding considerations: If this structure is encoded for hashing,
* the EccP256CurvePoint in rSig shall be taken to be of form x-only.
*
* <br><br>NOTE: When the signature is of form x-only, the x-value in rSig is
* an integer mod n, the order of the group; when the signature is of form
* compressed-y-*, the x-value in rSig is an integer mod p, the underlying
* prime defining the finite field. In principle this means that to convert a
* signature from form compressed-y-* to form x-only, the x-value should be
* checked to see if it lies between n and p and reduced mod n if so. In
* practice this check is unnecessary: Haase’s Theorem states that difference
* between n and p is always less than 2*square-root(p), and so the chance
* that an integer lies between n and p, for a 384-bit curve, is bounded
* above by approximately square-root(p)/p or 2^(−192). For the 384-bit curve
* in this standard, the exact values of n and p in hexadecimal are:
* <ul>
* <li> p = 8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B412B1DA197FB71123
* ACD3A729901D1A71874700133107EC53</li>
*
* <li> n = 8CB91E82A3386D280F5D6F7E50E641DF152F7109ED5456B31F166E6CAC0425A7
* CF3AB6AF6B7FC3103B883202E9046565</li>
* </ul>
*/
EcdsaP384Signature ::= SEQUENCE {
rSig EccP384CurvePoint,
sSig OCTET STRING (SIZE (48))
}
/**
* @class EccP256CurvePoint
*
* @brief This structure specifies a point on an elliptic curve in
* Weierstrass form defined over a 256-bit prime number. This encompasses
* both NIST p256 as defined in FIPS 186-4 and Brainpool p256r1 as defined in
* RFC 5639. The fields in this structure are OCTET STRINGS produced with the
* elliptic curve point encoding and decoding methods defined in subclause
* 5.5.6 of IEEE Std 1363-2000. The x-coordinate is encoded as an unsigned
* integer of length 32 octets in network byte order for all values of the
* CHOICE; the encoding of the y-coordinate y depends on whether the point is
* x-only, compressed, or uncompressed. If the point is x-only, y is omitted.
* If the point is compressed, the value of type depends on the least
* significant bit of y: if the least significant bit of y is 0, type takes
* the value compressed-y-0, and if the least significant bit of y is 1, type
* takes the value compressed-y-1. If the point is uncompressed, y is encoded
* explicitly as an unsigned integer of length 32 octets in network byte order.
*/
EccP256CurvePoint ::= CHOICE {
x-only OCTET STRING (SIZE (32)),
fill NULL,
compressed-y-0 OCTET STRING (SIZE (32)),
compressed-y-1 OCTET STRING (SIZE (32)),
uncompressedP256 SEQUENCE {
x OCTET STRING (SIZE (32)),
y OCTET STRING (SIZE (32))
}
}
/**
* @class EccP384CurvePoint
*
* @brief This structure specifies a point on an elliptic curve in
* Weierstrass form defined over a 384-bit prime number. The only supported
* such curve in this standard is Brainpool p384r1 as defined in RFC 5639.
* The fields in this structure are OCTET STRINGS produced with the elliptic
* curve point encoding and decoding methods defined in subclause 5.5.6 of
* IEEE Std 1363-2000. The x-coordinate is encoded as an unsigned integer of
* length 48 octets in network byte order for all values of the CHOICE; the
* encoding of the y-coordinate y depends on whether the point is x-only,
* compressed, or uncompressed. If the point is x-only, y is omitted. If the
* point is compressed, the value of type depends on the least significant
* bit of y: if the least significant bit of y is 0, type takes the value
* compressed-y-0, and if the least significant bit of y is 1, type takes the
* value compressed-y-1. If the point is uncompressed, y is encoded
* explicitly as an unsigned integer of length 48 octets in network byte order.
*/
EccP384CurvePoint ::= CHOICE {
x-only OCTET STRING (SIZE (48)),
fill NULL,
compressed-y-0 OCTET STRING (SIZE (48)),
compressed-y-1 OCTET STRING (SIZE (48)),
uncompressedP384 SEQUENCE {
x OCTET STRING (SIZE (48)),
y OCTET STRING (SIZE (48))
}
}
/**
* @class SymmAlgorithm
*
* @brief This enumerated value indicates supported symmetric algorithms. The
* only symmetric algorithm supported in this version of this standard is
* AES-CCM as specified in 5.3.7.
*/
SymmAlgorithm ::= ENUMERATED {
aes128Ccm,
...
}
/**
* @class HashAlgorithm
*
* @brief This structure identifies a hash algorithm. The value is sha256,
* indicates SHA-256 as specified in 5.3.3. The value sha384 indicates
* SHA-384 as specified in 5.3.3.
*
* <br><br><b>Critical information fields</b>: This is a critical information
* field as defined in 5.2.6. An implementation that does not recognize the
* enumerated value of this type in a signed SPDU when verifying a signed
* SPDU shall indicate that the signed SPDU is invalid.
*/
HashAlgorithm ::= ENUMERATED {
sha256,
...,
sha384
}
/**
* @class EciesP256EncryptedKey
*
* @brief This data structure is used to transfer a 16-byte symmetric key
* encrypted using ECIES as specified in IEEE Std 1363a-2004.
*
* <br><br>Encryption and decryption are carried out as specified in 5.3.4.
*
* <br><br><b>Parameters</b>:
*
* @param v is the sender’s ephemeral public key, which is the output V from
* encryption as specified in 5.3.4.
*
* @param c is the encrypted symmetric key, which is the output C from
* encryption as specified in 5.3.4. The algorithm for the symmetric key is
* identified by the CHOICE indicated in the following SymmetricCiphertext.
*
* @param t is the authentication tag, which is the output tag from
* encryption as specified in 5.3.4.
*/
EciesP256EncryptedKey ::= SEQUENCE {
v EccP256CurvePoint,
c OCTET STRING (SIZE (16)),
t OCTET STRING (SIZE (16))
}
/**
* @class EncryptionKey
*
* @brief This structure contains an encryption key, which may be a public or
* a symmetric key.
*/
EncryptionKey ::= CHOICE {
public PublicEncryptionKey,
symmetric SymmetricEncryptionKey
}
/**
* @class PublicEncryptionKey
*
* @brief This structure specifies a public encryption key and the associated
* symmetric algorithm which is used for bulk data encryption when encrypting
* for that public key.
*/
PublicEncryptionKey ::= SEQUENCE {
supportedSymmAlg SymmAlgorithm,
publicKey BasePublicEncryptionKey
}
/**
* @class BasePublicEncryptionKey
*
* @brief This structure specifies the bytes of a public encryption key for a
* particular algorithm. The only algorithm supported is ECIES over either
* the NIST P256 or the Brainpool P256r1 curve as specified in 5.3.4.
*/
BasePublicEncryptionKey ::= CHOICE {
eciesNistP256 EccP256CurvePoint,
eciesBrainpoolP256r1 EccP256CurvePoint,
...
}
/**
* @class PublicVerificationKey
*
* @brief This structure represents a public key and states with what
* algorithm the public key is to be used. Cryptographic mechanisms are
* defined in 5.3.
*
* <br><br>An EccP256CurvePoint or EccP384CurvePoint within a
* PublicVerificationKey structure is invalid if it indicates the choice
* x-only.
*
* <br><br><b>Critical information fields</b>: If present, this is a critical
* information field as defined in 5.2.6. An implementation that does not
* recognize the indicated CHOICE when verifying a signed SPDU shall indicate
* that the signed SPDU is invalid.
*/
PublicVerificationKey ::= CHOICE {
ecdsaNistP256 EccP256CurvePoint,
ecdsaBrainpoolP256r1 EccP256CurvePoint,
...,
ecdsaBrainpoolP384r1 EccP384CurvePoint
}
/**
* @class SymmetricEncryptionKey
*
* @brief This structure provides the key bytes for use with an identified
* symmetric algorithm. The only supported symmetric algorithm is AES-128 in
* CCM mode as specified in 5.3.7.
*/
SymmetricEncryptionKey ::= CHOICE {
aes128Ccm OCTET STRING(SIZE(16)),
...
}
--***************************************************************************--
-- PSID / ITS-AID --
--***************************************************************************--
/**
* @class PsidSsp
*
* @brief This structure represents the permissions that the certificate
* holder has with respect to data for a single application area, identified
* by a Psid. If the ServiceSpecificPermissions field is omitted, it
* indicates that the certificate holder has the default permissions
* associated with that Psid.
*
* <br><br><b>Consistency with signed SPDU</b>. As noted in 5.1.1,
* consistency between the SSP and the signed SPDU is defined by rules
* specific to the given PSID and is out of scope for this standard.
*
* <br><br><b>Consistency with issuing certificate</b>.
*
* <br><br>If a certificate has an appPermissions entry A for which the ssp
* field is omitted, A is consistent with the issuing certificate if the
* issuing certificate contains a PsidSspRange P for which the following holds:
* <ul>
* <li> The psid field in P is equal to the psid field in A and one of the
* following is true:</li>
* <ul>
* <li> The sspRange field in P indicates all.</li>
*
* <li> The sspRange field in P indicates opaque and one of the entries in
* opaque is an OCTET STRING of length 0.</li>
* </ul>
* </ul>
*
* For consistency rules for other forms of the ssp field, see the
* following subclauses.
*/
PsidSsp ::= SEQUENCE {
psid Psid,
ssp ServiceSpecificPermissions OPTIONAL
}
/**
* @class SequenceOfPsidSsp
*
* @brief This type is used for clarity of definitions.
*/
SequenceOfPsidSsp ::= SEQUENCE OF PsidSsp
/**
* @class Psid
*
* @brief This type represents the PSID defined in IEEE Std 1609.12.
*/
Psid ::= INTEGER (0..MAX)
/**
* @class SequenceOfPsid
*
* @brief This type is used for clarity of definitions.