-
Notifications
You must be signed in to change notification settings - Fork 0
/
djb.go
186 lines (162 loc) · 4.5 KB
/
djb.go
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
package dr
import (
"crypto/hmac"
"fmt"
"hash"
"io"
"strconv"
"golang.org/x/crypto/blake2b"
"golang.org/x/crypto/chacha20poly1305"
"golang.org/x/crypto/curve25519"
"golang.org/x/crypto/hkdf"
)
// djb implements Ratchet using x25519, 256-bit
// XChaCha20-Poly1305, HKDF with BLAKE2b, and HMAC-BLAKE2b.
type djb struct {
// mkInfo is the HKDF info used when deriving message keys.
mkInfo []byte
// rkInfo is the HKDF info used when deriving root keys.
rkInfo []byte
}
var _ Ratchet = (*djb)(nil)
// DJB creates a Ratchet using X25519, 256-bit
// XChaCha20-Poly1305, HKDF with BLAKE2b, and HMAC-BLAKE2b.
//
// The namespace is used to bind keys to a particular application
// or context.
func DJB(namespace string) Ratchet {
return &djb{
mkInfo: []byte(namespace + "MessageKeys"),
rkInfo: []byte(namespace + "Ratchet"),
}
}
func (d djb) hash() hash.Hash {
h, err := blake2b.New256(nil)
if err != nil {
panic(err)
}
return h
}
func (djb) Generate(r io.Reader) (PrivateKey, error) {
const (
S = curve25519.ScalarSize
P = curve25519.PointSize
)
key := make([]byte, S+P)
if _, err := io.ReadFull(r, key[:S]); err != nil {
return nil, err
}
key[0] &= 248
key[31] &= 127
key[31] |= 64
pub, err := curve25519.X25519(key[:S], curve25519.Basepoint)
if err != nil {
return nil, err
}
copy(key[S:], pub)
return key, nil
}
func (djb) Public(priv PrivateKey) PublicKey {
if len(priv) != curve25519.ScalarSize+curve25519.PointSize {
panic("dr: invalid key pair size: " + strconv.Itoa(len(priv)))
}
return append(PublicKey(nil), priv[curve25519.ScalarSize:]...)
}
func (djb) DH(priv PrivateKey, pub PublicKey) ([]byte, error) {
if len(priv) != curve25519.ScalarSize+curve25519.PointSize {
panic("dr: invalid key pair size: " + strconv.Itoa(len(priv)))
}
if len(pub) != curve25519.PointSize {
panic("dr: invalid public key size: " + strconv.Itoa(len(pub)))
}
return curve25519.X25519(priv[:curve25519.ScalarSize], pub)
}
func (d djb) KDFrk(rk RootKey, dh []byte) (RootKey, ChainKey) {
if len(rk) != 32 {
panic("dr: invalid RootKey size: " + strconv.Itoa(len(rk)))
}
buf := make([]byte, 2*32)
// The Double Ratchet spec says:
//
// as the out of applying a KDF keyed by a 32-byte root
// key rk to a Diffie-Hellman output dh_out
//
// And so at first blush setting IKM=dh, info=rk might seem
// backward since the PRK extracted from the IKM is used to
// key the HMAC used in the expand step. But this is not the
// case, and checking other DR implementations confirms this.
r := hkdf.New(d.hash, dh, rk, d.rkInfo)
_, err := io.ReadFull(r, buf)
if err != nil {
panic(err)
}
return buf[:32:32], buf[32 : 2*32 : 2*32]
}
func (d djb) KDFck(ck ChainKey) (ChainKey, MessageKey) {
if len(ck) != 32 {
panic("dr: invalid ChainKey size: " + strconv.Itoa(len(ck)))
}
h := hmac.New(d.hash, ck)
const (
ckConst = 0x02
mkConst = 0x01
)
h.Write([]byte{ckConst})
ck = h.Sum(nil)
h.Reset()
h.Write([]byte{mkConst})
mk := h.Sum(nil)
return ck, mk
}
// derive derives a 256-bit XChaCha20-Poly1305 key and 192-bit
// XChaCha20-Poly1305 nonce.
func (d djb) derive(ikm []byte) (key, nonce []byte) {
const (
K = chacha20poly1305.KeySize
N = chacha20poly1305.NonceSizeX
)
buf := make([]byte, K+N)
r := hkdf.New(d.hash, ikm, nil, d.mkInfo)
_, err := io.ReadFull(r, buf)
if err != nil {
panic(err)
}
return buf[:K:K], buf[K : K+N : K+N]
}
func (d djb) Seal(key MessageKey, plaintext, additionalData []byte) []byte {
if len(key) != chacha20poly1305.KeySize {
panic("Seal: invalid message key size: " + strconv.Itoa(len(key)))
}
key, nonce := d.derive(key)
defer wipe(key)
aead, err := chacha20poly1305.NewX(key)
if err != nil {
panic(err)
}
return aead.Seal(nil, nonce, plaintext, additionalData)
}
func (d djb) Open(key MessageKey, ciphertext, additionalData []byte) ([]byte, error) {
if len(key) != chacha20poly1305.KeySize {
return nil, fmt.Errorf("Open: invalid message key size: %d", len(key))
}
key, nonce := d.derive(key)
defer wipe(key)
aead, err := chacha20poly1305.NewX(key)
if err != nil {
panic(err)
}
return aead.Open(nil, nonce, ciphertext, additionalData)
}
func (d djb) Header(priv PrivateKey, prevChainLength, messageNum int) Header {
if len(priv) != curve25519.ScalarSize+curve25519.PointSize {
panic("Header: invalid key pair size: " + strconv.Itoa(len(priv)))
}
return Header{
PublicKey: d.Public(priv),
PN: prevChainLength,
N: messageNum,
}
}
func (djb) Concat(additionalData []byte, h Header) []byte {
return Concat(additionalData, h)
}