OLD | NEW |
1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2013 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 #include "net/quic/crypto/aes_128_gcm_12_decrypter.h" | 5 #include "net/quic/crypto/aes_128_gcm_12_decrypter.h" |
6 | 6 |
7 #include <openssl/evp.h> | 7 #include <openssl/evp.h> |
8 #include <openssl/tls1.h> | 8 #include <openssl/tls1.h> |
9 | 9 |
10 namespace net { | 10 namespace net { |
(...skipping 14 matching lines...) Expand all Loading... |
25 static_assert(kNoncePrefixSize <= kMaxNoncePrefixSize, | 25 static_assert(kNoncePrefixSize <= kMaxNoncePrefixSize, |
26 "nonce prefix size too big"); | 26 "nonce prefix size too big"); |
27 } | 27 } |
28 | 28 |
29 Aes128Gcm12Decrypter::~Aes128Gcm12Decrypter() {} | 29 Aes128Gcm12Decrypter::~Aes128Gcm12Decrypter() {} |
30 | 30 |
31 const char* Aes128Gcm12Decrypter::cipher_name() const { | 31 const char* Aes128Gcm12Decrypter::cipher_name() const { |
32 return TLS1_TXT_ECDHE_RSA_WITH_AES_128_GCM_SHA256; | 32 return TLS1_TXT_ECDHE_RSA_WITH_AES_128_GCM_SHA256; |
33 } | 33 } |
34 | 34 |
35 uint32 Aes128Gcm12Decrypter::cipher_id() const { | 35 uint32_t Aes128Gcm12Decrypter::cipher_id() const { |
36 // This OpenSSL macro has the value 0x0300C02F. The two most significant bytes | 36 // This OpenSSL macro has the value 0x0300C02F. The two most significant bytes |
37 // 0x0300 are OpenSSL specific and are NOT part of the TLS CipherSuite value | 37 // 0x0300 are OpenSSL specific and are NOT part of the TLS CipherSuite value |
38 // for TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256. | 38 // for TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256. |
39 return TLS1_CK_ECDHE_RSA_WITH_AES_128_GCM_SHA256; | 39 return TLS1_CK_ECDHE_RSA_WITH_AES_128_GCM_SHA256; |
40 } | 40 } |
41 | 41 |
42 } // namespace net | 42 } // namespace net |
OLD | NEW |