forked from usnistgov/ACVP
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdraft-celi-acvp-block-ciph-00.html
5268 lines (5193 loc) · 151 KB
/
draft-celi-acvp-block-ciph-00.html
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
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html lang="en" xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head profile="http://www.w3.org/2006/03/hcard http://dublincore.org/documents/2008/08/04/dc-html/">
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii" />
<title>ACVP Symmetric Block Cipher Algorithm JSON Specification</title>
<style type="text/css" title="Xml2Rfc (sans serif)">
/*<![CDATA[*/
a {
text-decoration: none;
}
/* info code from SantaKlauss at http://www.madaboutstyle.com/tooltip2.html */
a.info {
/* This is the key. */
position: relative;
z-index: 24;
text-decoration: none;
}
a.info:hover {
z-index: 25;
color: #FFF; background-color: #900;
}
a.info span { display: none; }
a.info:hover span.info {
/* The span will display just on :hover state. */
display: block;
position: absolute;
font-size: smaller;
top: 2em; left: -5em; width: 15em;
padding: 2px; border: 1px solid #333;
color: #900; background-color: #EEE;
text-align: left;
}
a.smpl {
color: black;
}
a:hover {
text-decoration: underline;
}
a:active {
text-decoration: underline;
}
address {
margin-top: 1em;
margin-left: 2em;
font-style: normal;
}
body {
color: black;
font-family: verdana, helvetica, arial, sans-serif;
font-size: 10pt;
max-width: 55em;
}
cite {
font-style: normal;
}
dd {
margin-right: 2em;
}
dl {
margin-left: 2em;
}
ul.empty {
list-style-type: none;
}
ul.empty li {
margin-top: .5em;
}
dl p {
margin-left: 0em;
}
dt {
margin-top: .5em;
}
h1 {
font-size: 14pt;
line-height: 21pt;
page-break-after: avoid;
}
h1.np {
page-break-before: always;
}
h1 a {
color: #333333;
}
h2 {
font-size: 12pt;
line-height: 15pt;
page-break-after: avoid;
}
h3, h4, h5, h6 {
font-size: 10pt;
page-break-after: avoid;
}
h2 a, h3 a, h4 a, h5 a, h6 a {
color: black;
}
img {
margin-left: 3em;
}
li {
margin-left: 2em;
margin-right: 2em;
}
ol {
margin-left: 2em;
margin-right: 2em;
}
ol p {
margin-left: 0em;
}
p {
margin-left: 2em;
margin-right: 2em;
}
pre {
margin-left: 3em;
background-color: lightyellow;
padding: .25em;
}
pre.text2 {
border-style: dotted;
border-width: 1px;
background-color: #f0f0f0;
width: 69em;
}
pre.inline {
background-color: white;
padding: 0em;
}
pre.text {
border-style: dotted;
border-width: 1px;
background-color: #f8f8f8;
width: 69em;
}
pre.drawing {
border-style: solid;
border-width: 1px;
background-color: #f8f8f8;
padding: 2em;
}
table {
margin-left: 2em;
}
table.tt {
vertical-align: top;
}
table.full {
border-style: outset;
border-width: 1px;
}
table.headers {
border-style: outset;
border-width: 1px;
}
table.tt td {
vertical-align: top;
}
table.full td {
border-style: inset;
border-width: 1px;
}
table.tt th {
vertical-align: top;
}
table.full th {
border-style: inset;
border-width: 1px;
}
table.headers th {
border-style: none none inset none;
border-width: 1px;
}
table.left {
margin-right: auto;
}
table.right {
margin-left: auto;
}
table.center {
margin-left: auto;
margin-right: auto;
}
caption {
caption-side: bottom;
font-weight: bold;
font-size: 9pt;
margin-top: .5em;
}
table.header {
border-spacing: 1px;
width: 95%;
font-size: 10pt;
color: white;
}
td.top {
vertical-align: top;
}
td.topnowrap {
vertical-align: top;
white-space: nowrap;
}
table.header td {
background-color: gray;
width: 50%;
}
table.header a {
color: white;
}
td.reference {
vertical-align: top;
white-space: nowrap;
padding-right: 1em;
}
thead {
display:table-header-group;
}
ul.toc, ul.toc ul {
list-style: none;
margin-left: 1.5em;
margin-right: 0em;
padding-left: 0em;
}
ul.toc li {
line-height: 150%;
font-weight: bold;
font-size: 10pt;
margin-left: 0em;
margin-right: 0em;
}
ul.toc li li {
line-height: normal;
font-weight: normal;
font-size: 9pt;
margin-left: 0em;
margin-right: 0em;
}
li.excluded {
font-size: 0pt;
}
ul p {
margin-left: 0em;
}
.comment {
background-color: yellow;
}
.center {
text-align: center;
}
.error {
color: red;
font-style: italic;
font-weight: bold;
}
.figure {
font-weight: bold;
text-align: center;
font-size: 9pt;
}
.filename {
color: #333333;
font-weight: bold;
font-size: 12pt;
line-height: 21pt;
text-align: center;
}
.fn {
font-weight: bold;
}
.hidden {
display: none;
}
.left {
text-align: left;
}
.right {
text-align: right;
}
.title {
color: #990000;
font-size: 18pt;
line-height: 18pt;
font-weight: bold;
text-align: center;
margin-top: 36pt;
}
.vcardline {
display: block;
}
.warning {
font-size: 14pt;
background-color: yellow;
}
@media print {
.noprint {
display: none;
}
a {
color: black;
text-decoration: none;
}
table.header {
width: 90%;
}
td.header {
width: 50%;
color: black;
background-color: white;
vertical-align: top;
font-size: 12pt;
}
ul.toc a::after {
content: leader('.') target-counter(attr(href), page);
}
ul.ind li li a {
content: target-counter(attr(href), page);
}
.print2col {
column-count: 2;
-moz-column-count: 2;
column-fill: auto;
}
}
@page {
@top-left {
content: "Internet-Draft";
}
@top-right {
content: "December 2010";
}
@top-center {
content: "Abbreviated Title";
}
@bottom-left {
content: "Doe";
}
@bottom-center {
content: "Expires June 2011";
}
@bottom-right {
content: "[Page " counter(page) "]";
}
}
@page:first {
@top-left {
content: normal;
}
@top-right {
content: normal;
}
@top-center {
content: normal;
}
}
/*]]>*/
</style>
<link href="#rfc.toc" rel="Contents">
<link href="#rfc.section.1" rel="Chapter" title="1 Introduction">
<link href="#rfc.section.1.1" rel="Chapter" title="1.1 Requirements Language">
<link href="#rfc.section.2" rel="Chapter" title="2 Supported Block Cipher Algorithms">
<link href="#rfc.section.3" rel="Chapter" title="3 Test Types and Test Coverage">
<link href="#rfc.section.3.1" rel="Chapter" title="3.1 Monte Carlo tests for block ciphers">
<link href="#rfc.section.3.1.1" rel="Chapter" title="3.1.1 AES Monte Carlo Test - ECB mode">
<link href="#rfc.section.3.1.2" rel="Chapter" title="3.1.2 AES Monte Carlo Test - CBC mode">
<link href="#rfc.section.3.1.3" rel="Chapter" title="3.1.3 AES Monte Carlo Test - CBC-CS* mode">
<link href="#rfc.section.3.1.4" rel="Chapter" title="3.1.4 AES Monte Carlo Test - OFB mode">
<link href="#rfc.section.3.1.5" rel="Chapter" title="3.1.5 AES Monte Carlo Test - CFB1 mode">
<link href="#rfc.section.3.1.6" rel="Chapter" title="3.1.6 AES Monte Carlo Test - CFB8 mode">
<link href="#rfc.section.3.1.7" rel="Chapter" title="3.1.7 AES Monte Carlo Test - CFB128 mode">
<link href="#rfc.section.3.1.8" rel="Chapter" title="3.1.8 AES Monte Carlo Key Shuffle">
<link href="#rfc.section.3.1.9" rel="Chapter" title="3.1.9 TDES Monte Carlo Test - ECB mode">
<link href="#rfc.section.3.1.10" rel="Chapter" title="3.1.10 TDES Monte Carlo Test - CBC mode">
<link href="#rfc.section.3.1.11" rel="Chapter" title="3.1.11 TDES Monte Carlo Test - CBC-I mode">
<link href="#rfc.section.3.1.12" rel="Chapter" title="3.1.12 TDES Monte Carlo Test - CFB1, CFB8, CFB64 modes">
<link href="#rfc.section.3.1.13" rel="Chapter" title="3.1.13 TDES Monte Carlo Test - CFB1-P, CFB8-P, CFB64-P modes">
<link href="#rfc.section.3.1.14" rel="Chapter" title="3.1.14 TDES Monte Carlo Test - OFB mode">
<link href="#rfc.section.3.1.15" rel="Chapter" title="3.1.15 TDES Monte Carlo Test - OFB-I mode">
<link href="#rfc.section.3.2" rel="Chapter" title="3.2 Test Coverage">
<link href="#rfc.section.3.2.1" rel="Chapter" title="3.2.1 AES Requirements Covered">
<link href="#rfc.section.3.2.2" rel="Chapter" title="3.2.2 AES Requirements Not Covered">
<link href="#rfc.section.3.2.3" rel="Chapter" title="3.2.3 TDES Requirements Covered">
<link href="#rfc.section.3.2.4" rel="Chapter" title="3.2.4 TDES Requirements Not Covered">
<link href="#rfc.section.3.2.5" rel="Chapter" title="3.2.5 AEAD Requirements Covered">
<link href="#rfc.section.3.2.6" rel="Chapter" title="3.2.6 AEAD Requirements Not Covered">
<link href="#rfc.section.3.2.7" rel="Chapter" title="3.2.7 KeyWrap Requirements Covered">
<link href="#rfc.section.3.2.8" rel="Chapter" title="3.2.8 KeyWrap Requirements Not Covered">
<link href="#rfc.section.3.2.9" rel="Chapter" title="3.2.9 Format-Preserving Encryption Requirements Covered">
<link href="#rfc.section.3.2.10" rel="Chapter" title="3.2.10 Format-Preserving Encryption Requirements Not Covered">
<link href="#rfc.section.4" rel="Chapter" title="4 Capabilities Registration">
<link href="#rfc.section.4.1" rel="Chapter" title="4.1 Required Prerequisite Algorithms for Block Cipher Validations">
<link href="#rfc.section.4.2" rel="Chapter" title="4.2 Block Cipher Algorithm Capabilities JSON Values">
<link href="#rfc.section.5" rel="Chapter" title="5 Test Vectors">
<link href="#rfc.section.5.1" rel="Chapter" title="5.1 Test Groups">
<link href="#rfc.section.5.2" rel="Chapter" title="5.2 Test Cases">
<link href="#rfc.section.6" rel="Chapter" title="6 Test Vector Responses">
<link href="#rfc.section.7" rel="Chapter" title="7 Acknowledgements">
<link href="#rfc.section.8" rel="Chapter" title="8 IANA Considerations">
<link href="#rfc.section.9" rel="Chapter" title="9 Security Considerations">
<link href="#rfc.references" rel="Chapter" title="10 References">
<link href="#rfc.references.1" rel="Chapter" title="10.1 Normative References">
<link href="#rfc.references.2" rel="Chapter" title="10.2 Informative References">
<link href="#rfc.appendix.A" rel="Chapter" title="A Example Capabilities JSON Object">
<link href="#rfc.appendix.B" rel="Chapter" title="B Example Vector Set Request/Responses JSON Object">
<link href="#rfc.appendix.C" rel="Chapter" title="C Example TDES Test and Results JSON Object">
<link href="#rfc.appendix.D" rel="Chapter" title="D Example TDES MCT Test and Results JSON Object">
<link href="#rfc.authors" rel="Chapter">
<meta name="generator" content="xml2rfc version 2.21.1 - https://tools.ietf.org/tools/xml2rfc" />
<link rel="schema.dct" href="http://purl.org/dc/terms/" />
<meta name="dct.creator" content="Celi, C., Ed." />
<meta name="dct.identifier" content="urn:ietf:id:draft-celi-block-ciph-00-1.0" />
<meta name="dct.issued" scheme="ISO8601" content="2019-02-01" />
<meta name="dct.abstract" content="This document defines the JSON schema for using symmetric block cipher algorithms with the ACVP specification." />
<meta name="description" content="This document defines the JSON schema for using symmetric block cipher algorithms with the ACVP specification." />
</head>
<body>
<table class="header">
<tbody>
<tr>
<td class="left">TBD</td>
<td class="right">C. Celi, Ed.</td>
</tr>
<tr>
<td class="left">Internet-Draft</td>
<td class="right">National Institute of Standards and Technology</td>
</tr>
<tr>
<td class="left">Intended status: Informational</td>
<td class="right">February 1, 2019</td>
</tr>
<tr>
<td class="left">Expires: August 5, 2019</td>
<td class="right"></td>
</tr>
</tbody>
</table>
<p class="title">ACVP Symmetric Block Cipher Algorithm JSON Specification<br />
<span class="filename">draft-celi-block-ciph-00-1.0</span></p>
<h1 id="rfc.abstract"><a href="#rfc.abstract">Abstract</a></h1>
<p>This document defines the JSON schema for using symmetric block cipher algorithms with the ACVP specification.</p>
<h1 id="rfc.status"><a href="#rfc.status">Status of This Memo</a></h1>
<p>This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.</p>
<p>Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.</p>
<p>Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."</p>
<p>This Internet-Draft will expire on August 5, 2019.</p>
<h1 id="rfc.copyrightnotice"><a href="#rfc.copyrightnotice">Copyright Notice</a></h1>
<p>Copyright (c) 2019 IETF Trust and the persons identified as the document authors. All rights reserved.</p>
<p>This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.</p>
<hr class="noprint" />
<h1 class="np" id="rfc.toc"><a href="#rfc.toc">Table of Contents</a></h1>
<ul class="toc">
<li>1. <a href="#rfc.section.1">Introduction</a>
</li>
<ul><li>1.1. <a href="#rfc.section.1.1">Requirements Language</a>
</li>
</ul><li>2. <a href="#rfc.section.2">Supported Block Cipher Algorithms</a>
</li>
<li>3. <a href="#rfc.section.3">Test Types and Test Coverage</a>
</li>
<ul><li>3.1. <a href="#rfc.section.3.1">Monte Carlo tests for block ciphers</a>
</li>
<ul><li>3.1.1. <a href="#rfc.section.3.1.1">AES Monte Carlo Test - ECB mode</a>
</li>
<li>3.1.2. <a href="#rfc.section.3.1.2">AES Monte Carlo Test - CBC mode</a>
</li>
<li>3.1.3. <a href="#rfc.section.3.1.3">AES Monte Carlo Test - CBC-CS* mode</a>
</li>
<li>3.1.4. <a href="#rfc.section.3.1.4">AES Monte Carlo Test - OFB mode</a>
</li>
<li>3.1.5. <a href="#rfc.section.3.1.5">AES Monte Carlo Test - CFB1 mode</a>
</li>
<li>3.1.6. <a href="#rfc.section.3.1.6">AES Monte Carlo Test - CFB8 mode</a>
</li>
<li>3.1.7. <a href="#rfc.section.3.1.7">AES Monte Carlo Test - CFB128 mode</a>
</li>
<li>3.1.8. <a href="#rfc.section.3.1.8">AES Monte Carlo Key Shuffle</a>
</li>
<li>3.1.9. <a href="#rfc.section.3.1.9">TDES Monte Carlo Test - ECB mode</a>
</li>
<li>3.1.10. <a href="#rfc.section.3.1.10">TDES Monte Carlo Test - CBC mode</a>
</li>
<li>3.1.11. <a href="#rfc.section.3.1.11">TDES Monte Carlo Test - CBC-I mode</a>
</li>
<li>3.1.12. <a href="#rfc.section.3.1.12">TDES Monte Carlo Test - CFB1, CFB8, CFB64 modes</a>
</li>
<li>3.1.13. <a href="#rfc.section.3.1.13">TDES Monte Carlo Test - CFB1-P, CFB8-P, CFB64-P modes</a>
</li>
<li>3.1.14. <a href="#rfc.section.3.1.14">TDES Monte Carlo Test - OFB mode</a>
</li>
<li>3.1.15. <a href="#rfc.section.3.1.15">TDES Monte Carlo Test - OFB-I mode</a>
</li>
</ul><li>3.2. <a href="#rfc.section.3.2">Test Coverage</a>
</li>
<ul><li>3.2.1. <a href="#rfc.section.3.2.1">AES Requirements Covered</a>
</li>
<li>3.2.2. <a href="#rfc.section.3.2.2">AES Requirements Not Covered</a>
</li>
<li>3.2.3. <a href="#rfc.section.3.2.3">TDES Requirements Covered</a>
</li>
<li>3.2.4. <a href="#rfc.section.3.2.4">TDES Requirements Not Covered</a>
</li>
<li>3.2.5. <a href="#rfc.section.3.2.5">AEAD Requirements Covered</a>
</li>
<li>3.2.6. <a href="#rfc.section.3.2.6">AEAD Requirements Not Covered</a>
</li>
<li>3.2.7. <a href="#rfc.section.3.2.7">KeyWrap Requirements Covered</a>
</li>
<li>3.2.8. <a href="#rfc.section.3.2.8">KeyWrap Requirements Not Covered</a>
</li>
<li>3.2.9. <a href="#rfc.section.3.2.9">Format-Preserving Encryption Requirements Covered</a>
</li>
<li>3.2.10. <a href="#rfc.section.3.2.10">Format-Preserving Encryption Requirements Not Covered</a>
</li>
</ul></ul><li>4. <a href="#rfc.section.4">Capabilities Registration</a>
</li>
<ul><li>4.1. <a href="#rfc.section.4.1">Required Prerequisite Algorithms for Block Cipher Validations</a>
</li>
<li>4.2. <a href="#rfc.section.4.2">Block Cipher Algorithm Capabilities JSON Values</a>
</li>
</ul><li>5. <a href="#rfc.section.5">Test Vectors</a>
</li>
<ul><li>5.1. <a href="#rfc.section.5.1">Test Groups</a>
</li>
<li>5.2. <a href="#rfc.section.5.2">Test Cases</a>
</li>
</ul><li>6. <a href="#rfc.section.6">Test Vector Responses</a>
</li>
<li>7. <a href="#rfc.section.7">Acknowledgements</a>
</li>
<li>8. <a href="#rfc.section.8">IANA Considerations</a>
</li>
<li>9. <a href="#rfc.section.9">Security Considerations</a>
</li>
<li>10. <a href="#rfc.references">References</a>
</li>
<ul><li>10.1. <a href="#rfc.references.1">Normative References</a>
</li>
<li>10.2. <a href="#rfc.references.2">Informative References</a>
</li>
</ul><li>Appendix A. <a href="#rfc.appendix.A">Example Capabilities JSON Object</a>
</li>
<li>Appendix B. <a href="#rfc.appendix.B">Example Vector Set Request/Responses JSON Object</a>
</li>
<li>Appendix C. <a href="#rfc.appendix.C">Example TDES Test and Results JSON Object</a>
</li>
<li>Appendix D. <a href="#rfc.appendix.D">Example TDES MCT Test and Results JSON Object</a>
</li>
<li><a href="#rfc.authors">Author's Address</a>
</li>
</ul>
<h1 id="rfc.section.1">
<a href="#rfc.section.1">1.</a> Introduction</h1>
<p id="rfc.section.1.p.1">The Automated Cryptographic Validation Protocol (ACVP) defines a mechanism to automatically verify the cryptographic implementation of a software or hardware cryptographic module. The intention of the protocol is to minimize human involvement in the testing of cryptography. The ACVP specification defines how a cryptographic module communicates with an ACVP server, including cryptographic capabilities negotiation, session management, authentication, vector processing and more. Note that the ACVP specification does not define algorithm-specific JSON constructs for performing the cryptographic validation. However, a series of ACVP sub-specifications defines the constructs for testing individual cryptographic algorithms. Each sub-specification addresses a specific class or subset of cryptographic algorithms. This sub-specification defines the JSON constructs for testing symmetric block cipher cryptographic algorithms using ACVP. The ACVP server performs a set of tests on the block ciphers in order to assess the correctness and robustness of the implementation. A typical ACVP validation session would require multiple tests to be performed for every supported cryptographic algorithm, such as AES-ECB, AES-CBC, AES-CTR, AES-GCM, TDES-CBC, TDES-CTR, etc. </p>
<h1 id="rfc.section.1.1">
<a href="#rfc.section.1.1">1.1.</a> Requirements Language</h1>
<p id="rfc.section.1.1.p.1">The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted in <a href="#RFC2119" class="xref">RFC 2119</a> . </p>
<h1 id="rfc.section.2">
<a href="#rfc.section.2">2.</a> <a href="#supported_algs" id="supported_algs">Supported Block Cipher Algorithms</a>
</h1>
<p id="rfc.section.2.p.1">The following block cipher algorithms MAY be advertised by the ACVP compliant cryptographic module:</p>
<p></p>
<ul>
<li>ACVP-AES-ECB</li>
<li>ACVP-AES-CBC</li>
<li>ACVP-AES-CBC-CS1</li>
<li>ACVP-AES-CBC-CS2</li>
<li>ACVP-AES-CBC-CS3</li>
<li>ACVP-AES-OFB</li>
<li>ACVP-AES-CFB1</li>
<li>ACVP-AES-CFB8</li>
<li>ACVP-AES-CFB128</li>
<li>ACVP-AES-CTR</li>
<li>ACVP-AES-FF1</li>
<li>ACVP-AES-FF3-1</li>
<li>ACVP-AES-GCM</li>
<li>ACVP-AES-GCM-SIV</li>
<li>ACVP-AES-XPN</li>
<li>ACVP-AES-CCM</li>
<li>ACVP-AES-XTS</li>
<li>ACVP-AES-KW</li>
<li>ACVP-AES-KWP</li>
<li>ACVP-TDES-ECB</li>
<li>ACVP-TDES-CBC</li>
<li>ACVP-TDES-CBCI</li>
<li>ACVP-TDES-CFB1</li>
<li>ACVP-TDES-CFB8</li>
<li>ACVP-TDES-CFB64</li>
<li>ACVP-TDES-CFBP1</li>
<li>ACVP-TDES-CFBP8</li>
<li>ACVP-TDES-CFBP64</li>
<li>ACVP-TDES-OFB</li>
<li>ACVP-TDES-OFBI</li>
<li>ACVP-TDES-CTR</li>
<li>ACVP-TDES-KW</li>
</ul>
<p> </p>
<h1 id="rfc.section.3">
<a href="#rfc.section.3">3.</a> <a href="#testtypes" id="testtypes">Test Types and Test Coverage</a>
</h1>
<p id="rfc.section.3.p.1">This section describes the design of the tests used to validate implementations of block cipher algorithms. There are three types of tests for block ciphers: functional tests, Monte Carlo tests and counter tests. Each has a specific value to be used in the testType field. The testType field definitions are: </p>
<ul>
<li>"AFT" - Algorithm Functional Test. These tests can be processed by the client using a normal 'encrypt' or 'decrypt' operation. AFTs cause the implementation under test to exercise normal operations on a single block, multiple blocks, or (where applicable) partial blocks. In some cases random data is used, in others, static, predetermined tests are provided. The functional tests of the block cipher are designed to verify that the logical components of the cipher (GFSbox, KeySbox, block chaining etc.) are operating correctly. </li>
<li>"MCT" - Monte Carlo Test. These tests exercise the implementation under test under strenuous circumstances. The implementation under test must process the test vectors according to the correct algorithm and mode in this document. MCTs can help detect potential memory leaks over time, and problems in allocation of resources, addressing variables, error handling and generally improper behavior in response to random inputs. Each MCT processes 100 pseudorandom tests. Not every algorithm and mode combination has an MCT. See <a href="#MC_test" class="xref">Section 3.1</a> for implementation details. </li>
<li>"CTR" - Counter Mode Test. Counter tests are specifically for counter modes (AES-CTR and TDES-CTR) and require an implementation under test to exercise their counter mechanism. The server will send a long message to the client for encryption or decryption and back-compute the IVs used by the implementation under test. These IVs are then verified for uniqueness and an increasing (or decreasing) nature. The client processes these tests as normal AFTs. The different mode is highlighted here to signify the difference on the server side for processing. </li>
</ul>
<p> </p>
<h1 id="rfc.section.3.1">
<a href="#rfc.section.3.1">3.1.</a> <a href="#MC_test" id="MC_test">Monte Carlo tests for block ciphers</a>
</h1>
<p id="rfc.section.3.1.p.1">The MCTs start with an initial condition (plaintext/ciphertext, key, and optional, or maybe multiple IVs) and perform a series of chained computations. For modes that use an IV, the IV is used in the beginning of each pseudorandom process. There are separate rounds of MCT for encryption and decryption. Because some block cipher modes rely on an IV and perform calculations differently from other modes, there are specific definitions of MCT for many of the block cipher modes. </p>
<p id="rfc.section.3.1.p.2">Note: For all the following, the pseudocode for decryption can be obtained by replacing all PT's with CT's and all CT's with PT's. As well, replace the encrypt operation with the corresponding decrypt operation. </p>
<h1 id="rfc.section.3.1.1">
<a href="#rfc.section.3.1.1">3.1.1.</a> <a href="#AES-ECB-MCT" id="AES-ECB-MCT">AES Monte Carlo Test - ECB mode</a>
</h1>
<p id="rfc.section.3.1.1.p.1">The initial condition for the test is the tuple (KEY, PT) set to some values. </p>
<p id="rfc.section.3.1.1.p.2">The algorithm is shown in <a href="#xml_figureMCTECB" class="xref">Figure 1</a> . </p>
<div id="rfc.figure.1"></div>
<div id="xml_figureMCTECB"></div>
<p>AES-ECB Monte Carlo Test</p>
<pre>
Key[0] = KEY
PT[0] = PT
For i = 0 to 99
Output Key[i]
Output PT[0]
For j = 0 to 999
CT[j] = AES_ECB_ENCRYPT(Key[i], PT[j])
PT[j+1] = CT[j]
Output CT[j]
AES_KEY_SHUFFLE(Key, CT)
PT[0] = CT[j]
</pre>
<p class="figure">Figure 1</p>
<h1 id="rfc.section.3.1.2">
<a href="#rfc.section.3.1.2">3.1.2.</a> <a href="#AES-CBC-MCT" id="AES-CBC-MCT">AES Monte Carlo Test - CBC mode</a>
</h1>
<p id="rfc.section.3.1.2.p.1">The initial condition for the test is the tuple (KEY, IV, PT) set to some values. </p>
<p id="rfc.section.3.1.2.p.2">The algorithm is shown in <a href="#xml_figureMCTCBC" class="xref">Figure 2</a> . </p>
<div id="rfc.figure.2"></div>
<div id="xml_figureMCTCBC"></div>
<p>AES-CBC Monte Carlo Test</p>
<pre>
Key[0] = KEY
IV[0] = IV
PT[0] = PT
For i = 0 to 99
Output Key[i]
Output IV[i]
Output PT[0]
For j = 0 to 999
If ( j=0 )
CT[j] = AES_CBC_ENCRYPT(Key[i], IV[i], PT[j])
PT[j+1] = IV[i]
Else
CT[j] = AES_CBC_ENCRYPT(Key[i], PT[j])
PT[j+1] = CT[j-1]
Output CT[j]
AES_KEY_SHUFFLE(Key, CT)
IV[i+1] = CT[j]
PT[0] = CT[j-1]
</pre>
<p class="figure">Figure 2</p>
<h1 id="rfc.section.3.1.3">
<a href="#rfc.section.3.1.3">3.1.3.</a> <a href="#AES-CBC-CS-MCT" id="AES-CBC-CS-MCT">AES Monte Carlo Test - CBC-CS* mode</a>
</h1>
<p id="rfc.section.3.1.3.p.1">The initial condition for the test is the tuple (KEY, IV, PT) set to some values. An initial payload length is chosen based on the payloadLen values the IUT registers with. </p>
<p id="rfc.section.3.1.3.p.2">The algorithm is shown in <a href="#xml_figureMCTCBCCS" class="xref">Figure 3</a> . </p>
<div id="rfc.figure.3"></div>
<div id="xml_figureMCTCBCCS"></div>
<p>AES-CBC-CS* Monte Carlo Test</p>
<pre>
Key[0] = Key
IV[0] = IV
PT[0] = PT
For i = 0 to 99
Output Key[i]
Output IV[i]
Output PT[0]
For j = 0 to 999
If ( j=0 )
CT[j] = AES_CBC_CS_ENCRYPT(Key[i], IV[i], PT[j])
PT[j+1] = IV[i] || MSB(CT, PT.length - IV.length)
Else
CT[j] = AES_CBC_CS_ENCRYPT(Key[i], PT[j])
PT[j+1] = CT[j-1]
Output CT[j]
AES_KEY_SHUFFLE(Key, CT)
IV[i+1] = MSB(CT[j], IV.length)
PT[0] = CT[j-1]
</pre>
<p class="figure">Figure 3</p>
<h1 id="rfc.section.3.1.4">
<a href="#rfc.section.3.1.4">3.1.4.</a> <a href="#AES-OFB-MCT" id="AES-OFB-MCT">AES Monte Carlo Test - OFB mode</a>
</h1>
<p id="rfc.section.3.1.4.p.1">The initial condition for the test is the tuple (KEY, IV, PT) set to some values. </p>
<p id="rfc.section.3.1.4.p.2">The algorithm is shown in <a href="#xml_figureMCTOFB" class="xref">Figure 4</a> . </p>
<div id="rfc.figure.4"></div>
<div id="xml_figureMCTOFB"></div>
<p>AES-OFB Monte Carlo Test</p>
<pre>
Key[0] = Key
IV[0] = IV
PT[0] = PT
For i = 0 to 99
Output Key[i]
Output IV[i]
Output PT[0]
For j = 0 to 999
If ( j=0 )
CT[j] = AES_OFB_ENCRYPT(Key[i], IV[i], PT[j])
PT[j+1] = IV[i]
Else
CT[j] = AES_OFB_ENCRYPT(Key[i], PT[j])
PT[j+1] = CT[j-1]
Output CT[j]
AES_KEY_SHUFFLE(Key, CT)
IV[i+1] = CT[j]
PT[0] = CT[j-1]
</pre>
<p class="figure">Figure 4</p>
<h1 id="rfc.section.3.1.5">
<a href="#rfc.section.3.1.5">3.1.5.</a> <a href="#AES-CFB1-MCT" id="AES-CFB1-MCT">AES Monte Carlo Test - CFB1 mode</a>
</h1>
<p id="rfc.section.3.1.5.p.1">The initial condition for the test is the tuple (KEY, IV, PT) set to some values. </p>
<p id="rfc.section.3.1.5.p.2">The algorithm is shown in <a href="#xml_figureMCTCFB1" class="xref">Figure 5</a> . </p>
<div id="rfc.figure.5"></div>
<div id="xml_figureMCTCFB1"></div>
<p>AES-CFB1 Monte Carlo Test</p>
<pre>
Key[0] = Key
IV[0] = IV
PT[0] = PT
For i = 0 to 99
Output Key[i]
Output IV[i]
Output PT[0]
For j = 0 to 999
If ( j=0 )
CT[j] = AES_CFB1_ENCRYPT(Key[i], IV[i], PT[j])
PT[j+1] = BitJ(IV[i])
Else
CT[j] = AES_CFB1_ENCRYPT(Key[i], PT[j])
If ( j<128 )
PT[j+1] = BitJ(IV[i])
Else
PT[j+1] = CT[j-128]
Output CT[j]
If ( keylen = 128 )
Key[i+1] = Key[i] xor (CT[j-127] || CT[j-126] || ... || CT[j])
If ( keylen = 192 )
Key[i+1] = Key[i] xor (CT[j-191] || CT[j-190] || ... || CT[j])
If ( keylen = 256 )
Key[i+1] = Key[i] xor (CT[j-255] || CT[j-254] || ... || CT[j])
IV[i+1] = (CT[j-127] || CT[j-126] || ... || CT[j])
PT[0] = CT[j-128]
</pre>
<p class="figure">Figure 5</p>
<h1 id="rfc.section.3.1.6">
<a href="#rfc.section.3.1.6">3.1.6.</a> <a href="#AES-CFB8-MCT" id="AES-CFB8-MCT">AES Monte Carlo Test - CFB8 mode</a>
</h1>
<p id="rfc.section.3.1.6.p.1">The initial condition for the test is the tuple (KEY, IV, PT) set to some values. </p>
<p id="rfc.section.3.1.6.p.2">The algorithm is shown in <a href="#xml_figureMCTCFB8" class="xref">Figure 6</a> . </p>
<div id="rfc.figure.6"></div>
<div id="xml_figureMCTCFB8"></div>
<p>AES-CFB8 Monte Carlo Test</p>
<pre>
Key[0] = Key
IV[0] = IV
PT[0] = PT
For i = 0 to 99
Output Key[i]
Output IV[i]
Output PT[0]
For j = 0 to 999
If ( j=0 )
CT[j] = AES_CFB8_ENCRYPT(Key[i], IV[i], PT[j])
PT[j+1] = ByteJ(IV[i])
Else
CT[j] = AES_CFB8_ENCRYPT(Key[i], PT[j])
If ( j<16 )
PT[j+1] = ByteJ(IV[i])
Else
PT[j+1] = CT[j-16]
Output CT[j]
If ( keylen = 128 )
Key[i+1] = Key[i] xor (CT[j-15] || CT[j-14] || ... || CT[j])
If ( keylen = 192 )
Key[i+1] = Key[i] xor (CT[j-23] || CT[j-22] || ... || CT[j])
If ( keylen = 256 )
Key[i+1] = Key[i] xor (CT[j-31] || CT[j-30] || ... || CT[j])
IV[i+1] = (CT[j-15] || CT[j-14] || ... || CT[j])
PT[0] = CT[j-16]
</pre>
<p class="figure">Figure 6</p>
<h1 id="rfc.section.3.1.7">
<a href="#rfc.section.3.1.7">3.1.7.</a> <a href="#AES-CFB128-MCT" id="AES-CFB128-MCT">AES Monte Carlo Test - CFB128 mode</a>
</h1>
<p id="rfc.section.3.1.7.p.1">The initial condition for the test is the tuple (KEY, IV, PT) set to some values. </p>
<p id="rfc.section.3.1.7.p.2">The algorithm is shown in <a href="#xml_figureMCTCFB128" class="xref">Figure 7</a> . </p>
<div id="rfc.figure.7"></div>
<div id="xml_figureMCTCFB128"></div>
<p>AES-CFB128 Monte Carlo Test</p>
<pre>
Key[0] = Key
IV[0] = IV
PT[0] = PT
For i = 0 to 99
Output Key[i]
Output IV[i]
Output PT[0]
For j = 0 to 999
If ( j=0 )
CT[j] = AES_CFB128_ENCRYPT(Key[i], IV[i], PT[j])
PT[j+1] = IV[i]
Else
CT[j] = AES_CFB128_ENCRYPT(Key[i], PT[j])
PT[j+1] = CT[j-1]
Output CT[j]
AES_KEY_SHUFFLE(Key, CT)
IV[i+1] = CT[j]
PT[0] = CT[j-1]
</pre>
<p class="figure">Figure 7</p>
<h1 id="rfc.section.3.1.8">
<a href="#rfc.section.3.1.8">3.1.8.</a> <a href="#AES_KEY_SHUFFLE" id="AES_KEY_SHUFFLE">AES Monte Carlo Key Shuffle</a>
</h1>
<p id="rfc.section.3.1.8.p.1">Most AES MCTs use a shared key shuffle routine. The algorithm is shown in <a href="#xml_figureAESKEY" class="xref">Figure 8</a> . The initial condition for the routine is a tuple (KEY, CT) set to some values. This pseudocode is specifically for encryption. For decryption, swap all instances of CT with PT. </p>
<div id="rfc.figure.8"></div>
<div id="xml_figureAESKEY"></div>
<p>AES Encrypt Key Shuffle Routine</p>
<pre>
If ( keylen = 128 )
Key[i+1] = Key[i] xor MSB(CT[j], 128)
If ( keylen = 192 )
Key[i+1] = Key[i] xor (last 64-bits of CT[j-1] || MSB(CT[j], 128))
If ( keylen = 256 )
Key[i+1] = Key[i] xor (MSB(CT[j-1], 128) || MSB(CT[j], 128))
</pre>
<p class="figure">Figure 8</p>
<h1 id="rfc.section.3.1.9">
<a href="#rfc.section.3.1.9">3.1.9.</a> <a href="#TDES-ECB-MCT" id="TDES-ECB-MCT">TDES Monte Carlo Test - ECB mode</a>
</h1>
<p id="rfc.section.3.1.9.p.1">The initial condition for the test is the tuple (KEY1, KEY2, KEY3, PT) set to some values. </p>
<p id="rfc.section.3.1.9.p.2">The algorithm is shown in <a href="#xml_figureMCT_TDES_ECB" class="xref">Figure 9</a> . </p>
<div id="rfc.figure.9"></div>
<div id="xml_figureMCT_TDES_ECB"></div>
<p>TDES-ECB Monte Carlo Test</p>
<pre>
Key1[0] = KEY1
Key2[0] = KEY2
Key3[0] = KEY3
PT[0] = PT
For i = 0 to 399
Output Key1[i]
Output Key2[i]
Output Key3[i]
Output PT[0]
For j = 0 to 9999
CT[j] = TDES_ECB_ENCRYPT(Key1[i], Key2[i], Key3[i], PT[j])
PT[j+1] = CT[i]
Output CT[j]
Key1[i+1] = Key1[i] xor CT[j]
Key2[i+1] = Key2[i] xor CT[j-1]
If ( keyingOption = 1 )
Key3[i+1] = Key3[i] xor CT[j-2]
Else
Key3[i+1] = Key1[i+1]
PT[0] = CT[j-1]
</pre>
<p class="figure">Figure 9</p>
<h1 id="rfc.section.3.1.10">
<a href="#rfc.section.3.1.10">3.1.10.</a> <a href="#TDES-CBC-MCT" id="TDES-CBC-MCT">TDES Monte Carlo Test - CBC mode</a>
</h1>
<p id="rfc.section.3.1.10.p.1">The initial condition for the test is the tuple (KEY1, KEY2, KEY3, IV, PT) set to some values. </p>
<p id="rfc.section.3.1.10.p.2">The algorithm is shown in <a href="#xml_figureMCT_TDES_CBC" class="xref">Figure 10</a> . </p>
<div id="rfc.figure.10"></div>
<div id="xml_figureMCT_TDES_CBC"></div>
<p>TDES-CBC Monte Carlo Test</p>
<pre>
Key1[0] = KEY1
Key2[0] = KEY2
Key3[0] = KEY3
IV[0] = IV
PT[0] = PT
For i = 0 to 399
Output Key1[i]
Output Key2[i]
Output Key3[i]
Output IV[0]
Output PT[0]
For j = 0 to 9999
CT[j] = TDES_CBC_ENCRYPT(Key1[i], Key2[i], Key3[i],
PT[j], IV[j])
If ( j = 0 )
PT[j+1] = IV[0]
Else
PT[j+1] = CT[j-1]
IV[j+1] = CT[j]
Output CT[j]
Key1[i+1] = Key1[i] xor CT[j]
Key2[i+1] = Key2[i] xor CT[j-1]
If ( keyingOption = 1 )
Key3[i+1] = Key3[i] xor CT[j-2]
Else
Key3[i+1] = Key1[i+1]
PT[0] = CT[j-1]
IV[0] = CT[j]
</pre>
<p class="figure">Figure 10</p>
<h1 id="rfc.section.3.1.11">
<a href="#rfc.section.3.1.11">3.1.11.</a> <a href="#TDES-CBC-I-MCT" id="TDES-CBC-I-MCT">TDES Monte Carlo Test - CBC-I mode</a>
</h1>
<p id="rfc.section.3.1.11.p.1">The initial condition for the test is the tuple (KEY1, KEY2, KEY3, IV1, IV2, IV3, PT1, PT2, PT3) set to some values. </p>
<p id="rfc.section.3.1.11.p.2">The algorithm is shown in <a href="#xml_figureMCT_TDES_CBC-I" class="xref">Figure 11</a> . </p>
<div id="rfc.figure.11"></div>
<div id="xml_figureMCT_TDES_CBC-I"></div>
<p>TDES-CBC-I Monte Carlo Test</p>
<pre>
Key1[0] = KEY1
Key2[0] = KEY2
Key3[0] = KEY3
IV1[0] = IV1
IV2[0] = IV2
IV3[0] = IV3
PT1[0] = PT1
PT2[0] = PT2
PT3[0] = PT3
For i = 0 to 399
Output Key1[i], Key2[i], Key3[i]
Output IV1[0], IV2[0], IV3[0]
Output PT1[0], PT2[0], PT3[0]
For j = 0 to 9999
CT[j] = TDES_CBC_I_ENCRYPT(Key1[i], Key2[i],
Key3[i], PT1[j], PT2[j],
PT3[j], IV1[j], IV2[j], IV3[j])
If ( j = 0 )
PT1[j+1] = IV1[0]
PT2[j+1] = IV2[0]
PT3[j+1] = IV3[0]
Else