/* * (C) Copyright Projet SECRET, INRIA, Rocquencourt * (C) Bhaskar Biswas and Nicolas Sendrier * * (C) 2014 cryptosource GmbH * (C) 2014 Falko Strenzke fstrenzke@cryptosource.de * * Botan is released under the Simplified BSD License (see license.txt) * */ #ifndef BOTAN_MCELIECE_KEY_H_ #define BOTAN_MCELIECE_KEY_H_ #include namespace Botan { typedef uint16_t gf2m; class polyn_gf2m; class BOTAN_PUBLIC_API(2,0) McEliece_PublicKey : public virtual Public_Key { public: explicit McEliece_PublicKey(const std::vector& key_bits); McEliece_PublicKey(const std::vector& pub_matrix, size_t t, size_t the_code_length) : m_public_matrix(pub_matrix), m_t(t), m_code_length(the_code_length){} McEliece_PublicKey(const McEliece_PublicKey& other) = default; McEliece_PublicKey& operator=(const McEliece_PublicKey& other) = default; virtual ~McEliece_PublicKey()= default; secure_vector random_plaintext_element(RandomNumberGenerator& rng) const; std::string algo_name() const override { return "McEliece"; } AlgorithmIdentifier algorithm_identifier() const override; size_t key_length() const override; size_t estimated_strength() const override; std::vector public_key_bits() const override; bool check_key(RandomNumberGenerator&, bool) const override { return true; } size_t get_t() const { return m_t; } size_t get_code_length() const { return m_code_length; } size_t get_message_word_bit_length() const; const std::vector& 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); } std::unique_ptr create_kem_encryption_op(RandomNumberGenerator& rng, const std::string& params, const std::string& provider) const override; protected: McEliece_PublicKey() : m_t(0), m_code_length(0) {} std::vector m_public_matrix; size_t m_t; size_t m_code_length; }; class BOTAN_PUBLIC_API(2,0) McEliece_PrivateKey final : public virtual McEliece_PublicKey, public virtual Private_Key { public: /** Generate a McEliece key pair Suggested parameters for a given security level (SL) SL=80 n=1632 t=33 - 59 KB pubkey 140 KB privkey SL=107 n=2480 t=45 - 128 KB pubkey 300 KB privkey SL=128 n=2960 t=57 - 195 KB pubkey 459 KB privkey SL=147 n=3408 t=67 - 265 KB pubkey 622 KB privkey SL=191 n=4624 t=95 - 516 KB pubkey 1234 KB privkey SL=256 n=6624 t=115 - 942 KB pubkey 2184 KB privkey */ McEliece_PrivateKey(RandomNumberGenerator& rng, size_t code_length, size_t t); explicit McEliece_PrivateKey(const secure_vector& key_bits); McEliece_PrivateKey(polyn_gf2m const& goppa_polyn, std::vector const& parity_check_matrix_coeffs, std::vector const& square_root_matrix, std::vector const& inverse_support, std::vector const& public_matrix ); ~McEliece_PrivateKey(); McEliece_PrivateKey(const McEliece_PrivateKey&); McEliece_PrivateKey(McEliece_PrivateKey&&); McEliece_PrivateKey& operator=(const McEliece_PrivateKey&); McEliece_PrivateKey& operator=(McEliece_PrivateKey&&); bool check_key(RandomNumberGenerator& rng, bool strong) const override; polyn_gf2m const& get_goppa_polyn() const; std::vector const& get_H_coeffs() const { return m_coeffs; } std::vector const& get_Linv() const { return m_Linv; } std::vector const& get_sqrtmod() const { return m_sqrtmod; } inline size_t get_dimension() const { return m_dimension; } inline size_t get_codimension() const { return m_codimension; } secure_vector private_key_bits() const override; std::unique_ptr public_key() const override; bool operator==(const McEliece_PrivateKey & other) const; bool operator!=(const McEliece_PrivateKey& other) const { return !(*this == other); } std::unique_ptr create_kem_decryption_op(RandomNumberGenerator& rng, const std::string& params, const std::string& provider) const override; private: std::vector m_g; // single element std::vector m_sqrtmod; std::vector m_Linv; std::vector m_coeffs; size_t m_codimension; size_t m_dimension; }; /** * Estimate work factor for McEliece * @return estimated security level for these key parameters */ BOTAN_PUBLIC_API(2,0) size_t mceliece_work_factor(size_t code_size, size_t t); } #endif