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
|
// Copyright (c) 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/third_party/quiche/src/quic/core/crypto/curve25519_key_exchange.h"
#include <cstdint>
#include <string>
#include "third_party/boringssl/src/include/openssl/curve25519.h"
#include "net/third_party/quiche/src/quic/core/crypto/quic_random.h"
#include "net/third_party/quiche/src/quic/platform/api/quic_bug_tracker.h"
#include "net/third_party/quiche/src/quic/platform/api/quic_ptr_util.h"
#include "net/third_party/quiche/src/common/platform/api/quiche_string_piece.h"
namespace quic {
Curve25519KeyExchange::Curve25519KeyExchange() {}
Curve25519KeyExchange::~Curve25519KeyExchange() {}
// static
std::unique_ptr<Curve25519KeyExchange> Curve25519KeyExchange::New(
QuicRandom* rand) {
std::unique_ptr<Curve25519KeyExchange> result =
New(Curve25519KeyExchange::NewPrivateKey(rand));
QUIC_BUG_IF(result == nullptr);
return result;
}
// static
std::unique_ptr<Curve25519KeyExchange> Curve25519KeyExchange::New(
quiche::QuicheStringPiece private_key) {
// We don't want to #include the BoringSSL headers in the public header file,
// so we use literals for the sizes of private_key_ and public_key_. Here we
// assert that those values are equal to the values from the BoringSSL
// header.
static_assert(
sizeof(Curve25519KeyExchange::private_key_) == X25519_PRIVATE_KEY_LEN,
"header out of sync");
static_assert(
sizeof(Curve25519KeyExchange::public_key_) == X25519_PUBLIC_VALUE_LEN,
"header out of sync");
if (private_key.size() != X25519_PRIVATE_KEY_LEN) {
return nullptr;
}
auto ka = QuicWrapUnique(new Curve25519KeyExchange);
memcpy(ka->private_key_, private_key.data(), X25519_PRIVATE_KEY_LEN);
X25519_public_from_private(ka->public_key_, ka->private_key_);
return ka;
}
// static
std::string Curve25519KeyExchange::NewPrivateKey(QuicRandom* rand) {
uint8_t private_key[X25519_PRIVATE_KEY_LEN];
rand->RandBytes(private_key, sizeof(private_key));
return std::string(reinterpret_cast<char*>(private_key), sizeof(private_key));
}
bool Curve25519KeyExchange::CalculateSharedKeySync(
quiche::QuicheStringPiece peer_public_value,
std::string* shared_key) const {
if (peer_public_value.size() != X25519_PUBLIC_VALUE_LEN) {
return false;
}
uint8_t result[X25519_PUBLIC_VALUE_LEN];
if (!X25519(result, private_key_,
reinterpret_cast<const uint8_t*>(peer_public_value.data()))) {
return false;
}
shared_key->assign(reinterpret_cast<char*>(result), sizeof(result));
return true;
}
quiche::QuicheStringPiece Curve25519KeyExchange::public_value() const {
return quiche::QuicheStringPiece(reinterpret_cast<const char*>(public_key_),
sizeof(public_key_));
}
} // namespace quic
|
