mirror of
https://github.com/RGBCube/serenity
synced 2025-05-31 13:38:11 +00:00
5963f6f9ff
Since the operations are already complicated and will become even more so soon, let's split them into their own files. We can also integrate the NumberTheory operations that would better fit there into this class as well. This commit doesn't change behaviors, but moves the allocation of some variables into caller classes.
112 lines
3.3 KiB
C++
112 lines
3.3 KiB
C++
/*
|
|
* Copyright (c) 2020, Itamar S. <itamar8910@gmail.com>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/ByteBuffer.h>
|
|
#include <AK/Span.h>
|
|
#include <AK/String.h>
|
|
#include <AK/Types.h>
|
|
#include <AK/Vector.h>
|
|
|
|
namespace Crypto {
|
|
|
|
struct UnsignedDivisionResult;
|
|
constexpr size_t STARTING_WORD_SIZE = 512;
|
|
|
|
class UnsignedBigInteger {
|
|
public:
|
|
UnsignedBigInteger(u32 x) { m_words.append(x); }
|
|
|
|
explicit UnsignedBigInteger(Vector<u32, STARTING_WORD_SIZE>&& words)
|
|
: m_words(move(words))
|
|
{
|
|
}
|
|
|
|
explicit UnsignedBigInteger(const u8* ptr, size_t length);
|
|
|
|
UnsignedBigInteger() { }
|
|
|
|
static UnsignedBigInteger create_invalid();
|
|
|
|
static UnsignedBigInteger import_data(const StringView& data) { return import_data((const u8*)data.characters_without_null_termination(), data.length()); }
|
|
static UnsignedBigInteger import_data(const u8* ptr, size_t length)
|
|
{
|
|
return UnsignedBigInteger(ptr, length);
|
|
}
|
|
|
|
size_t export_data(Bytes, bool remove_leading_zeros = false) const;
|
|
|
|
static UnsignedBigInteger from_base10(const String& str);
|
|
String to_base10() const;
|
|
|
|
const Vector<u32, STARTING_WORD_SIZE>& words() const { return m_words; }
|
|
|
|
void set_to_0();
|
|
void set_to(u32 other);
|
|
void set_to(const UnsignedBigInteger& other);
|
|
|
|
void invalidate()
|
|
{
|
|
m_is_invalid = true;
|
|
m_cached_trimmed_length = {};
|
|
}
|
|
|
|
bool is_invalid() const { return m_is_invalid; }
|
|
|
|
size_t length() const { return m_words.size(); }
|
|
// The "trimmed length" is the number of words after trimming leading zeroed words
|
|
size_t trimmed_length() const;
|
|
|
|
void clamp_to_trimmed_length();
|
|
|
|
UnsignedBigInteger plus(const UnsignedBigInteger& other) const;
|
|
UnsignedBigInteger minus(const UnsignedBigInteger& other) const;
|
|
UnsignedBigInteger bitwise_or(const UnsignedBigInteger& other) const;
|
|
UnsignedBigInteger bitwise_and(const UnsignedBigInteger& other) const;
|
|
UnsignedBigInteger bitwise_xor(const UnsignedBigInteger& other) const;
|
|
UnsignedBigInteger bitwise_not() const;
|
|
UnsignedBigInteger shift_left(size_t num_bits) const;
|
|
UnsignedBigInteger multiplied_by(const UnsignedBigInteger& other) const;
|
|
UnsignedDivisionResult divided_by(const UnsignedBigInteger& divisor) const;
|
|
|
|
void set_bit_inplace(size_t bit_index);
|
|
|
|
bool operator==(const UnsignedBigInteger& other) const;
|
|
bool operator!=(const UnsignedBigInteger& other) const;
|
|
bool operator<(const UnsignedBigInteger& other) const;
|
|
|
|
private:
|
|
friend class UnsignedBigIntegerAlgorithms;
|
|
|
|
static constexpr size_t BITS_IN_WORD = 32;
|
|
// Little endian
|
|
// m_word[0] + m_word[1] * 256 + m_word[2] * 65536 + ...
|
|
Vector<u32, STARTING_WORD_SIZE> m_words;
|
|
|
|
// Used to indicate a negative result, or a result of an invalid operation
|
|
bool m_is_invalid { false };
|
|
|
|
mutable Optional<size_t> m_cached_trimmed_length;
|
|
};
|
|
|
|
struct UnsignedDivisionResult {
|
|
Crypto::UnsignedBigInteger quotient;
|
|
Crypto::UnsignedBigInteger remainder;
|
|
};
|
|
|
|
}
|
|
|
|
template<>
|
|
struct AK::Formatter<Crypto::UnsignedBigInteger> : Formatter<StringView> {
|
|
void format(FormatBuilder&, const Crypto::UnsignedBigInteger&);
|
|
};
|
|
|
|
inline Crypto::UnsignedBigInteger
|
|
operator""_bigint(const char* string, size_t length)
|
|
{
|
|
return Crypto::UnsignedBigInteger::from_base10({ string, length });
|
|
}
|