mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-05-02 01:08:48 +00:00
c2a900b853
These instances were detected by searching for files that include AK/StdLibExtras.h, but don't match the regex: \\b(abs|AK_REPLACED_STD_NAMESPACE|array_size|ceil_div|clamp|exchange|for ward|is_constant_evaluated|is_power_of_two|max|min|mix|move|_RawPtr|RawP tr|round_up_to_power_of_two|swap|to_underlying)\\b (Without the linebreaks.) This regex is pessimistic, so there might be more files that don't actually use any "extra stdlib" functions. In theory, one might use LibCPP to detect things like this automatically, but let's do this one step after another.
103 lines
2.8 KiB
C++
103 lines
2.8 KiB
C++
/*
|
|
* Copyright (c) 2020, Ali Mohammad Pur <mpfard@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/ByteBuffer.h>
|
|
#include <AK/Span.h>
|
|
#include <LibCrypto/Cipher/Cipher.h>
|
|
|
|
namespace Crypto {
|
|
namespace Cipher {
|
|
|
|
template<typename T>
|
|
class Mode {
|
|
public:
|
|
virtual ~Mode() = default;
|
|
|
|
virtual void encrypt(ReadonlyBytes in, Bytes& out, ReadonlyBytes ivec = {}, Bytes* ivec_out = nullptr) = 0;
|
|
virtual void decrypt(ReadonlyBytes in, Bytes& out, ReadonlyBytes ivec = {}) = 0;
|
|
|
|
virtual size_t IV_length() const = 0;
|
|
|
|
T const& cipher() const { return m_cipher; }
|
|
|
|
ErrorOr<ByteBuffer> create_aligned_buffer(size_t input_size) const
|
|
{
|
|
size_t remainder = (input_size + T::block_size()) % T::block_size();
|
|
if (remainder == 0)
|
|
return ByteBuffer::create_uninitialized(input_size);
|
|
else
|
|
return ByteBuffer::create_uninitialized(input_size + T::block_size() - remainder);
|
|
}
|
|
|
|
#ifndef KERNEL
|
|
virtual DeprecatedString class_name() const = 0;
|
|
#endif
|
|
|
|
T& cipher()
|
|
{
|
|
return m_cipher;
|
|
}
|
|
|
|
protected:
|
|
virtual void prune_padding(Bytes& data)
|
|
{
|
|
auto size = data.size();
|
|
switch (m_cipher.padding_mode()) {
|
|
case PaddingMode::CMS: {
|
|
auto maybe_padding_length = data[size - 1];
|
|
if (maybe_padding_length >= T::block_size()) {
|
|
// cannot be padding (the entire block cannot be padding)
|
|
return;
|
|
}
|
|
for (auto i = size - maybe_padding_length; i < size; ++i) {
|
|
if (data[i] != maybe_padding_length) {
|
|
// not padding, part of data
|
|
return;
|
|
}
|
|
}
|
|
data = data.slice(0, size - maybe_padding_length);
|
|
break;
|
|
}
|
|
case PaddingMode::RFC5246: {
|
|
auto maybe_padding_length = data[size - 1];
|
|
// FIXME: If we want constant-time operations, this loop should not stop
|
|
for (auto i = size - maybe_padding_length - 1; i < size; ++i) {
|
|
if (data[i] != maybe_padding_length) {
|
|
// note that this is likely invalid padding
|
|
return;
|
|
}
|
|
}
|
|
data = data.slice(0, size - maybe_padding_length - 1);
|
|
break;
|
|
}
|
|
case PaddingMode::Null: {
|
|
while (data[size - 1] == 0)
|
|
--size;
|
|
data = data.slice(0, size);
|
|
break;
|
|
}
|
|
default:
|
|
// FIXME: support other padding modes
|
|
VERIFY_NOT_REACHED();
|
|
break;
|
|
}
|
|
}
|
|
|
|
// FIXME: Somehow add a reference version of this
|
|
template<typename... Args>
|
|
Mode(Args... args)
|
|
: m_cipher(args...)
|
|
{
|
|
}
|
|
|
|
private:
|
|
T m_cipher;
|
|
};
|
|
}
|
|
|
|
}
|