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
|
package fixchain
import (
"crypto/sha256"
"sort"
"github.com/google/certificate-transparency/go/x509"
)
const hashSize = sha256.Size
var newHash = sha256.New
func hash(c *x509.Certificate) (hash [hashSize]byte) {
copy(hash[:], newHash().Sum(c.Raw))
return
}
func hashChain(ch []*x509.Certificate) (hash [hashSize]byte) {
h := newHash()
for _, c := range ch {
h.Write(newHash().Sum(c.Raw))
}
copy(hash[:], h.Sum(nil))
return
}
// hashBag hashes all of the certs in the chain, irrespective of their order.
// Chains containing the same certs in the same order with no duplicates will
// result in the same hash. Chains containing the same certs in different orders
// with no duplicates will result in the same hash. Chains containing the same
// certs (either in the same order or in different orders) that contain exactly
// the same duplicated certs, will result in the same hash. If chains contain
// the same certs (either in the same order or in different orders) and some
// certs are duplicated, but the specific certs that are duplicated differ
// and/or the number of times they are duplicated differ, these chains will
// result in different hashes.
func hashBag(chain []*x509.Certificate) [hashSize]byte {
b := bag{certs: make([]*x509.Certificate, len(chain))}
copy(b.certs, chain)
sort.Sort(b)
return hashChain(b.certs)
}
type bag struct {
certs []*x509.Certificate
}
// sort.Sort(data Interface) for bag - uses data.Len, data.Less & data.Swap
func (b bag) Len() int { return len(b.certs) }
func (b bag) Less(i, j int) bool {
ci := b.certs[i].Raw
cj := b.certs[j].Raw
if len(ci) != len(cj) {
return len(ci) < len(cj)
}
for n := range ci {
if ci[n] < cj[n] {
return true
}
if ci[n] > cj[n] {
return false
}
}
return false
}
func (b bag) Swap(i, j int) {
t := b.certs[i]
b.certs[i] = b.certs[j]
b.certs[j] = t
}
|
