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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
//! Types for signatures.
use std::fmt;
use std::ops::Deref;
use constants::Curve;
use Error;
use Result;
use crypto::{
mpis,
Hash,
Signer,
};
use HashAlgorithm;
use PublicKeyAlgorithm;
use SignatureType;
use packet::Signature;
use packet::Key;
use KeyID;
use packet::UserID;
use packet::UserAttribute;
use Packet;
use packet;
use packet::signature::subpacket::SubpacketArea;
use serialize::SerializeInto;
use nettle::{self, dsa, ecc, ecdsa, ed25519, rsa};
use nettle::rsa::verify_digest_pkcs1;
#[cfg(test)]
use std::path::PathBuf;
pub mod subpacket;
const TRACE : bool = false;
#[cfg(test)]
#[allow(dead_code)]
fn path_to(artifact: &str) -> PathBuf {
[env!("CARGO_MANIFEST_DIR"), "tests", "data", artifact]
.iter().collect()
}
/// Builds a signature packet.
///
/// This is the mutable version of a `Signature4` packet. To convert
/// it to one, use `sign_hash(..)`.
#[derive(Clone, Hash, PartialEq, Eq)]
pub struct Builder {
/// Version of the signature packet. Must be 4.
version: u8,
/// Type of signature.
sigtype: SignatureType,
/// Pub(Crate)lic-key algorithm used for this signature.
pk_algo: PublicKeyAlgorithm,
/// Hash algorithm used to compute the signature.
hash_algo: HashAlgorithm,
/// Subpackets that are part of the signature.
hashed_area: SubpacketArea,
/// Subpackets _not_ that are part of the signature.
unhashed_area: SubpacketArea,
}
impl Builder {
/// Returns a new `Builder` object.
pub fn new(sigtype: SignatureType) -> Self {
Builder {
version: 4,
sigtype: sigtype,
pk_algo: PublicKeyAlgorithm::Unknown(0),
hash_algo: HashAlgorithm::Unknown(0),
hashed_area: SubpacketArea::empty(),
unhashed_area: SubpacketArea::empty(),
}
}
/// Gets the version.
pub fn version(&self) -> u8 {
self.version
}
/// Gets the signature type.
pub fn sigtype(&self) -> SignatureType {
self.sigtype
}
/// Sets the signature type.
pub fn set_sigtype(mut self, t: SignatureType) -> Self {
self.sigtype = t;
self
}
/// Gets the public key algorithm.
pub fn pk_algo(&self) -> PublicKeyAlgorithm {
self.pk_algo
}
/// Gets the hash algorithm.
pub fn hash_algo(&self) -> HashAlgorithm {
self.hash_algo
}
/// Gets a reference to the hashed area.
pub fn hashed_area(&self) -> &SubpacketArea {
&self.hashed_area
}
/// Gets a mutable reference to the hashed area.
pub fn hashed_area_mut(&mut self) -> &mut SubpacketArea {
&mut self.hashed_area
}
/// Gets a reference to the unhashed area.
pub fn unhashed_area(&self) -> &SubpacketArea {
&self.unhashed_area
}
/// Gets a mutable reference to the unhashed area.
pub fn unhashed_area_mut(&mut self) -> &mut SubpacketArea {
&mut self.unhashed_area
}
/// Signs `signer` using itself.
///
/// The Signature's public-key algorithm field is set to the
/// algorithm used by `signer`, the hash-algorithm field is set to
/// `hash_algo`.
pub fn sign_primary_key_binding(mut self, signer: &mut Signer,
algo: HashAlgorithm)
-> Result<Signature> {
self.pk_algo = signer.public().pk_algo();
self.hash_algo = algo;
let digest =
Signature::primary_key_binding_hash(&self, signer.public())?;
self.sign(signer, digest)
}
/// Signs binding between `userid` and `key` using `signer`.
///
/// The Signature's public-key algorithm field is set to the
/// algorithm used by `signer`, the hash-algorithm field is set to
/// `hash_algo`.
pub fn sign_userid_binding(mut self, signer: &mut Signer,
key: &Key, userid: &UserID, algo: HashAlgorithm)
-> Result<Signature> {
self.pk_algo = signer.public().pk_algo();
self.hash_algo = algo;
let digest = Signature::userid_binding_hash(&self, key, userid)?;
self.sign(signer, digest)
}
/// Signs subkey binding from `primary` to `subkey` using `signer`.
///
/// The Signature's public-key algorithm field is set to the
/// algorithm used by `signer`, the hash-algorithm field is set to
/// `hash_algo`.
pub fn sign_subkey_binding(mut self, signer: &mut Signer,
primary: &Key, subkey: &Key, algo: HashAlgorithm)
-> Result<Signature> {
self.pk_algo = signer.public().pk_algo();
self.hash_algo = algo;
let digest = Signature::subkey_binding_hash(&self, primary, subkey)?;
self.sign(signer, digest)
}
/// Signs `ua` using `signer`.
///
/// The Signature's public-key algorithm field is set to the
/// algorithm used by `signer`, the hash-algorithm field is set to
/// `hash_algo`.
pub fn sign_user_attribute_binding(mut self, signer: &mut Signer,
ua: &UserAttribute, algo: HashAlgorithm)
-> Result<Signature> {
self.pk_algo = signer.public().pk_algo();
self.hash_algo = algo;
let digest =
Signature::user_attribute_binding_hash(&self, signer.public(), ua)?;
self.sign(signer, digest)
}
/// Signs `hash` using `signer`.
///
/// The Signature's public-key algorithm field is set to the
/// algorithm used by `signer`, the hash-algorithm field is set to
/// `hash_algo`.
pub fn sign_hash(mut self, signer: &mut Signer,
hash_algo: HashAlgorithm, mut hash: Box<nettle::Hash>)
-> Result<Signature> {
// Fill out some fields, then hash the packet.
self.pk_algo = signer.public().pk_algo();
self.hash_algo = hash_algo;
self.hash(&mut hash);
// Compute the digest.
let mut digest = vec![0u8; hash.digest_size()];
hash.digest(&mut digest);
self.sign(signer, digest)
}
/// Signs `message` using `signer`.
///
/// The Signature's public-key algorithm field is set to the
/// algorithm used by `signer`, the hash-algorithm field is set to
/// `hash_algo`.
pub fn sign_message(mut self, signer: &mut Signer,
hash_algo: HashAlgorithm, msg: &[u8])
-> Result<Signature> {
// Hash the message
let mut hash = hash_algo.context()?;
hash.update(msg);
// Fill out some fields, then hash the packet.
self.pk_algo = signer.public().pk_algo();
self.hash_algo = hash_algo;
self.hash(&mut hash);
// Compute the digest.
let mut digest = vec![0u8; hash.digest_size()];
hash.digest(&mut digest);
self.sign(signer, digest)
}
fn sign(self, signer: &mut Signer, digest: Vec<u8>) -> Result<Signature> {
let algo = self.hash_algo;
let mpis = signer.sign(algo, &digest)?;
Ok(Signature4 {
common: Default::default(),
fields: self,
hash_prefix: [digest[0], digest[1]],
mpis: mpis,
computed_hash: Some((algo, digest)),
level: 0,
}.into())
}
}
impl From<Signature> for Builder {
fn from(sig: Signature) -> Self {
match sig {
Signature::V4(sig) => sig.into(),
}
}
}
impl From<Signature4> for Builder {
fn from(sig: Signature4) -> Self {
sig.fields
}
}
impl<'a> From<&'a Signature> for &'a Builder {
fn from(sig: &'a Signature) -> Self {
match sig {
Signature::V4(ref sig) => sig.into(),
}
}
}
impl<'a> From<&'a Signature4> for &'a Builder {
fn from(sig: &'a Signature4) -> Self {
&sig.fields
}
}
/// Holds a signature packet.
///
/// Signature packets are used both for certification purposes as well
/// as for document signing purposes.
///
/// See [Section 5.2 of RFC 4880] for details.
///
/// [Section 5.2 of RFC 4880]: https://tools.ietf.org/html/rfc4880#section-5.2
// Note: we can't derive PartialEq, because it includes the cached data.
#[derive(Eq, Hash, Clone)]
pub struct Signature4 {
/// CTB packet header fields.
pub(crate) common: packet::Common,
/// Fields as configured using the builder.
pub(crate) fields: Builder,
/// Lower 16 bits of the signed hash value.
hash_prefix: [u8; 2],
/// Signature MPIs.
mpis: mpis::Signature,
/// When used in conjunction with a one-pass signature, this is the
/// hash computed over the enclosed message.
computed_hash: Option<(HashAlgorithm, Vec<u8>)>,
/// Signature level.
///
/// A level of 0 indicates that the signature is directly over the
/// data, a level of 1 means that the signature is a notarization
/// over all level 0 signatures and the data, and so on.
level: usize,
}
impl Deref for Signature4 {
type Target = Builder;
fn deref(&self) -> &Self::Target {
&self.fields
}
}
impl fmt::Debug for Signature4 {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
// Get the issuer. Prefer the issuer fingerprint to the
// issuer keyid, which may be stored in the unhashed area.
let issuer = if let Some(tmp) = self.issuer_fingerprint() {
tmp.to_string()
} else if let Some(tmp) = self.issuer() {
tmp.to_string()
} else {
"Unknown".to_string()
};
f.debug_struct("Signature4")
.field("version", &self.version())
.field("sigtype", &self.sigtype())
.field("issuer", &issuer)
.field("pk_algo", &self.pk_algo())
.field("hash_algo", &self.hash_algo())
.field("hashed_area", self.hashed_area())
.field("unhashed_area", self.unhashed_area())
.field("hash_prefix",
&::conversions::to_hex(&self.hash_prefix, false))
.field("computed_hash",
&if let Some((algo, ref hash)) = self.computed_hash {
Some((algo, ::conversions::to_hex(&hash[..], false)))
} else {
None
})
.field("level", &self.level)
.field("mpis", &self.mpis)
.finish()
}
}
impl PartialEq for Signature4 {
fn eq(&self, other: &Signature4) -> bool {
// Comparing the relevant fields is error prone in case we add
// a field at some point. Instead, we compare the serialized
// versions. As a small optimization, we compare the MPIs.
// Note: two `Signature4s` could be different even if they have
// the same MPI if the MPI was not invalidated when changing a
// field.
if self.mpis != other.mpis {
return false;
}
// Do a full check by serializing the fields.
if let (Ok(a), Ok(b)) = (self.to_vec(), other.to_vec()) {
a == b
} else {
false
}
}
}
impl Signature4 {
/// Creates a new signature packet.
///
/// If you want to sign something, consider using the [`Builder`]
/// interface.
///
/// [`Builder`]: struct.Builder.html
pub fn new(sigtype: SignatureType, pk_algo: PublicKeyAlgorithm,
hash_algo: HashAlgorithm, hashed_area: SubpacketArea,
unhashed_area: SubpacketArea,
hash_prefix: [u8; 2],
mpis: mpis::Signature) -> Self {
Signature4 {
common: Default::default(),
fields: Builder {
version: 4,
sigtype: sigtype.into(),
pk_algo: pk_algo.into(),
hash_algo: hash_algo,
hashed_area: hashed_area,
unhashed_area: unhashed_area,
},
hash_prefix: hash_prefix,
mpis: mpis,
computed_hash: None,
level: 0,
}
}
/// Gets a mutable reference to the unhashed area.
pub fn unhashed_area_mut(&mut self) -> &mut SubpacketArea {
&mut self.fields.unhashed_area
}
/// Gets the hash prefix.
pub fn hash_prefix(&self) -> &[u8; 2] {
&self.hash_prefix
}
/// Sets the hash prefix.
pub fn set_hash_prefix(&mut self, prefix: [u8; 2]) -> [u8; 2] {
::std::mem::replace(&mut self.hash_prefix, prefix)
}
/// Gets the signature packet's MPIs.
pub fn mpis(&self) -> &mpis::Signature {
&self.mpis
}
/// Sets the signature packet's MPIs.
pub fn set_mpis(&mut self, mpis: mpis::Signature) -> mpis::Signature {
::std::mem::replace(&mut self.mpis, mpis)
}
/// Gets the computed hash value.
pub fn computed_hash(&self) -> Option<&(HashAlgorithm, Vec<u8>)> {
self.computed_hash.as_ref()
}
/// Sets the computed hash value.
pub fn set_computed_hash(&mut self, hash: Option<(HashAlgorithm, Vec<u8>)>)
-> Option<(HashAlgorithm, Vec<u8>)>
{
::std::mem::replace(&mut self.computed_hash, hash)
}
/// Gets the signature level.
///
/// A level of 0 indicates that the signature is directly over the
/// data, a level of 1 means that the signature is a notarization
/// over all level 0 signatures and the data, and so on.
pub fn level(&self) -> usize {
self.level
}
/// Sets the signature level.
///
/// A level of 0 indicates that the signature is directly over the
/// data, a level of 1 means that the signature is a notarization
/// over all level 0 signatures and the data, and so on.
pub fn set_level(&mut self, level: usize) -> usize {
::std::mem::replace(&mut self.level, level)
}
/// Gets the issuer.
pub fn get_issuer(&self) -> Option<KeyID> {
if let Some(id) = self.issuer() {
Some(id)
} else {
None
}
}
/// Verifies the signature against `hash`.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `key` can made
/// valid signatures; it is up to the caller to make sure the key
/// is not revoked, not expired, has a valid self-signature, has a
/// subkey binding signature (if appropriate), has the signing
/// capability, etc.
pub fn verify_hash(&self, key: &Key, hash_algo: HashAlgorithm, hash: &[u8])
-> Result<bool>
{
use PublicKeyAlgorithm::*;
use crypto::mpis::PublicKey;
#[allow(deprecated)]
match (self.pk_algo(), key.mpis(), self.mpis()) {
(RSASign,
&PublicKey::RSA{ ref e, ref n },
&mpis::Signature::RSA { ref s }) |
(RSAEncryptSign,
&PublicKey::RSA{ ref e, ref n },
&mpis::Signature::RSA { ref s }) => {
let key = rsa::PublicKey::new(&n.value, &e.value)?;
// As described in [Section 5.2.2 and 5.2.3 of RFC 4880],
// to verify the signature, we need to encode the
// signature data in a PKCS1-v1.5 packet.
//
// [Section 5.2.2 and 5.2.3 of RFC 4880]:
// https://tools.ietf.org/html/rfc4880#section-5.2.2
verify_digest_pkcs1(&key, hash, hash_algo.oid()?, &s.value)
}
(DSA,
&PublicKey::DSA{ ref y, ref p, ref q, ref g },
&mpis::Signature::DSA { ref s, ref r }) => {
let key = dsa::PublicKey::new(&y.value);
let params = dsa::Params::new(&p.value, &q.value, &g.value);
let signature = dsa::Signature::new(&r.value, &s.value);
Ok(dsa::verify(¶ms, &key, hash, &signature))
}
(EdDSA,
&PublicKey::EdDSA{ ref curve, ref q },
&mpis::Signature::EdDSA { ref r, ref s }) => match curve {
Curve::Ed25519 => {
if q.value[0] != 0x40 {
return Err(Error::MalformedPacket(
"Invalid point encoding".into()).into());
}
// OpenPGP encodes R and S separately, but our
// cryptographic library expects them to be
// concatenated.
let mut signature =
Vec::with_capacity(ed25519::ED25519_SIGNATURE_SIZE);
// We need to zero-pad them at the front, because
// the MPI encoding drops leading zero bytes.
let half = ed25519::ED25519_SIGNATURE_SIZE / 2;
for _ in 0..half - r.value.len() {
signature.push(0);
}
signature.extend_from_slice(&r.value);
for _ in 0..half - s.value.len() {
signature.push(0);
}
signature.extend_from_slice(&s.value);
// Let's see if we got it right.
if signature.len() != ed25519::ED25519_SIGNATURE_SIZE {
return Err(Error::MalformedPacket(
format!(
"Invalid signature size: {}, r: {:?}, s: {:?}",
signature.len(), &r.value, &s.value)).into());
}
ed25519::verify(&q.value[1..], hash, &signature)
},
_ =>
Err(Error::UnsupportedEllipticCurve(curve.clone())
.into()),
},
(ECDSA,
&PublicKey::ECDSA{ ref curve, ref q },
&mpis::Signature::ECDSA { ref s, ref r }) => {
let (x, y) = q.decode_point(curve)?;
let key = match curve {
Curve::NistP256 =>
ecc::Point::new::<ecc::Secp256r1>(x, y)?,
Curve::NistP384 =>
ecc::Point::new::<ecc::Secp384r1>(x, y)?,
Curve::NistP521 =>
ecc::Point::new::<ecc::Secp521r1>(x, y)?,
_ =>
return Err(
Error::UnsupportedEllipticCurve(curve.clone())
.into()),
};
let signature = dsa::Signature::new(&r.value, &s.value);
Ok(ecdsa::verify(&key, hash, &signature))
},
_ => Err(Error::MalformedPacket(format!(
"unsupported combination of algorithm {:?}, key {:?} and signature {:?}.",
self.pk_algo(), key.mpis(), self.mpis)).into())
}
}
/// Verifies the signature using `key`.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `key` can made
/// valid signatures; it is up to the caller to make sure the key
/// is not revoked, not expired, has a valid self-signature, has a
/// subkey binding signature (if appropriate), has the signing
/// capability, etc.
pub fn verify(&self, key: &Key) -> Result<bool> {
if !(self.sigtype() == SignatureType::Binary
|| self.sigtype() == SignatureType::Text
|| self.sigtype() == SignatureType::Standalone) {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
if let Some((hash_algo, ref hash)) = self.computed_hash {
self.verify_hash(key, hash_algo, hash)
} else {
Err(Error::BadSignature("Hash not computed.".to_string()).into())
}
}
/// Verifies the primary key binding.
///
/// `self` is the primary key binding signature, `signer` is the
/// key that allegedly made the signature, and `pk` is the primary
/// key.
///
/// For a self-signature, `signer` and `pk` will be the same.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_primary_key_binding(&self, signer: &Key, pk: &Key)
-> Result<bool>
{
if self.sigtype() != SignatureType::DirectKey {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
let hash = Signature::primary_key_binding_hash(self, pk)?;
self.verify_hash(signer, self.hash_algo(), &hash[..])
}
/// Verifies the primary key revocation certificate.
///
/// `self` is the primary key revocation certificate, `signer` is
/// the key that allegedly made the signature, and `pk` is the
/// primary key,
///
/// For a self-signature, `signer` and `pk` will be the same.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_primary_key_revocation(&self, signer: &Key, pk: &Key)
-> Result<bool>
{
if self.sigtype() != SignatureType::KeyRevocation {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
let hash = Signature::primary_key_binding_hash(self, pk)?;
self.verify_hash(signer, self.hash_algo(), &hash[..])
}
/// Verifies the subkey binding.
///
/// `self` is the subkey key binding signature, `signer` is the
/// key that allegedly made the signature, `pk` is the primary
/// key, and `subkey` is the subkey.
///
/// For a self-signature, `signer` and `pk` will be the same.
///
/// If the signature indicates that this is a `Signing` capable
/// subkey, then the back signature is also verified. If it is
/// missing or can't be verified, then this function returns
/// false.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_subkey_binding(&self, signer: &Key, pk: &Key, subkey: &Key)
-> Result<bool>
{
if self.sigtype() != SignatureType::SubkeyBinding {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
let hash = Signature::subkey_binding_hash(self, pk, subkey)?;
if self.verify_hash(signer, self.hash_algo(), &hash[..])? {
// The signature is good, but we may still need to verify
// the back sig.
} else {
return Ok(false);
}
if ! self.key_flags().can_sign() {
// No backsig required.
return Ok(true)
}
let mut backsig_ok = false;
if let Some(Packet::Signature(super::Signature::V4(backsig))) =
self.embedded_signature()
{
if backsig.sigtype() != SignatureType::PrimaryKeyBinding {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
} else {
// We can't use backsig.verify_subkey_binding.
let hash = Signature::subkey_binding_hash(&backsig, pk, &subkey)?;
match backsig.verify_hash(&subkey, backsig.hash_algo(), &hash[..])
{
Ok(true) => {
if TRACE {
eprintln!("{} / {}: Backsig is good!",
pk.keyid(), subkey.keyid());
}
backsig_ok = true;
},
Ok(false) => {
if TRACE {
eprintln!("{} / {}: Backsig is bad!",
pk.keyid(), subkey.keyid());
}
},
Err(err) => {
if TRACE {
eprintln!("{} / {}: Error validating backsig: {}",
pk.keyid(), subkey.keyid(),
err);
}
},
}
}
}
Ok(backsig_ok)
}
/// Verifies the subkey revocation.
///
/// `self` is the subkey key revocation certificate, `signer` is
/// the key that allegedly made the signature, `pk` is the primary
/// key, and `subkey` is the subkey.
///
/// For a self-revocation, `signer` and `pk` will be the same.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_subkey_revocation(&self, signer: &Key, pk: &Key,
subkey: &Key)
-> Result<bool>
{
if self.sigtype() != SignatureType::SubkeyRevocation {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
let hash = Signature::subkey_binding_hash(self, pk, subkey)?;
self.verify_hash(signer, self.hash_algo(), &hash[..])
}
/// Verifies the user id binding.
///
/// `self` is the user id binding signature, `signer` is the key
/// that allegedly made the signature, `pk` is the primary key,
/// and `userid` is the user id.
///
/// For a self-signature, `signer` and `pk` will be the same.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_userid_binding(&self, signer: &Key,
pk: &Key, userid: &UserID)
-> Result<bool>
{
if !(self.sigtype() == SignatureType::GenericCertificate
|| self.sigtype() == SignatureType::PersonaCertificate
|| self.sigtype() == SignatureType::CasualCertificate
|| self.sigtype() == SignatureType::PositiveCertificate) {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
let hash = Signature::userid_binding_hash(self, pk, userid)?;
self.verify_hash(signer, self.hash_algo(), &hash[..])
}
/// Verifies the user id revocation certificate.
///
/// `self` is the revocation certificate, `signer` is the key
/// that allegedly made the signature, `pk` is the primary key,
/// and `userid` is the user id.
///
/// For a self-signature, `signer` and `pk` will be the same.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_userid_revocation(&self, signer: &Key,
pk: &Key, userid: &UserID)
-> Result<bool>
{
if self.sigtype() != SignatureType::CertificateRevocation {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
let hash = Signature::userid_binding_hash(self, pk, userid)?;
self.verify_hash(signer, self.hash_algo(), &hash[..])
}
/// Verifies the user attribute binding.
///
/// `self` is the user attribute binding signature, `signer` is
/// the key that allegedly made the signature, `pk` is the primary
/// key, and `ua` is the user attribute.
///
/// For a self-signature, `signer` and `pk` will be the same.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_user_attribute_binding(&self, signer: &Key,
pk: &Key, ua: &UserAttribute)
-> Result<bool>
{
if !(self.sigtype() == SignatureType::GenericCertificate
|| self.sigtype() == SignatureType::PersonaCertificate
|| self.sigtype() == SignatureType::CasualCertificate
|| self.sigtype() == SignatureType::PositiveCertificate) {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
let hash = Signature::user_attribute_binding_hash(self, pk, ua)?;
self.verify_hash(signer, self.hash_algo(), &hash[..])
}
/// Verifies the user attribute revocation certificate.
///
/// `self` is the user attribute binding signature, `signer` is
/// the key that allegedly made the signature, `pk` is the primary
/// key, and `ua` is the user attribute.
///
/// For a self-signature, `signer` and `pk` will be the same.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_user_attribute_revocation(&self, signer: &Key,
pk: &Key, ua: &UserAttribute)
-> Result<bool>
{
if self.sigtype() != SignatureType::CertificateRevocation {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
let hash = Signature::user_attribute_binding_hash(self, pk, ua)?;
self.verify_hash(signer, self.hash_algo(), &hash[..])
}
/// Verifies a signature of a message.
///
/// `self` is the message signature, `signer` is
/// the key that allegedly made the signature and `msg` is the message.
///
/// This function is for short messages, if you want to verify larger files
/// use `Verifier`.
///
/// Note: This only verifies the cryptographic signature.
/// Constraints on the signature, like creation and expiration
/// time, or signature revocations must be checked by the caller.
///
/// Likewise, this function does not check whether `signer` can
/// made valid signatures; it is up to the caller to make sure the
/// key is not revoked, not expired, has a valid self-signature,
/// has a subkey binding signature (if appropriate), has the
/// signing capability, etc.
pub fn verify_message(&self, signer: &Key, msg: &[u8])
-> Result<bool>
{
if self.sigtype() != SignatureType::Binary &&
self.sigtype() != SignatureType::Text {
return Err(Error::UnsupportedSignatureType(self.sigtype()).into());
}
// Compute the digest.
let mut hash = self.hash_algo().context()?;
let mut digest = vec![0u8; hash.digest_size()];
hash.update(msg);
self.hash(&mut hash);
hash.digest(&mut digest);
self.verify_hash(signer, self.hash_algo(), &digest[..])
}
}
impl From<Signature4> for Packet {
fn from(s: Signature4) -> Self {
Packet::Signature(s.into())
}
}
impl From<Signature4> for super::Signature {
fn from(s: Signature4) -> Self {
super::Signature::V4(s)
}
}
#[cfg(test)]
mod test {
use nettle::{Random, Yarrow};
use super::*;
use crypto::KeyPair;
use crypto::mpis::MPI;
use TPK;
use parse::Parse;
use packet::key::Key4;
#[cfg(feature = "compression-deflate")]
#[test]
fn signature_verification_test() {
use super::*;
use TPK;
use parse::{PacketParserResult, PacketParser};
struct Test<'a> {
key: &'a str,
data: &'a str,
good: usize,
};
let tests = [
Test {
key: &"neal.pgp"[..],
data: &"signed-1.gpg"[..],
good: 1,
},
Test {
key: &"neal.pgp"[..],
data: &"signed-1-sha1-neal.gpg"[..],
good: 1,
},
Test {
key: &"testy.pgp"[..],
data: &"signed-1-sha256-testy.gpg"[..],
good: 1,
},
Test {
key: &"dennis-simon-anton.pgp"[..],
data: &"signed-1-dsa.pgp"[..],
good: 1,
},
Test {
key: &"erika-corinna-daniela-simone-antonia-nistp256.pgp"[..],
data: &"signed-1-ecdsa-nistp256.pgp"[..],
good: 1,
},
Test {
key: &"erika-corinna-daniela-simone-antonia-nistp384.pgp"[..],
data: &"signed-1-ecdsa-nistp384.pgp"[..],
good: 1,
},
Test {
key: &"erika-corinna-daniela-simone-antonia-nistp521.pgp"[..],
data: &"signed-1-ecdsa-nistp521.pgp"[..],
good: 1,
},
Test {
key: &"emmelie-dorothea-dina-samantha-awina-ed25519.pgp"[..],
data: &"signed-1-eddsa-ed25519.pgp"[..],
good: 1,
},
Test {
key: &"emmelie-dorothea-dina-samantha-awina-ed25519.pgp"[..],
data: &"signed-twice-by-ed25519.pgp"[..],
good: 2,
},
Test {
key: "neal.pgp",
data: "signed-1-notarized-by-ed25519.pgp",
good: 1,
},
Test {
key: "emmelie-dorothea-dina-samantha-awina-ed25519.pgp",
data: "signed-1-notarized-by-ed25519.pgp",
good: 1,
},
// Check with the wrong key.
Test {
key: &"neal.pgp"[..],
data: &"signed-1-sha256-testy.gpg"[..],
good: 0,
},
Test {
key: &"neal.pgp"[..],
data: &"signed-2-partial-body.gpg"[..],
good: 1,
},
];
for test in tests.iter() {
eprintln!("{}, expect {} good signatures:",
test.data, test.good);
let tpk = TPK::from_file(
path_to(&format!("keys/{}", test.key)[..])).unwrap();
let mut good = 0;
let mut ppr = PacketParser::from_file(
path_to(&format!("messages/{}", test.data)[..])).unwrap();
while let PacketParserResult::Some(mut pp) = ppr {
if let Packet::Signature(ref sig) = pp.packet {
let result = sig.verify(tpk.primary()).unwrap_or(false);
eprintln!(" Primary {:?}: {:?}",
tpk.primary().fingerprint(), result);
if result {
good += 1;
}
for sk in &tpk.subkeys {
let result = sig.verify(sk.subkey()).unwrap_or(false);
eprintln!(" Subkey {:?}: {:?}",
sk.subkey().fingerprint(), result);
if result {
good += 1;
}
}
}
// Get the next packet.
ppr = pp.recurse().unwrap().1;
}
assert_eq!(good, test.good, "Signature verification failed.");
}
}
#[test]
fn signature_level() {
use PacketPile;
let p = PacketPile::from_file(
path_to("messages/signed-1-notarized-by-ed25519.pgp")).unwrap()
.into_children().collect::<Vec<Packet>>();
if let Packet::Signature(ref sig) = &p[3] {
assert_eq!(sig.level(), 0);
} else {
panic!("expected signature")
}
if let Packet::Signature(ref sig) = &p[4] {
assert_eq!(sig.level(), 1);
} else {
panic!("expected signature")
}
}
#[test]
fn sign_verify() {
use packet::key::SecretKey;
let hash_algo = HashAlgorithm::SHA512;
let mut hash = vec![0; hash_algo.context().unwrap().digest_size()];
Yarrow::default().random(&mut hash);
for key in &[
"keys/testy-private.pgp",
"keys/dennis-simon-anton-private.pgp",
"keys/erika-corinna-daniela-simone-antonia-nistp256-private.pgp",
"keys/erika-corinna-daniela-simone-antonia-nistp384-private.pgp",
"keys/erika-corinna-daniela-simone-antonia-nistp521-private.pgp",
"keys/emmelie-dorothea-dina-samantha-awina-ed25519-private.pgp",
] {
let tpk = TPK::from_file(path_to(key)).unwrap();
let pair = tpk.primary();
if let Some(SecretKey::Unencrypted{ mpis: ref sec }) = pair.secret() {
let mut sig = Builder::new(SignatureType::Binary);
let mut hash = hash_algo.context().unwrap();
// Make signature.
let sig = sig.sign_hash(&mut KeyPair::new(pair.clone(),
sec.clone()).unwrap(),
hash_algo, hash).unwrap();
// Good signature.
let mut hash = hash_algo.context().unwrap();
sig.hash(&mut hash);
let mut digest = vec![0u8; hash.digest_size()];
hash.digest(&mut digest);
assert!(sig.verify_hash(&pair, hash_algo, &digest).unwrap());
// Bad signature.
digest[0] ^= 0xff;
assert!(! sig.verify_hash(&pair, hash_algo, &digest).unwrap());
} else {
panic!("secret key is encrypted/missing");
}
}
}
#[test]
fn sign_message() {
use time;
use constants::Curve;
use packet::key::SecretKey;
let key: Key = Key4::generate_ecc(true, Curve::Ed25519)
.unwrap().into();
let msg = b"Hello, World";
match key.secret() {
Some(SecretKey::Unencrypted{ ref mpis }) => {
let sig = Builder::new(SignatureType::Binary)
.set_signature_creation_time(time::now()).unwrap()
.set_issuer_fingerprint(key.fingerprint()).unwrap()
.set_issuer(key.keyid()).unwrap()
.sign_message(
&mut KeyPair::new(key.clone(), mpis.clone()).unwrap(),
HashAlgorithm::SHA512, msg).unwrap();
assert!(sig.verify_message(&key, msg).unwrap());
}
_ => unreachable!()
};
}
#[test]
fn verify_message() {
use std::fs::File;
use std::io::Read;
let tpk = TPK::from_file(path_to(
"keys/emmelie-dorothea-dina-samantha-awina-ed25519.pgp"))
.unwrap();
let msg = {
let mut fd = File::open(
path_to("messages/a-cypherpunks-manifesto.txt")).unwrap();
let mut buf = Vec::default();
fd.read_to_end(&mut buf).unwrap();
buf
};
let sig = {
let mut fd = File::open(path_to(
"messages/a-cypherpunks-manifesto.txt.ed25519.sig")).unwrap();
Signature::from_reader(&mut fd).unwrap()
};
assert!(sig.verify_message(tpk.primary(), &msg[..]).unwrap());
}
#[test]
fn sign_with_short_ed25519_secret_key() {
use conversions::Time;
use nettle;
use time;
// 20 byte sec key
let sec = [
0x0,0x0,
0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,
0x1,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,
0x1,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2
];
let mut pnt = [0x40u8; nettle::ed25519::ED25519_KEY_SIZE + 1];
ed25519::public_key(&mut pnt[1..], &sec[..]).unwrap();
let public_mpis = mpis::PublicKey::EdDSA {
curve: Curve::Ed25519,
q: MPI::new(&pnt[..]),
};
let private_mpis = mpis::SecretKey::EdDSA {
scalar: MPI::new(&sec[..]),
};
let key = Key4::new(time::now().canonicalize(),
PublicKeyAlgorithm::EdDSA, public_mpis, None)
.unwrap().into();
let msg = b"Hello, World";
let mut hash = HashAlgorithm::SHA256.context().unwrap();
hash.update(&msg[..]);
Builder::new(SignatureType::Text)
.sign_hash(&mut KeyPair::new(key, private_mpis).unwrap(),
HashAlgorithm::SHA256, hash).unwrap();
}
#[test]
fn verify_gpg_3rd_party_cert() {
use TPK;
let test1 = TPK::from_file(
path_to("keys/test1-certification-key.pgp")).unwrap();
let cert_key1 = test1.keys_all()
.certification_capable()
.nth(0)
.map(|x| x.2)
.unwrap();
let test2 = TPK::from_file(
path_to("keys/test2-signed-by-test1.pgp")).unwrap();
let uid_binding = &test2.primary_key_signature_full().unwrap().0.unwrap();
let cert = &uid_binding.certifications()[0];
assert_eq!(cert.verify_userid_binding(cert_key1, test2.primary(), uid_binding.userid()).ok(), Some(true));
}
}