diff options
Diffstat (limited to 'src/lib/pubkey/mce/mceliece_key.h')
-rw-r--r-- | src/lib/pubkey/mce/mceliece_key.h | 127 |
1 files changed, 127 insertions, 0 deletions
diff --git a/src/lib/pubkey/mce/mceliece_key.h b/src/lib/pubkey/mce/mceliece_key.h new file mode 100644 index 000000000..c51745bba --- /dev/null +++ b/src/lib/pubkey/mce/mceliece_key.h @@ -0,0 +1,127 @@ +/** + * (C) Copyright Projet SECRET, INRIA, Rocquencourt + * (C) Bhaskar Biswas and Nicolas Sendrier + * + * (C) 2014 cryptosource GmbH + * (C) 2014 Falko Strenzke [email protected] + * + * Distributed under the terms of the Botan license + * + */ + +#ifndef BOTAN_MCELIECE_KEY_H_ +#define BOTAN_MCELIECE_KEY_H_ + +#include <botan/exceptn.h> +#include <botan/pk_keys.h> +#include <botan/polyn_gf2m.h> +#include <botan/code_based_util.h> + +namespace Botan { + +class BOTAN_DLL McEliece_PublicKey : public virtual Public_Key + { + public: + + McEliece_PublicKey(const std::vector<byte>& key_bits); + + McEliece_PublicKey(std::vector<byte> const& pub_matrix, u32bit the_t, u32bit the_code_length) : + m_public_matrix(pub_matrix), + m_t(the_t), + m_code_length(the_code_length) + {} + + McEliece_PublicKey(const McEliece_PublicKey & other); + + std::string algo_name() const { return "McEliece/BIGGF2M"; } + + /** + * Get the maximum number of bits allowed to be fed to this key. + * This is the bitlength of the order of the base point. + * @result the maximum number of input bits + */ + size_t max_input_bits() const + { + return get_message_word_bit_length(); + }; + + AlgorithmIdentifier algorithm_identifier() const; + + size_t estimated_strength() const { return 0; } + + std::vector<byte> x509_subject_public_key() const; + + bool check_key(RandomNumberGenerator&, bool) const + { return true; } + + u32bit get_t() const { return m_t; } + u32bit get_code_length() const { return m_code_length; } + u32bit get_message_word_bit_length() const; + std::vector<byte> const& get_public_matrix() const { return m_public_matrix; } + + bool operator==(const McEliece_PublicKey& other) const; + bool operator!=(const McEliece_PublicKey& other) const { return !(*this == other); } + + protected: + McEliece_PublicKey() {} + + std::vector<byte> m_public_matrix; + u32bit m_t; + u32bit m_code_length; + }; + +class BOTAN_DLL McEliece_PrivateKey : public virtual McEliece_PublicKey, + public virtual Private_Key + { + public: + /** + * Get the maximum number of bits allowed to be fed to this key. + * This is the bitlength of the order of the base point. + * @result the maximum number of input bits + */ + size_t max_input_bits() const { + return m_Linv.size(); + }; + + McEliece_PrivateKey(const secure_vector<byte>& key_bits); + + McEliece_PrivateKey(polyn_gf2m const& goppa_polyn, + std::vector<u32bit> const& parity_check_matrix_coeffs, + std::vector<polyn_gf2m> const& square_root_matrix, + std::vector<gf2m> const& inverse_support, + std::vector<byte> const& public_matrix ); + + McEliece_PrivateKey(RandomNumberGenerator& rng, size_t code_length, size_t t); + bool check_key(RandomNumberGenerator& rng, bool strong) const; + + polyn_gf2m const& get_goppa_polyn() const { return m_g; }; + std::vector<u32bit> const& get_H_coeffs() const { return m_coeffs; }; + std::vector<gf2m> const& get_Linv() const { return m_Linv; }; + std::vector<polyn_gf2m> const& get_sqrtmod() const { return m_sqrtmod; }; + + inline u32bit get_dimension() const + { return m_dimension; }; + + inline u32bit get_codimension() const + { return m_codimension; }; + + + secure_vector<byte> pkcs8_private_key() const; + + bool operator==(const McEliece_PrivateKey & other) const; + + bool operator!=(const McEliece_PrivateKey& other) const { return !(*this == other); }; + + private: + polyn_gf2m m_g; + std::vector<polyn_gf2m> m_sqrtmod; + std::vector<gf2m> m_Linv; + std::vector<u32bit> m_coeffs; + + u32bit m_codimension; + u32bit m_dimension; + }; + +} + +#endif |