OLD | NEW |
---|---|
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 5 #ifndef NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
6 #define NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 6 #define NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
7 | 7 |
8 #include <stddef.h> | 8 #include <stddef.h> |
9 #include <stdint.h> | 9 #include <stdint.h> |
10 | 10 |
(...skipping 29 matching lines...) Expand all Loading... | |
40 const QuicTag kPRST = TAG('P', 'R', 'S', 'T'); // Public reset | 40 const QuicTag kPRST = TAG('P', 'R', 'S', 'T'); // Public reset |
41 const QuicTag kSCUP = TAG('S', 'C', 'U', 'P'); // Server config update. | 41 const QuicTag kSCUP = TAG('S', 'C', 'U', 'P'); // Server config update. |
42 | 42 |
43 // Key exchange methods | 43 // Key exchange methods |
44 const QuicTag kP256 = TAG('P', '2', '5', '6'); // ECDH, Curve P-256 | 44 const QuicTag kP256 = TAG('P', '2', '5', '6'); // ECDH, Curve P-256 |
45 const QuicTag kC255 = TAG('C', '2', '5', '5'); // ECDH, Curve25519 | 45 const QuicTag kC255 = TAG('C', '2', '5', '5'); // ECDH, Curve25519 |
46 | 46 |
47 // AEAD algorithms | 47 // AEAD algorithms |
48 const QuicTag kNULL = TAG('N', 'U', 'L', 'N'); // null algorithm | 48 const QuicTag kNULL = TAG('N', 'U', 'L', 'N'); // null algorithm |
49 const QuicTag kAESG = TAG('A', 'E', 'S', 'G'); // AES128 + GCM-12 | 49 const QuicTag kAESG = TAG('A', 'E', 'S', 'G'); // AES128 + GCM-12 |
50 const QuicTag kCC12 = TAG('C', 'C', '1', '2'); // ChaCha20 + Poly1305 | |
51 const QuicTag kCC20 = TAG('C', 'C', '2', '0'); // ChaCha20 + Poly1305 RFC7539 | 50 const QuicTag kCC20 = TAG('C', 'C', '2', '0'); // ChaCha20 + Poly1305 RFC7539 |
davidben
2016/04/04 20:22:39
(Probably for a follow-up, but I'd suggest getting
Ryan Hamilton
2016/04/04 20:34:12
Totally will do so after all this sorts itself out
| |
52 | 51 |
53 // Socket receive buffer | 52 // Socket receive buffer |
54 const QuicTag kSRBF = TAG('S', 'R', 'B', 'F'); // Socket receive buffer | 53 const QuicTag kSRBF = TAG('S', 'R', 'B', 'F'); // Socket receive buffer |
55 | 54 |
56 // Congestion control feedback types | 55 // Congestion control feedback types |
57 const QuicTag kQBIC = TAG('Q', 'B', 'I', 'C'); // TCP cubic | 56 const QuicTag kQBIC = TAG('Q', 'B', 'I', 'C'); // TCP cubic |
58 | 57 |
59 // Connection options (COPT) values | 58 // Connection options (COPT) values |
60 const QuicTag kAFCW = TAG('A', 'F', 'C', 'W'); // Auto-tune flow control | 59 const QuicTag kAFCW = TAG('A', 'F', 'C', 'W'); // Auto-tune flow control |
61 // receive windows. | 60 // receive windows. |
(...skipping 161 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
223 // amplification factor of any mirror DoS attack. | 222 // amplification factor of any mirror DoS attack. |
224 // | 223 // |
225 // A client may pad an inchoate client hello to a size larger than | 224 // A client may pad an inchoate client hello to a size larger than |
226 // kClientHelloMinimumSize to make it more likely to receive a complete | 225 // kClientHelloMinimumSize to make it more likely to receive a complete |
227 // rejection message. | 226 // rejection message. |
228 const size_t kClientHelloMinimumSize = 1024; | 227 const size_t kClientHelloMinimumSize = 1024; |
229 | 228 |
230 } // namespace net | 229 } // namespace net |
231 | 230 |
232 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ | 231 #endif // NET_QUIC_CRYPTO_CRYPTO_PROTOCOL_H_ |
OLD | NEW |