2017-01-27 12:05:45 +00:00
// cryptlib.h - originally written and placed in the public domain by Wei Dai
2015-11-05 06:59:46 +00:00
2015-11-18 20:32:28 +00:00
//! \file cryptlib.h
//! \brief Abstract base classes that provide a uniform interface to this library.
2015-11-05 06:59:46 +00:00
2017-02-21 17:59:20 +00:00
/*! \mainpage Crypto++ Library 6.0 API Reference
2015-11-05 06:59:46 +00:00
< dl >
< dt > Abstract Base Classes < dd >
cryptlib . h
2015-11-23 00:17:15 +00:00
< dt > Authenticated Encryption Modes < dd >
CCM , EAX , \ ref GCM " GCM (2K tables) " , \ ref GCM " GCM (64K tables) "
< dt > Block Ciphers < dd >
2017-04-17 06:39:22 +00:00
\ ref Rijndael " AES " , ARIA , Weak : : ARC4 , Blowfish , BTEA , Camellia , CAST128 , CAST256 , DES ,
\ ref DES_EDE2 " 2-key Triple-DES " , \ ref DES_EDE3 " 3-key Triple-DES " , \ ref DES_XEX3 " DESX " ,
GOST , IDEA , \ ref LR " Luby-Rackoff " , MARS , RC2 , RC5 , RC6 , \ ref SAFER_K " SAFER-K " ,
\ ref SAFER_SK " SAFER-SK " , SEED , Serpent , \ ref SHACAL2 " SHACAL-2 " , SHARK , SKIPJACK ,
Square , TEA , \ ref ThreeWay " 3-Way " , Threefish , Twofish , XTEA
2015-11-23 00:17:15 +00:00
< dt > Stream Ciphers < dd >
2017-04-17 06:39:22 +00:00
ChaCha8 , ChaCha12 , ChaCha20 , \ ref Panama " Panama-LE " , \ ref Panama " Panama-BE " , Salsa20 ,
\ ref SEAL " SEAL-LE " , \ ref SEAL " SEAL-BE " , WAKE , XSalsa20
2015-11-05 06:59:46 +00:00
< dt > Hash Functions < dd >
2017-04-17 06:39:22 +00:00
BLAKE2s , BLAKE2b , \ ref Keccak " Keccak (F1600) " , SHA1 , SHA224 , SHA256 , SHA384 , SHA512 ,
\ ref SHA3 " SHA-3 " , Tiger , Whirlpool , RIPEMD160 , RIPEMD320 , RIPEMD128 , RIPEMD256 , SipHash ,
Weak : : MD2 , Weak : : MD4 , Weak : : MD5
2015-11-05 06:59:46 +00:00
< dt > Non - Cryptographic Checksums < dd >
CRC32 , Adler32
< dt > Message Authentication Codes < dd >
2016-12-03 23:17:10 +00:00
VMAC , HMAC , CBC_MAC , CMAC , DMAC , TTMAC , \ ref GCM " GCM (GMAC) " , BLAKE2 ( BLAKE2b and BLAKE2s ) , Poly1305
2015-11-05 06:59:46 +00:00
< dt > Random Number Generators < dd >
2015-11-23 00:17:15 +00:00
NullRNG ( ) , LC_RNG , RandomPool , BlockingRng , NonblockingRng , AutoSeededRandomPool , AutoSeededX917RNG ,
2017-04-17 06:39:22 +00:00
NIST Hash_DRBG and HMAC_DRBG , \ ref MersenneTwister " MersenneTwister (MT19937 and MT19937-AR) " , RDRAND , RDSEED
2015-11-23 00:17:15 +00:00
< dt > Key Derivation and Password - based Cryptography < dd >
2017-04-17 06:39:22 +00:00
HKDF , \ ref PKCS12_PBKDF " PBKDF (PKCS #12) " , \ ref PKCS5_PBKDF1 " PBKDF-1 (PKCS #5) " ,
\ ref PKCS5_PBKDF2_HMAC " PBKDF-2/HMAC (PKCS #5) "
2015-11-05 06:59:46 +00:00
< dt > Public Key Cryptosystems < dd >
DLIES , ECIES , LUCES , RSAES , RabinES , LUC_IES
< dt > Public Key Signature Schemes < dd >
DSA2 , GDSA , ECDSA , NR , ECNR , LUCSS , RSASS , RSASS_ISO , RabinSS , RWSS , ESIGN
< dt > Key Agreement < dd >
2017-04-17 06:39:22 +00:00
DH , DH2 , \ ref MQV_Domain " MQV " , \ ref HMQV_Domain " HMQV " , \ ref FHMQV_Domain " FHMQV " , ECDH , ECMQV , ECHMQV ,
ECFHMQV , XTR_DH
2015-11-05 06:59:46 +00:00
< dt > Algebraic Structures < dd >
Integer , PolynomialMod2 , PolynomialOver , RingOfPolynomialsOver ,
2015-11-23 00:17:15 +00:00
ModularArithmetic , MontgomeryRepresentation , GFP2_ONB , GF2NP , GF256 , GF2_32 , EC2N , ECP
2015-11-05 06:59:46 +00:00
< dt > Secret Sharing and Information Dispersal < dd >
SecretSharing , SecretRecovery , InformationDispersal , InformationRecovery
< dt > Compression < dd >
Deflator , Inflator , Gzip , Gunzip , ZlibCompressor , ZlibDecompressor
< dt > Input Source Classes < dd >
StringSource , ArraySource , FileSource , SocketSource , WindowsPipeSource , RandomNumberSource
< dt > Output Sink Classes < dd >
2015-11-23 00:17:15 +00:00
StringSinkTemplate , StringSink , ArraySink , FileSink , SocketSink , WindowsPipeSink , RandomNumberSink
2015-11-05 06:59:46 +00:00
< dt > Filter Wrappers < dd >
2017-04-17 06:39:22 +00:00
StreamTransformationFilter , AuthenticatedEncryptionFilter , AuthenticatedDecryptionFilter , HashFilter ,
HashVerificationFilter , SignerFilter , SignatureVerificationFilter
2015-11-05 06:59:46 +00:00
< dt > Binary to Text Encoders and Decoders < dd >
2017-04-17 06:39:22 +00:00
HexEncoder , HexDecoder , Base64Encoder , Base64Decoder , Base64URLEncoder , Base64URLDecoder , Base32Encoder ,
Base32Decoder
2015-11-05 06:59:46 +00:00
< dt > Wrappers for OS features < dd >
Timer , Socket , WindowsHandle , ThreadLocalStorage , ThreadUserTimer
2015-11-23 00:17:15 +00:00
< dt > FIPS 140 validated cryptography < dd >
2015-11-05 06:59:46 +00:00
fips140 . h
< / dl >
In the DLL version of Crypto + + , only the following implementation class are available .
< dl >
< dt > Block Ciphers < dd >
2015-11-23 00:17:15 +00:00
AES , \ ref DES_EDE2 " 2-key Triple-DES " , \ ref DES_EDE3 " 3-key Triple-DES " , SKIPJACK
2015-11-05 06:59:46 +00:00
< dt > Cipher Modes ( replace template parameter BC with one of the block ciphers above ) < dd >
2017-04-17 06:39:22 +00:00
\ ref ECB_Mode " ECB_Mode<BC> " , \ ref CTR_Mode " CTR_Mode<BC> " , \ ref CBC_Mode " CBC_Mode<BC> " ,
\ ref CFB_FIPS_Mode " CFB_FIPS_Mode<BC> " , \ ref OFB_Mode " OFB_Mode<BC> " , \ ref GCM " GCM<AES> "
2015-11-05 06:59:46 +00:00
< dt > Hash Functions < dd >
SHA1 , SHA224 , SHA256 , SHA384 , SHA512
< dt > Public Key Signature Schemes ( replace template parameter H with one of the hash functions above ) < dd >
2017-04-17 06:39:22 +00:00
RSASS \ < PKCS1v15 , H \ > , RSASS \ < PSS , H \ > , RSASS_ISO \ < H \ > , RWSS \ < P1363_EMSA2 , H \ > , DSA , ECDSA \ < ECP , H \ > ,
ECDSA \ < EC2N , H \ >
2015-11-05 06:59:46 +00:00
< dt > Message Authentication Codes ( replace template parameter H with one of the hash functions above ) < dd >
HMAC \ < H \ > , CBC_MAC \ < DES_EDE2 \ > , CBC_MAC \ < DES_EDE3 \ > , GCM \ < AES \ >
< dt > Random Number Generators < dd >
DefaultAutoSeededRNG ( AutoSeededX917RNG \ < AES \ > )
< dt > Key Agreement < dd >
DH , DH2
< dt > Public Key Cryptosystems < dd >
RSAES \ < OAEP \ < SHA1 \ > \ >
< / dl >
< p > This reference manual is a work in progress . Some classes are lack detailed descriptions .
< p > Click < a href = " CryptoPPRef.zip " > here < / a > to download a zip archive containing this manual .
< p > Thanks to Ryan Phillips for providing the Doxygen configuration file
and getting us started on the manual .
*/
# ifndef CRYPTOPP_CRYPTLIB_H
# define CRYPTOPP_CRYPTLIB_H
# include "config.h"
# include "stdcpp.h"
2016-09-16 15:27:15 +00:00
# include "trap.h"
2015-11-05 06:59:46 +00:00
# if CRYPTOPP_MSC_VERSION
# pragma warning(push)
2017-06-02 09:06:56 +00:00
# pragma warning(disable: 4127 4189 4702)
2015-11-05 06:59:46 +00:00
# endif
NAMESPACE_BEGIN ( CryptoPP )
// forward declarations
class Integer ;
class RandomNumberGenerator ;
class BufferedTransformation ;
//! \brief Specifies a direction for a cipher to operate
2016-01-15 13:54:19 +00:00
//! \sa BlockTransformation::IsForwardTransformation(), BlockTransformation::IsPermutation(), BlockTransformation::GetCipherDirection()
2016-01-15 00:08:56 +00:00
enum CipherDir {
//! \brief the cipher is performing encryption
ENCRYPTION ,
//! \brief the cipher is performing decryption
DECRYPTION } ;
2015-11-05 06:59:46 +00:00
//! \brief Represents infinite time
const unsigned long INFINITE_TIME = ULONG_MAX ;
// VC60 workaround: using enums as template parameters causes problems
2016-12-03 10:05:56 +00:00
//! \brief Converts an enumeration to a type suitable for use as a template parameter
2015-11-05 06:59:46 +00:00
template < typename ENUM_TYPE , int VALUE >
struct EnumToType
{
static ENUM_TYPE ToEnum ( ) { return ( ENUM_TYPE ) VALUE ; }
} ;
//! \brief Provides the byte ordering
2016-01-15 13:54:19 +00:00
//! \details Big-endian and little-endian modes are supported. Bi-endian and PDP-endian modes
//! are not supported.
2016-01-15 00:08:56 +00:00
enum ByteOrder {
//! \brief byte order is little-endian
LITTLE_ENDIAN_ORDER = 0 ,
//! \brief byte order is big-endian
BIG_ENDIAN_ORDER = 1 } ;
2015-12-14 20:50:56 +00:00
//! \brief Provides a constant for LittleEndian
2015-11-05 06:59:46 +00:00
typedef EnumToType < ByteOrder , LITTLE_ENDIAN_ORDER > LittleEndian ;
2015-12-14 20:50:56 +00:00
//! \brief Provides a constant for BigEndian
2015-11-05 06:59:46 +00:00
typedef EnumToType < ByteOrder , BIG_ENDIAN_ORDER > BigEndian ;
//! \class Exception
2015-12-16 08:22:22 +00:00
//! \brief Base class for all exceptions thrown by the library
//! \details All library exceptions directly or indirectly inherit from the Exception class.
//! The Exception class itself inherits from std::exception. The library does not use
//! std::runtime_error derived classes.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL Exception : public std : : exception
{
public :
2015-12-16 08:22:22 +00:00
//! \enum ErrorType
//! \brief Error types or categories
2015-11-05 06:59:46 +00:00
enum ErrorType {
//! \brief A method was called which was not implemented
NOT_IMPLEMENTED ,
//! \brief An invalid argument was detected
INVALID_ARGUMENT ,
2015-11-18 20:32:28 +00:00
//! \brief BufferedTransformation received a Flush(true) signal but can't flush buffers
2015-11-05 06:59:46 +00:00
CANNOT_FLUSH ,
//! \brief Data integerity check, such as CRC or MAC, failed
DATA_INTEGRITY_CHECK_FAILED ,
//! \brief Input data was received that did not conform to expected format
INVALID_DATA_FORMAT ,
//! \brief Error reading from input device or writing to output device
IO_ERROR ,
2015-12-16 08:22:22 +00:00
//! \brief Some other error occurred not belonging to other categories
2015-11-05 06:59:46 +00:00
OTHER_ERROR
} ;
2016-12-03 05:32:07 +00:00
virtual ~ Exception ( ) throw ( ) { }
2017-03-17 22:31:40 +00:00
//! \brief Construct a new Exception
2015-11-05 06:59:46 +00:00
explicit Exception ( ErrorType errorType , const std : : string & s ) : m_errorType ( errorType ) , m_what ( s ) { }
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Retrieves a C-string describing the exception
const char * what ( ) const throw ( ) { return ( m_what . c_str ( ) ) ; }
2016-04-25 02:20:25 +00:00
//! \brief Retrieves a string describing the exception
2015-11-05 06:59:46 +00:00
const std : : string & GetWhat ( ) const { return m_what ; }
2016-04-25 02:20:25 +00:00
//! \brief Sets the error string for the exception
2015-11-05 06:59:46 +00:00
void SetWhat ( const std : : string & s ) { m_what = s ; }
//! \brief Retrieves the error type for the exception
ErrorType GetErrorType ( ) const { return m_errorType ; }
//! \brief Sets the error type for the exceptions
void SetErrorType ( ErrorType errorType ) { m_errorType = errorType ; }
private :
ErrorType m_errorType ;
std : : string m_what ;
} ;
//! \brief An invalid argument was detected
class CRYPTOPP_DLL InvalidArgument : public Exception
{
public :
explicit InvalidArgument ( const std : : string & s ) : Exception ( INVALID_ARGUMENT , s ) { }
} ;
//! \brief Input data was received that did not conform to expected format
class CRYPTOPP_DLL InvalidDataFormat : public Exception
{
public :
explicit InvalidDataFormat ( const std : : string & s ) : Exception ( INVALID_DATA_FORMAT , s ) { }
} ;
//! \brief A decryption filter encountered invalid ciphertext
class CRYPTOPP_DLL InvalidCiphertext : public InvalidDataFormat
{
public :
explicit InvalidCiphertext ( const std : : string & s ) : InvalidDataFormat ( s ) { }
} ;
//! \brief A method was called which was not implemented
class CRYPTOPP_DLL NotImplemented : public Exception
{
public :
explicit NotImplemented ( const std : : string & s ) : Exception ( NOT_IMPLEMENTED , s ) { }
} ;
//! \brief Flush(true) was called but it can't completely flush its buffers
class CRYPTOPP_DLL CannotFlush : public Exception
{
public :
explicit CannotFlush ( const std : : string & s ) : Exception ( CANNOT_FLUSH , s ) { }
} ;
//! \brief The operating system reported an error
class CRYPTOPP_DLL OS_Error : public Exception
{
public :
2016-12-03 05:32:07 +00:00
virtual ~ OS_Error ( ) throw ( ) { }
2015-11-05 06:59:46 +00:00
OS_Error ( ErrorType errorType , const std : : string & s , const std : : string & operation , int errorCode )
: Exception ( errorType , s ) , m_operation ( operation ) , m_errorCode ( errorCode ) { }
//! \brief Retrieve the operating system API that reported the error
const std : : string & GetOperation ( ) const { return m_operation ; }
//! \brief Retrieve the error code returned by the operating system
int GetErrorCode ( ) const { return m_errorCode ; }
protected :
std : : string m_operation ;
int m_errorCode ;
} ;
//! \class DecodingResult
//! \brief Returns a decoding results
struct CRYPTOPP_DLL DecodingResult
{
2015-11-18 20:32:28 +00:00
//! \brief Constructs a DecodingResult
2017-03-17 22:31:40 +00:00
//! \details isValidCoding is initialized to false and messageLength is initialized to 0.
2015-11-05 06:59:46 +00:00
explicit DecodingResult ( ) : isValidCoding ( false ) , messageLength ( 0 ) { }
2015-11-18 20:32:28 +00:00
//! \brief Constructs a DecodingResult
//! \param len the message length
2017-03-17 22:31:40 +00:00
//! \details isValidCoding is initialized to true.
2015-11-05 06:59:46 +00:00
explicit DecodingResult ( size_t len ) : isValidCoding ( true ) , messageLength ( len ) { }
2015-11-18 20:32:28 +00:00
//! \brief Compare two DecodingResult
//! \param rhs the other DecodingResult
2016-01-15 13:54:19 +00:00
//! \return true if both isValidCoding and messageLength are equal, false otherwise
2015-11-05 06:59:46 +00:00
bool operator = = ( const DecodingResult & rhs ) const { return isValidCoding = = rhs . isValidCoding & & messageLength = = rhs . messageLength ; }
2015-11-18 20:32:28 +00:00
//! \brief Compare two DecodingResult
//! \param rhs the other DecodingResult
2016-01-15 13:54:19 +00:00
//! \return true if either isValidCoding or messageLength is \a not equal, false otherwise
2015-11-18 20:32:28 +00:00
//! \details Returns <tt>!operator==(rhs)</tt>.
2015-11-05 06:59:46 +00:00
bool operator ! = ( const DecodingResult & rhs ) const { return ! operator = = ( rhs ) ; }
2015-11-23 00:17:15 +00:00
//! \brief Flag to indicate the decoding is valid
2015-11-05 06:59:46 +00:00
bool isValidCoding ;
2015-11-23 00:17:15 +00:00
//! \brief Recovered message length if isValidCoding is true, undefined otherwise
2015-11-05 06:59:46 +00:00
size_t messageLength ;
} ;
//! \class NameValuePairs
//! \brief Interface for retrieving values given their names
//! \details This class is used to safely pass a variable number of arbitrarily typed arguments to functions
//! and to read values from keys and crypto parameters.
//! \details To obtain an object that implements NameValuePairs for the purpose of parameter
//! passing, use the MakeParameters() function.
2016-08-28 03:52:43 +00:00
//! \details To get a value from NameValuePairs, you need to know the name and the type of the value.
2015-11-18 20:32:28 +00:00
//! Call GetValueNames() on a NameValuePairs object to obtain a list of value names that it supports.
2015-11-05 06:59:46 +00:00
//! then look at the Name namespace documentation to see what the type of each value is, or
//! alternatively, call GetIntValue() with the value name, and if the type is not int, a
2015-11-18 20:32:28 +00:00
//! ValueTypeMismatch exception will be thrown and you can get the actual type from the exception object.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_NO_VTABLE NameValuePairs
{
public :
virtual ~ NameValuePairs ( ) { }
//! \class ValueTypeMismatch
//! \brief Thrown when an unexpected type is encountered
//! \details Exception thrown when trying to retrieve a value using a different type than expected
class CRYPTOPP_DLL ValueTypeMismatch : public InvalidArgument
{
public :
//! \brief Construct a ValueTypeMismatch
//! \param name the name of the value
//! \param stored the \a actual type of the value stored
//! \param retrieving the \a presumed type of the value retrieved
ValueTypeMismatch ( const std : : string & name , const std : : type_info & stored , const std : : type_info & retrieving )
: InvalidArgument ( " NameValuePairs: type mismatch for ' " + name + " ', stored ' " + stored . name ( ) + " ', trying to retrieve ' " + retrieving . name ( ) + " ' " )
, m_stored ( stored ) , m_retrieving ( retrieving ) { }
//! \brief Provides the stored type
2016-01-15 13:54:19 +00:00
//! \return the C++ mangled name of the type
2015-11-05 06:59:46 +00:00
const std : : type_info & GetStoredTypeInfo ( ) const { return m_stored ; }
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Provides the retrieveing type
2016-01-15 13:54:19 +00:00
//! \return the C++ mangled name of the type
2015-11-05 06:59:46 +00:00
const std : : type_info & GetRetrievingTypeInfo ( ) const { return m_retrieving ; }
private :
const std : : type_info & m_stored ;
const std : : type_info & m_retrieving ;
} ;
//! \brief Get a copy of this object or subobject
//! \tparam T class or type
//! \param object reference to a variable that receives the value
template < class T >
bool GetThisObject ( T & object ) const
{
return GetValue ( ( std : : string ( " ThisObject: " ) + typeid ( T ) . name ( ) ) . c_str ( ) , object ) ;
}
//! \brief Get a pointer to this object
//! \tparam T class or type
//! \param ptr reference to a pointer to a variable that receives the value
template < class T >
bool GetThisPointer ( T * & ptr ) const
{
return GetValue ( ( std : : string ( " ThisPointer: " ) + typeid ( T ) . name ( ) ) . c_str ( ) , ptr ) ;
}
2015-11-18 20:32:28 +00:00
//! \brief Get a named value
2015-11-05 06:59:46 +00:00
//! \tparam T class or type
//! \param name the name of the object or value to retrieve
//! \param value reference to a variable that receives the value
2016-04-26 21:11:50 +00:00
//! \returns true if the value was retrieved, false otherwise
2015-11-18 20:32:28 +00:00
//! \sa GetValue(), GetValueWithDefault(), GetIntValue(), GetIntValueWithDefault(),
//! GetRequiredParameter() and GetRequiredIntParameter()
2015-11-05 06:59:46 +00:00
template < class T >
bool GetValue ( const char * name , T & value ) const
{
return GetVoidValue ( name , typeid ( T ) , & value ) ;
}
//! \brief Get a named value
//! \tparam T class or type
//! \param name the name of the object or value to retrieve
//! \param defaultValue the default value of the class or type if it does not exist
2016-01-15 13:54:19 +00:00
//! \return the object or value
2015-11-18 20:32:28 +00:00
//! \sa GetValue(), GetValueWithDefault(), GetIntValue(), GetIntValueWithDefault(),
//! GetRequiredParameter() and GetRequiredIntParameter()
2015-11-05 06:59:46 +00:00
template < class T >
T GetValueWithDefault ( const char * name , T defaultValue ) const
{
2015-11-18 20:32:28 +00:00
T value ;
bool result = GetValue ( name , value ) ;
// No assert... this recovers from failure
if ( result ) { return value ; }
2015-11-05 06:59:46 +00:00
return defaultValue ;
}
//! \brief Get a list of value names that can be retrieved
2016-01-15 13:54:19 +00:00
//! \return a list of names available to retrieve
2015-11-05 06:59:46 +00:00
//! \details the items in the list are delimited with a colon.
CRYPTOPP_DLL std : : string GetValueNames ( ) const
{ std : : string result ; GetValue ( " ValueNames " , result ) ; return result ; }
//! \brief Get a named value with type int
//! \param name the name of the value to retrieve
//! \param value the value retrieved upon success
2016-01-15 13:54:19 +00:00
//! \return true if an int value was retrieved, false otherwise
2015-11-18 20:32:28 +00:00
//! \details GetIntValue() is used to ensure we don't accidentally try to get an
//! unsigned int or some other type when we mean int (which is the most common case)
//! \sa GetValue(), GetValueWithDefault(), GetIntValue(), GetIntValueWithDefault(),
//! GetRequiredParameter() and GetRequiredIntParameter()
2015-11-05 06:59:46 +00:00
CRYPTOPP_DLL bool GetIntValue ( const char * name , int & value ) const
{ return GetValue ( name , value ) ; }
//! \brief Get a named value with type int, with default
//! \param name the name of the value to retrieve
//! \param defaultValue the default value if the name does not exist
2016-01-15 13:54:19 +00:00
//! \return the value retrieved on success or the default value
2015-11-18 20:32:28 +00:00
//! \sa GetValue(), GetValueWithDefault(), GetIntValue(), GetIntValueWithDefault(),
//! GetRequiredParameter() and GetRequiredIntParameter()
2015-11-05 06:59:46 +00:00
CRYPTOPP_DLL int GetIntValueWithDefault ( const char * name , int defaultValue ) const
{ return GetValueWithDefault ( name , defaultValue ) ; }
//! \brief Ensures an expected name and type is present
//! \param name the name of the value
//! \param stored the type that was stored for the name
//! \param retrieving the type that is being retrieved for the name
//! \throws ValueTypeMismatch
2015-11-18 20:32:28 +00:00
//! \details ThrowIfTypeMismatch() effectively performs a type safety check.
2017-03-17 22:31:40 +00:00
//! stored and retrieving are C++ mangled names for the type.
2015-11-18 20:32:28 +00:00
//! \sa GetValue(), GetValueWithDefault(), GetIntValue(), GetIntValueWithDefault(),
//! GetRequiredParameter() and GetRequiredIntParameter()
2015-11-05 06:59:46 +00:00
CRYPTOPP_DLL static void CRYPTOPP_API ThrowIfTypeMismatch ( const char * name , const std : : type_info & stored , const std : : type_info & retrieving )
{ if ( stored ! = retrieving ) throw ValueTypeMismatch ( name , stored , retrieving ) ; }
//! \brief Retrieves a required name/value pair
//! \tparam T class or type
//! \param className the name of the class
//! \param name the name of the value
//! \param value reference to a variable to receive the value
//! \throws InvalidArgument
2016-04-25 02:20:25 +00:00
//! \details GetRequiredParameter() throws InvalidArgument if the name
//! is not present or not of the expected type T.
2015-11-18 20:32:28 +00:00
//! \sa GetValue(), GetValueWithDefault(), GetIntValue(), GetIntValueWithDefault(),
//! GetRequiredParameter() and GetRequiredIntParameter()
2015-11-05 06:59:46 +00:00
template < class T >
void GetRequiredParameter ( const char * className , const char * name , T & value ) const
{
if ( ! GetValue ( name , value ) )
throw InvalidArgument ( std : : string ( className ) + " : missing required parameter ' " + name + " ' " ) ;
}
//! \brief Retrieves a required name/value pair
//! \param className the name of the class
//! \param name the name of the value
//! \param value reference to a variable to receive the value
//! \throws InvalidArgument
2016-04-25 02:20:25 +00:00
//! \details GetRequiredParameter() throws InvalidArgument if the name
//! is not present or not of the expected type T.
2015-11-18 20:32:28 +00:00
//! \sa GetValue(), GetValueWithDefault(), GetIntValue(), GetIntValueWithDefault(),
//! GetRequiredParameter() and GetRequiredIntParameter()
2015-11-05 06:59:46 +00:00
CRYPTOPP_DLL void GetRequiredIntParameter ( const char * className , const char * name , int & value ) const
{
if ( ! GetIntValue ( name , value ) )
throw InvalidArgument ( std : : string ( className ) + " : missing required parameter ' " + name + " ' " ) ;
}
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Get a named value
//! \param name the name of the object or value to retrieve
//! \param valueType reference to a variable that receives the value
//! \param pValue void pointer to a variable that receives the value
2016-04-26 21:11:50 +00:00
//! \returns true if the value was retrieved, false otherwise
2017-03-17 22:31:40 +00:00
//! \details GetVoidValue() retrieves the value of name if it exists.
//! \note GetVoidValue() is an internal function and should be implemented
2015-11-18 20:32:28 +00:00
//! by derived classes. Users should use one of the other functions instead.
//! \sa GetValue(), GetValueWithDefault(), GetIntValue(), GetIntValueWithDefault(),
//! GetRequiredParameter() and GetRequiredIntParameter()
2015-11-05 06:59:46 +00:00
CRYPTOPP_DLL virtual bool GetVoidValue ( const char * name , const std : : type_info & valueType , void * pValue ) const = 0 ;
} ;
2015-11-18 20:32:28 +00:00
# if CRYPTOPP_DOXYGEN_PROCESSING
//! \brief Namespace containing value name definitions.
//! \details Name is part of the CryptoPP namespace.
//! \details The semantics of value names, types are:
//! <pre>
//! ThisObject:ClassName (ClassName, copy of this object or a subobject)
//! ThisPointer:ClassName (const ClassName *, pointer to this object or a subobject)
//! </pre>
2015-11-05 06:59:46 +00:00
DOCUMENTED_NAMESPACE_BEGIN ( Name )
// more names defined in argnames.h
DOCUMENTED_NAMESPACE_END
2015-11-18 20:32:28 +00:00
//! \brief Namespace containing weak and wounded algorithms.
2016-04-06 01:05:13 +00:00
//! \details Weak is part of the CryptoPP namespace. Schemes and algorithms are moved into Weak
//! when their security level is reduced to an unacceptable level by contemporary standards.
//! \details To use an algorithm in the Weak namespace, you must <tt>\c \#define
//! CRYPTOPP_ENABLE_NAMESPACE_WEAK 1</tt> before including a header for a weak or wounded
//! algorithm. For example:
//! <pre>
//! \c \#define CRYPTOPP_ENABLE_NAMESPACE_WEAK 1
//! \c \#include <md5.h>
//! ...
//! CryptoPP::Weak::MD5 md5;
//! </pre>
2015-11-05 06:59:46 +00:00
DOCUMENTED_NAMESPACE_BEGIN ( Weak )
// weak and wounded algorithms
DOCUMENTED_NAMESPACE_END
2015-11-18 20:32:28 +00:00
# endif
2015-11-05 06:59:46 +00:00
//! \brief An empty set of name-value pairs
extern CRYPTOPP_DLL const NameValuePairs & g_nullNameValuePairs ;
// ********************************************************
//! \class Clonable
//! \brief Interface for cloning objects
//! \note this is \a not implemented by most classes
2015-11-18 20:32:28 +00:00
//! \sa ClonableImpl, NotCopyable
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Clonable
{
public :
virtual ~ Clonable ( ) { }
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Copies this object
2016-01-15 13:54:19 +00:00
//! \return a copy of this object
2015-11-05 06:59:46 +00:00
//! \throws NotImplemented
//! \note this is \a not implemented by most classes
2016-04-25 02:20:25 +00:00
//! \sa NotCopyable
2015-11-05 06:59:46 +00:00
virtual Clonable * Clone ( ) const { throw NotImplemented ( " Clone() is not implemented yet. " ) ; } // TODO: make this =0
} ;
//! \class Algorithm
//! \brief Interface for all crypto algorithms
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE Algorithm : public Clonable
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ Algorithm ( ) { }
2015-11-05 06:59:46 +00:00
//! \brief Interface for all crypto algorithms
//! \param checkSelfTestStatus determines whether the object can proceed if the self
//! tests have not been run or failed.
//! \details When FIPS 140-2 compliance is enabled and checkSelfTestStatus == true,
//! this constructor throws SelfTestFailure if the self test hasn't been run or fails.
//! \details FIPS 140-2 compliance is disabled by default. It is only used by certain
//! versions of the library when the library is built as a DLL on Windows. Also see
2015-11-18 20:32:28 +00:00
//! CRYPTOPP_ENABLE_COMPLIANCE_WITH_FIPS_140_2 in config.h.
2015-11-05 06:59:46 +00:00
Algorithm ( bool checkSelfTestStatus = true ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Provides the name of this algorithm
2016-01-15 13:54:19 +00:00
//! \return the standard algorithm name
2015-11-05 06:59:46 +00:00
//! \details The standard algorithm name can be a name like \a AES or \a AES/GCM. Some algorithms
//! do not have standard names yet. For example, there is no standard algorithm name for
2017-03-17 22:31:40 +00:00
//! Shoup's ECIES.
2015-11-18 20:32:28 +00:00
//! \note AlgorithmName is not universally implemented yet
2015-11-05 06:59:46 +00:00
virtual std : : string AlgorithmName ( ) const { return " unknown " ; }
} ;
//! \class SimpleKeyingInterface
2015-12-14 04:53:50 +00:00
//! \brief Interface for algorithms that take byte strings as keys
//! \sa FixedKeyLength(), VariableKeyLength(), SameKeyLengthAs(), SimpleKeyingInterfaceImpl()
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE SimpleKeyingInterface
{
public :
virtual ~ SimpleKeyingInterface ( ) { }
2016-10-11 23:51:15 +00:00
//! \brief Returns smallest valid key length
//! \returns the minimum key length, in bytes
2015-11-05 06:59:46 +00:00
virtual size_t MinKeyLength ( ) const = 0 ;
2016-10-11 23:51:15 +00:00
//! \brief Returns largest valid key length
//! \returns the maximum key length, in bytes
2015-11-05 06:59:46 +00:00
virtual size_t MaxKeyLength ( ) const = 0 ;
2016-10-11 23:51:15 +00:00
//! \brief Returns default key length
//! \returns the default (recommended) key length, in bytes
2015-11-05 06:59:46 +00:00
virtual size_t DefaultKeyLength ( ) const = 0 ;
2016-10-11 23:51:15 +00:00
//! \brief Returns a valid key length for the algorithm
//! \param keylength the size of the key, in bytes
//! \returns the valid key length, in bytes
//! \details keylength is provided in bytes, not bits. If keylength is less than MIN_KEYLENGTH,
//! then the function returns MIN_KEYLENGTH. If keylength is greater than MAX_KEYLENGTH,
//! then the function returns MAX_KEYLENGTH. if If keylength is a multiple of KEYLENGTH_MULTIPLE,
//! then keylength is returned. Otherwise, the function returns a \a lower multiple of
//! KEYLENGTH_MULTIPLE.
2016-10-12 06:57:28 +00:00
virtual size_t GetValidKeyLength ( size_t keylength ) const = 0 ;
2015-11-05 06:59:46 +00:00
2016-10-11 23:51:15 +00:00
//! \brief Returns whether keylength is a valid key length
2015-12-14 04:53:50 +00:00
//! \param keylength the requested keylength
2016-01-15 13:54:19 +00:00
//! \return true if keylength is valid, false otherwise
2015-12-14 04:53:50 +00:00
//! \details Internally the function calls GetValidKeyLength()
2015-11-05 06:59:46 +00:00
virtual bool IsValidKeyLength ( size_t keylength ) const
{ return keylength = = GetValidKeyLength ( keylength ) ; }
//! \brief Sets or reset the key of this object
//! \param key the key to use when keying the object
//! \param length the size of the key, in bytes
//! \param params additional initialization parameters that cannot be passed
//! directly through the constructor
virtual void SetKey ( const byte * key , size_t length , const NameValuePairs & params = g_nullNameValuePairs ) ;
//! \brief Sets or reset the key of this object
//! \param key the key to use when keying the object
//! \param length the size of the key, in bytes
//! \param rounds the number of rounds to apply the transformation function,
2017-03-17 22:31:40 +00:00
//! if applicable
2015-12-14 04:53:50 +00:00
//! \details SetKeyWithRounds() calls SetKey() with a NameValuePairs
//! object that only specifies rounds. rounds is an integer parameter,
2015-11-05 06:59:46 +00:00
//! and <tt>-1</tt> means use the default number of rounds.
void SetKeyWithRounds ( const byte * key , size_t length , int rounds ) ;
//! \brief Sets or reset the key of this object
//! \param key the key to use when keying the object
//! \param length the size of the key, in bytes
//! \param iv the intiialization vector to use when keying the object
//! \param ivLength the size of the iv, in bytes
2015-12-14 04:53:50 +00:00
//! \details SetKeyWithIV() calls SetKey() with a NameValuePairs
//! that only specifies IV. The IV is a byte buffer with size ivLength.
//! ivLength is an integer parameter, and <tt>-1</tt> means use IVSize().
2015-11-05 06:59:46 +00:00
void SetKeyWithIV ( const byte * key , size_t length , const byte * iv , size_t ivLength ) ;
//! \brief Sets or reset the key of this object
//! \param key the key to use when keying the object
//! \param length the size of the key, in bytes
//! \param iv the intiialization vector to use when keying the object
2015-12-14 04:53:50 +00:00
//! \details SetKeyWithIV() calls SetKey() with a NameValuePairs() object
//! that only specifies iv. iv is a byte buffer, and it must have
//! a size IVSize().
2015-11-05 06:59:46 +00:00
void SetKeyWithIV ( const byte * key , size_t length , const byte * iv )
{ SetKeyWithIV ( key , length , iv , IVSize ( ) ) ; }
2015-12-14 04:53:50 +00:00
//! \brief Secure IVs requirements as enumerated values.
2016-11-24 02:55:30 +00:00
//! \details Provides secure IV requirements as a monotonically increasing enumerated values. Requirements can be
2017-03-17 22:31:40 +00:00
//! compared using less than (<) and greater than (>). For example, <tt>UNIQUE_IV < RANDOM_IV</tt>
//! and <tt>UNPREDICTABLE_RANDOM_IV > RANDOM_IV</tt>.
2015-12-14 04:53:50 +00:00
//! \sa IsResynchronizable(), CanUseRandomIVs(), CanUsePredictableIVs(), CanUseStructuredIVs()
2015-11-05 06:59:46 +00:00
enum IV_Requirement {
//! \brief The IV must be unique
UNIQUE_IV = 0 ,
2015-12-14 04:53:50 +00:00
//! \brief The IV must be random and possibly predictable
2015-11-05 06:59:46 +00:00
RANDOM_IV ,
2015-12-14 04:53:50 +00:00
//! \brief The IV must be random and unpredictable
2015-11-05 06:59:46 +00:00
UNPREDICTABLE_RANDOM_IV ,
//! \brief The IV is set by the object
INTERNALLY_GENERATED_IV ,
//! \brief The object does not use an IV
NOT_RESYNCHRONIZABLE
} ;
2015-12-14 04:53:50 +00:00
//! \brief Minimal requirement for secure IVs
2016-01-15 13:54:19 +00:00
//! \return the secure IV requirement of the algorithm
2015-11-05 06:59:46 +00:00
virtual IV_Requirement IVRequirement ( ) const = 0 ;
2015-12-14 04:53:50 +00:00
//! \brief Determines if the object can be resynchronized
2016-01-15 13:54:19 +00:00
//! \return true if the object can be resynchronized (i.e. supports initialization vectors), false otherwise
2015-12-14 04:53:50 +00:00
//! \note If this function returns true, and no IV is passed to SetKey() and <tt>CanUseStructuredIVs()==true</tt>,
//! an IV of all 0's will be assumed.
2015-11-05 06:59:46 +00:00
bool IsResynchronizable ( ) const { return IVRequirement ( ) < NOT_RESYNCHRONIZABLE ; }
2016-08-28 03:52:43 +00:00
2015-12-14 04:53:50 +00:00
//! \brief Determines if the object can use random IVs
2016-01-15 13:54:19 +00:00
//! \return true if the object can use random IVs (in addition to ones returned by GetNextIV), false otherwise
2015-11-05 06:59:46 +00:00
bool CanUseRandomIVs ( ) const { return IVRequirement ( ) < = UNPREDICTABLE_RANDOM_IV ; }
2016-08-28 03:52:43 +00:00
2015-12-14 04:53:50 +00:00
//! \brief Determines if the object can use random but possibly predictable IVs
2016-01-15 13:54:19 +00:00
//! \return true if the object can use random but possibly predictable IVs (in addition to ones returned by
2015-12-14 04:53:50 +00:00
//! GetNextIV), false otherwise
2015-11-05 06:59:46 +00:00
bool CanUsePredictableIVs ( ) const { return IVRequirement ( ) < = RANDOM_IV ; }
2016-08-28 03:52:43 +00:00
2015-12-14 04:53:50 +00:00
//! \brief Determines if the object can use structured IVs
2016-09-13 20:43:12 +00:00
//! \returns true if the object can use structured IVs, false otherwise
//! \details CanUseStructuredIVs() indicates whether the object can use structured IVs; for example a counter
//! (in addition to ones returned by GetNextIV).
2015-11-05 06:59:46 +00:00
bool CanUseStructuredIVs ( ) const { return IVRequirement ( ) < = UNIQUE_IV ; }
//! \brief Returns length of the IV accepted by this object
2016-01-15 13:54:19 +00:00
//! \return the size of an IV, in bytes
2015-12-14 04:53:50 +00:00
//! \throws NotImplemented() if the object does not support resynchronization
2015-11-18 20:32:28 +00:00
//! \details The default implementation throws NotImplemented
2015-11-05 06:59:46 +00:00
virtual unsigned int IVSize ( ) const
{ throw NotImplemented ( GetAlgorithm ( ) . AlgorithmName ( ) + " : this object doesn't support resynchronization " ) ; }
2015-12-14 04:53:50 +00:00
//! \brief Provides the default size of an IV
2016-01-15 13:54:19 +00:00
//! \return default length of IVs accepted by this object, in bytes
2015-11-05 06:59:46 +00:00
unsigned int DefaultIVLength ( ) const { return IVSize ( ) ; }
2016-08-28 03:52:43 +00:00
2015-12-14 04:53:50 +00:00
//! \brief Provides the minimum size of an IV
2016-01-15 13:54:19 +00:00
//! \return minimal length of IVs accepted by this object, in bytes
2015-12-14 04:53:50 +00:00
//! \throws NotImplemented() if the object does not support resynchronization
2015-11-05 06:59:46 +00:00
virtual unsigned int MinIVLength ( ) const { return IVSize ( ) ; }
2016-08-28 03:52:43 +00:00
2015-12-14 04:53:50 +00:00
//! \brief Provides the maximum size of an IV
2016-01-15 13:54:19 +00:00
//! \return maximal length of IVs accepted by this object, in bytes
2015-12-14 04:53:50 +00:00
//! \throws NotImplemented() if the object does not support resynchronization
2015-11-05 06:59:46 +00:00
virtual unsigned int MaxIVLength ( ) const { return IVSize ( ) ; }
2015-12-14 04:53:50 +00:00
//! \brief Resynchronize with an IV
//! \param iv the initialization vector
//! \param ivLength the size of the initialization vector, in bytes
//! \details Resynchronize() resynchronizes with an IV provided by the caller. <tt>ivLength=-1</tt> means use IVSize().
//! \throws NotImplemented() if the object does not support resynchronization
2015-11-05 06:59:46 +00:00
virtual void Resynchronize ( const byte * iv , int ivLength = - 1 ) {
CRYPTOPP_UNUSED ( iv ) ; CRYPTOPP_UNUSED ( ivLength ) ;
throw NotImplemented ( GetAlgorithm ( ) . AlgorithmName ( ) + " : this object doesn't support resynchronization " ) ;
}
2015-12-14 04:53:50 +00:00
//! \brief Retrieves a secure IV for the next message
2015-11-23 00:17:15 +00:00
//! \param rng a RandomNumberGenerator to produce keying material
2015-11-05 06:59:46 +00:00
//! \param iv a block of bytes to receive the IV
2015-12-14 04:53:50 +00:00
//! \details The IV must be at least IVSize() in length.
2015-11-05 06:59:46 +00:00
//! \details This method should be called after you finish encrypting one message and are ready
2015-12-14 04:53:50 +00:00
//! to start the next one. After calling it, you must call SetKey() or Resynchronize().
//! before using this object again.
//! \details Internally, the base class implementation calls RandomNumberGenerator's GenerateBlock()
2015-11-05 06:59:46 +00:00
//! \note This method is not implemented on decryption objects.
virtual void GetNextIV ( RandomNumberGenerator & rng , byte * iv ) ;
protected :
2017-03-17 22:31:40 +00:00
//! \brief Returns the base class Algorithm
//! \return the base class Algorithm
2015-11-05 06:59:46 +00:00
virtual const Algorithm & GetAlgorithm ( ) const = 0 ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Sets the key for this object without performing parameter validation
2015-11-18 20:32:28 +00:00
//! \param key a byte buffer used to key the cipher
//! \param length the length of the byte buffer
2017-03-17 22:31:40 +00:00
//! \param params additional parameters passed as NameValuePairs
2016-04-25 02:20:25 +00:00
//! \details key must be at least DEFAULT_KEYLENGTH in length.
2015-11-05 06:59:46 +00:00
virtual void UncheckedSetKey ( const byte * key , unsigned int length , const NameValuePairs & params ) = 0 ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Validates the key length
//! \param length the size of the keying material, in bytes
//! \throws InvalidKeyLength if the key length is invalid
void ThrowIfInvalidKeyLength ( size_t length ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Validates the object
//! \throws InvalidArgument if the IV is present
2017-03-17 22:31:40 +00:00
//! \details Internally, the default implementation calls IsResynchronizable() and throws
2015-11-18 20:32:28 +00:00
//! InvalidArgument if the function returns true.
2015-11-05 06:59:46 +00:00
//! \note called when no IV is passed
void ThrowIfResynchronizable ( ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Validates the IV
2017-03-17 22:31:40 +00:00
//! \param iv the IV with a length of IVSize, in bytes
2015-11-05 06:59:46 +00:00
//! \throws InvalidArgument on failure
2017-03-17 22:31:40 +00:00
//! \details Internally, the default implementation checks the iv. If iv is not NULL or nullptr,
//! then the function succeeds. If iv is NULL, then IVRequirement is checked against
//! UNPREDICTABLE_RANDOM_IV. If IVRequirement is UNPREDICTABLE_RANDOM_IV, then
2015-11-05 06:59:46 +00:00
//! then the function succeeds. Otherwise, an exception is thrown.
void ThrowIfInvalidIV ( const byte * iv ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Validates the IV length
2015-12-14 04:53:50 +00:00
//! \param length the size of an IV, in bytes
2017-05-09 03:25:39 +00:00
//! \throws InvalidArgument if the IV length is invalid
2015-11-05 06:59:46 +00:00
size_t ThrowIfInvalidIVLength ( int length ) ;
2016-08-28 03:52:43 +00:00
2016-01-17 05:18:26 +00:00
//! \brief Retrieves and validates the IV
2017-03-17 22:31:40 +00:00
//! \param params NameValuePairs with the IV supplied as a ConstByteArrayParameter
2015-11-05 06:59:46 +00:00
//! \param size the length of the IV, in bytes
2017-03-17 22:31:40 +00:00
//! \return a pointer to the first byte of the IV
//! \throws InvalidArgument if the number of rounds are invalid
2015-11-05 06:59:46 +00:00
const byte * GetIVAndThrowIfInvalid ( const NameValuePairs & params , size_t & size ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Validates the key length
//! \param length the size of the keying material, in bytes
inline void AssertValidKeyLength ( size_t length ) const
2016-09-16 15:27:15 +00:00
{ CRYPTOPP_UNUSED ( length ) ; CRYPTOPP_ASSERT ( IsValidKeyLength ( length ) ) ; }
2015-11-05 06:59:46 +00:00
} ;
//! \brief Interface for the data processing part of block ciphers
2015-11-18 20:32:28 +00:00
//! \details Classes derived from BlockTransformation are block ciphers
//! in ECB mode (for example the DES::Encryption class), which are stateless.
//! These classes should not be used directly, but only in combination with
//! a mode class (see CipherModeDocumentation in modes.h).
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE BlockTransformation : public Algorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ BlockTransformation ( ) { }
2015-11-18 20:32:28 +00:00
//! \brief Encrypt or decrypt a block
//! \param inBlock the input message before processing
//! \param outBlock the output message after processing
//! \param xorBlock an optional XOR mask
//! \details ProcessAndXorBlock encrypts or decrypts inBlock, xor with xorBlock, and write to outBlock.
//! \details The size of the block is determined by the block cipher and its documentation. Use
//! BLOCKSIZE at compile time, or BlockSize() at runtime.
//! \note The message can be transformed in-place, or the buffers must \a not overlap
//! \sa FixedBlockSize, BlockCipherFinal from seckey.h and BlockSize()
2015-11-05 06:59:46 +00:00
virtual void ProcessAndXorBlock ( const byte * inBlock , const byte * xorBlock , byte * outBlock ) const = 0 ;
2015-11-18 20:32:28 +00:00
//! \brief Encrypt or decrypt a block
//! \param inBlock the input message before processing
//! \param outBlock the output message after processing
//! \details ProcessBlock encrypts or decrypts inBlock and write to outBlock.
//! \details The size of the block is determined by the block cipher and its documentation.
2017-03-17 22:31:40 +00:00
//! Use BLOCKSIZE at compile time, or BlockSize() at runtime.
2015-11-18 20:32:28 +00:00
//! \sa FixedBlockSize, BlockCipherFinal from seckey.h and BlockSize()
//! \note The message can be transformed in-place, or the buffers must \a not overlap
2015-11-05 06:59:46 +00:00
void ProcessBlock ( const byte * inBlock , byte * outBlock ) const
2017-03-01 11:10:06 +00:00
{ ProcessAndXorBlock ( inBlock , NULLPTR , outBlock ) ; }
2015-11-05 06:59:46 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Encrypt or decrypt a block in place
//! \param inoutBlock the input message before processing
//! \details ProcessBlock encrypts or decrypts inoutBlock in-place.
//! \details The size of the block is determined by the block cipher and its documentation.
2015-12-14 20:50:56 +00:00
//! Use BLOCKSIZE at compile time, or BlockSize() at runtime.
2015-11-18 20:32:28 +00:00
//! \sa FixedBlockSize, BlockCipherFinal from seckey.h and BlockSize()
2015-11-05 06:59:46 +00:00
void ProcessBlock ( byte * inoutBlock ) const
2017-03-01 11:10:06 +00:00
{ ProcessAndXorBlock ( inoutBlock , NULLPTR , inoutBlock ) ; }
2015-11-05 06:59:46 +00:00
2015-11-18 20:32:28 +00:00
//! Provides the block size of the cipher
2016-01-15 13:54:19 +00:00
//! \return the block size of the cipher, in bytes
2015-11-05 06:59:46 +00:00
virtual unsigned int BlockSize ( ) const = 0 ;
2015-11-18 20:32:28 +00:00
//! \brief Provides input and output data alignment for optimal performance.
2016-01-15 13:54:19 +00:00
//! \return the input data alignment that provides optimal performance
2015-11-05 06:59:46 +00:00
virtual unsigned int OptimalDataAlignment ( ) const ;
//! returns true if this is a permutation (i.e. there is an inverse transformation)
virtual bool IsPermutation ( ) const { return true ; }
2015-11-18 20:32:28 +00:00
//! \brief Determines if the cipher is being operated in its forward direction
2016-04-26 21:11:50 +00:00
//! \returns true if DIR is ENCRYPTION, false otherwise
2015-11-18 20:32:28 +00:00
//! \sa IsForwardTransformation(), IsPermutation(), GetCipherDirection()
2015-11-05 06:59:46 +00:00
virtual bool IsForwardTransformation ( ) const = 0 ;
2015-11-18 20:32:28 +00:00
//! \brief Determines the number of blocks that can be processed in parallel
//! \return the number of blocks that can be processed in parallel, for bit-slicing implementations
//! \details Bit-slicing is often used to improve throughput and minimize timing attacks.
2015-11-05 06:59:46 +00:00
virtual unsigned int OptimalNumberOfParallelBlocks ( ) const { return 1 ; }
2015-11-18 20:32:28 +00:00
//! \brief Bit flags that control AdvancedProcessBlocks() behavior
enum FlagsForAdvancedProcessBlocks {
//! \brief inBlock is a counter
BT_InBlockIsCounter = 1 ,
//! \brief should not modify block pointers
BT_DontIncrementInOutPointers = 2 ,
2016-08-28 03:52:43 +00:00
//! \brief
2015-11-18 20:32:28 +00:00
BT_XorInput = 4 ,
//! \brief perform the transformation in reverse
BT_ReverseDirection = 8 ,
2016-08-28 03:52:43 +00:00
//! \brief
2015-11-18 20:32:28 +00:00
BT_AllowParallel = 16 } ;
//! \brief Encrypt and xor multiple blocks using additional flags
//! \param inBlocks the input message before processing
//! \param xorBlocks an optional XOR mask
//! \param outBlocks the output message after processing
//! \param length the size of the blocks, in bytes
//! \param flags additional flags to control processing
//! \details Encrypt and xor multiple blocks according to FlagsForAdvancedProcessBlocks flags.
//! \note If BT_InBlockIsCounter is set, then the last byte of inBlocks may be modified.
2015-11-05 06:59:46 +00:00
virtual size_t AdvancedProcessBlocks ( const byte * inBlocks , const byte * xorBlocks , byte * outBlocks , size_t length , word32 flags ) const ;
2016-01-15 13:54:19 +00:00
//! \brief Provides the direction of the cipher
//! \return ENCRYPTION if IsForwardTransformation() is true, DECRYPTION otherwise
//! \sa IsForwardTransformation(), IsPermutation()
2015-11-05 06:59:46 +00:00
inline CipherDir GetCipherDirection ( ) const { return IsForwardTransformation ( ) ? ENCRYPTION : DECRYPTION ; }
} ;
2015-11-18 20:32:28 +00:00
//! \class StreamTransformation
2015-11-05 06:59:46 +00:00
//! \brief Interface for the data processing portion of stream ciphers
2015-11-18 20:32:28 +00:00
//! \sa StreamTransformationFilter()
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE StreamTransformation : public Algorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ StreamTransformation ( ) { }
2015-11-18 20:32:28 +00:00
//! \brief Provides a reference to this object
2016-01-15 13:54:19 +00:00
//! \return A reference to this object
2015-11-05 06:59:46 +00:00
//! \details Useful for passing a temporary object to a function that takes a non-const reference
StreamTransformation & Ref ( ) { return * this ; }
2015-11-18 20:32:28 +00:00
//! \brief Provides the mandatory block size of the cipher
2016-01-15 13:54:19 +00:00
//! \return The block size of the cipher if input must be processed in blocks, 1 otherwise
2015-11-05 06:59:46 +00:00
virtual unsigned int MandatoryBlockSize ( ) const { return 1 ; }
2015-11-18 20:32:28 +00:00
//! \brief Provides the input block size most efficient for this cipher.
2016-01-15 13:54:19 +00:00
//! \return The input block size that is most efficient for the cipher
2015-12-17 00:39:29 +00:00
//! \details The base class implementation returns MandatoryBlockSize().
2015-11-18 20:32:28 +00:00
//! \note Optimal input length is
//! <tt>n * OptimalBlockSize() - GetOptimalBlockSizeUsed()</tt> for any <tt>n \> 0</tt>.
2015-11-05 06:59:46 +00:00
virtual unsigned int OptimalBlockSize ( ) const { return MandatoryBlockSize ( ) ; }
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Provides the number of bytes used in the current block when processing at optimal block size.
2016-01-15 13:54:19 +00:00
//! \return the number of bytes used in the current block when processing at the optimal block size
2015-11-05 06:59:46 +00:00
virtual unsigned int GetOptimalBlockSizeUsed ( ) const { return 0 ; }
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Provides input and output data alignment for optimal performance.
2016-01-15 13:54:19 +00:00
//! \return the input data alignment that provides optimal performance
2015-11-05 06:59:46 +00:00
virtual unsigned int OptimalDataAlignment ( ) const ;
2015-11-18 20:32:28 +00:00
//! \brief Encrypt or decrypt an array of bytes
//! \param outString the output byte buffer
//! \param inString the input byte buffer
//! \param length the size of the input and output byte buffers, in bytes
//! \details Either <tt>inString == outString</tt>, or they must not overlap.
2015-11-05 06:59:46 +00:00
virtual void ProcessData ( byte * outString , const byte * inString , size_t length ) = 0 ;
2015-11-18 20:32:28 +00:00
//! \brief Encrypt or decrypt the last block of data
//! \param outString the output byte buffer
//! \param inString the input byte buffer
//! \param length the size of the input and output byte buffers, in bytes
//! ProcessLastBlock is used when the last block of data is special.
//! Currently the only use of this function is CBC-CTS mode.
2015-11-05 06:59:46 +00:00
virtual void ProcessLastBlock ( byte * outString , const byte * inString , size_t length ) ;
2015-11-18 20:32:28 +00:00
2016-09-13 20:43:12 +00:00
//! \brief Provides the size of the last block
//! \returns the minimum size of the last block
//! \details MinLastBlockSize() returns the minimum size of the last block. 0 indicates the last
//! block is not special.
2015-11-05 06:59:46 +00:00
virtual unsigned int MinLastBlockSize ( ) const { return 0 ; }
2015-11-18 20:32:28 +00:00
//! \brief Encrypt or decrypt a string of bytes
//! \param inoutString the string to process
2017-03-17 22:31:40 +00:00
//! \param length the size of the inoutString, in bytes
2015-11-18 20:32:28 +00:00
//! \details Internally, the base class implementation calls ProcessData().
2015-11-05 06:59:46 +00:00
inline void ProcessString ( byte * inoutString , size_t length )
{ ProcessData ( inoutString , inoutString , length ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Encrypt or decrypt a string of bytes
//! \param outString the output string to process
//! \param inString the input string to process
//! \param length the size of the input and output strings, in bytes
//! \details Internally, the base class implementation calls ProcessData().
2015-11-05 06:59:46 +00:00
inline void ProcessString ( byte * outString , const byte * inString , size_t length )
{ ProcessData ( outString , inString , length ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Encrypt or decrypt a byte
//! \param input the input byte to process
//! \details Internally, the base class implementation calls ProcessData() with a size of 1.
2015-11-05 06:59:46 +00:00
inline byte ProcessByte ( byte input )
{ ProcessData ( & input , & input , 1 ) ; return input ; }
2015-11-18 20:32:28 +00:00
//! \brief Determines whether the cipher supports random access
2016-04-26 21:11:50 +00:00
//! \returns true if the cipher supports random access, false otherwise
2015-11-05 06:59:46 +00:00
virtual bool IsRandomAccess ( ) const = 0 ;
2015-11-18 20:32:28 +00:00
//! \brief Seek to an absolute position
//! \param pos position to seek
//! \throws NotImplemented
//! \details The base class implementation throws NotImplemented. The function
2016-09-16 15:27:15 +00:00
//! \ref CRYPTOPP_ASSERT "asserts" IsRandomAccess() in debug builds.
2015-11-18 20:32:28 +00:00
virtual void Seek ( lword pos )
2015-11-05 06:59:46 +00:00
{
2015-11-18 20:32:28 +00:00
CRYPTOPP_UNUSED ( pos ) ;
2016-09-16 15:27:15 +00:00
CRYPTOPP_ASSERT ( ! IsRandomAccess ( ) ) ;
2015-11-05 06:59:46 +00:00
throw NotImplemented ( " StreamTransformation: this object doesn't support random access " ) ;
}
2015-11-18 20:32:28 +00:00
//! \brief Determines whether the cipher is self-inverting
2016-04-26 21:11:50 +00:00
//! \returns true if the cipher is self-inverting, false otherwise
2016-08-28 03:52:43 +00:00
//! \details IsSelfInverting determines whether this transformation is
2015-11-18 20:32:28 +00:00
//! self-inverting (e.g. xor with a keystream).
2015-11-05 06:59:46 +00:00
virtual bool IsSelfInverting ( ) const = 0 ;
2015-11-18 20:32:28 +00:00
//! \brief Determines if the cipher is being operated in its forward direction
2016-04-26 21:11:50 +00:00
//! \returns true if DIR is ENCRYPTION, false otherwise
2015-11-18 20:32:28 +00:00
//! \sa IsForwardTransformation(), IsPermutation(), GetCipherDirection()
2015-11-05 06:59:46 +00:00
virtual bool IsForwardTransformation ( ) const = 0 ;
} ;
2015-11-18 20:32:28 +00:00
//! \class HashTransformation
2015-11-05 06:59:46 +00:00
//! \brief Interface for hash functions and data processing part of MACs
2015-11-18 20:32:28 +00:00
//! \details HashTransformation objects are stateful. They are created in an initial state,
//! change state as Update() is called, and return to the initial
//! state when Final() is called. This interface allows a large message to
//! be hashed in pieces by calling Update() on each piece followed by
//! calling Final().
//! \sa HashFilter(), HashVerificationFilter()
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE HashTransformation : public Algorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ HashTransformation ( ) { }
2015-11-18 20:32:28 +00:00
//! \brief Provides a reference to this object
2016-01-15 13:54:19 +00:00
//! \return A reference to this object
2015-11-05 06:59:46 +00:00
//! \details Useful for passing a temporary object to a function that takes a non-const reference
HashTransformation & Ref ( ) { return * this ; }
2015-11-18 20:32:28 +00:00
//! \brief Updates a hash with additional input
//! \param input the additional input as a buffer
//! \param length the size of the buffer, in bytes
2015-11-05 06:59:46 +00:00
virtual void Update ( const byte * input , size_t length ) = 0 ;
2015-11-18 20:32:28 +00:00
//! \brief Request space which can be written into by the caller
//! \param size the requested size of the buffer
//! \details The purpose of this method is to help avoid extra memory allocations.
//! \details size is an \a IN and \a OUT parameter and used as a hint. When the call is made,
//! size is the requested size of the buffer. When the call returns, size is the size of
//! the array returned to the caller.
2017-03-17 22:31:40 +00:00
//! \details The base class implementation sets size to 0 and returns NULL or nullptr.
2016-02-01 18:41:25 +00:00
//! \note Some objects, like ArraySink, cannot create a space because its fixed.
2017-03-01 11:10:06 +00:00
virtual byte * CreateUpdateSpace ( size_t & size ) { size = 0 ; return NULLPTR ; }
2015-11-05 06:59:46 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Computes the hash of the current message
//! \param digest a pointer to the buffer to receive the hash
2016-02-01 18:41:25 +00:00
//! \details Final() restarts the hash for a new message.
//! \pre <tt>COUNTOF(digest) == DigestSize()</tt> or <tt>COUNTOF(digest) == HASH::DIGESTSIZE</tt> ensures
//! the output byte buffer is large enough for the digest.
2015-11-05 06:59:46 +00:00
virtual void Final ( byte * digest )
{ TruncatedFinal ( digest , DigestSize ( ) ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Restart the hash
//! \details Discards the current state, and restart for a new message
2015-11-05 06:59:46 +00:00
virtual void Restart ( )
2017-03-01 11:10:06 +00:00
{ TruncatedFinal ( NULLPTR , 0 ) ; }
2015-11-05 06:59:46 +00:00
2015-11-18 20:32:28 +00:00
//! Provides the digest size of the hash
2016-01-15 13:54:19 +00:00
//! \return the digest size of the hash.
2015-11-05 06:59:46 +00:00
virtual unsigned int DigestSize ( ) const = 0 ;
2015-11-18 20:32:28 +00:00
//! Provides the tag size of the hash
2016-01-15 13:54:19 +00:00
//! \return the tag size of the hash.
2015-11-18 20:32:28 +00:00
//! \details Same as DigestSize().
2015-11-05 06:59:46 +00:00
unsigned int TagSize ( ) const { return DigestSize ( ) ; }
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Provides the block size of the compression function
2016-01-15 13:54:19 +00:00
//! \return the block size of the compression function, in bytes
2015-11-18 20:32:28 +00:00
//! \details BlockSize() will return 0 if the hash is not block based. For example,
//! SHA3 is a recursive hash (not an iterative hash), and it does not have a block size.
2015-11-05 06:59:46 +00:00
virtual unsigned int BlockSize ( ) const { return 0 ; }
2015-11-18 20:32:28 +00:00
//! \brief Provides the input block size most efficient for this hash.
2016-01-15 13:54:19 +00:00
//! \return The input block size that is most efficient for the cipher
2015-12-17 00:39:29 +00:00
//! \details The base class implementation returns MandatoryBlockSize().
2016-02-01 18:41:25 +00:00
//! \details Optimal input length is
2015-11-18 20:32:28 +00:00
//! <tt>n * OptimalBlockSize() - GetOptimalBlockSizeUsed()</tt> for any <tt>n \> 0</tt>.
2015-11-05 06:59:46 +00:00
virtual unsigned int OptimalBlockSize ( ) const { return 1 ; }
2015-11-18 20:32:28 +00:00
//! \brief Provides input and output data alignment for optimal performance
2016-01-15 13:54:19 +00:00
//! \return the input data alignment that provides optimal performance
2015-11-05 06:59:46 +00:00
virtual unsigned int OptimalDataAlignment ( ) const ;
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Updates the hash with additional input and computes the hash of the current message
//! \param digest a pointer to the buffer to receive the hash
//! \param input the additional input as a buffer
//! \param length the size of the buffer, in bytes
//! \details Use this if your input is in one piece and you don't want to call Update()
//! and Final() separately
2016-02-01 18:41:25 +00:00
//! \details CalculateDigest() restarts the hash for the next message.
//! \pre <tt>COUNTOF(digest) == DigestSize()</tt> or <tt>COUNTOF(digest) == HASH::DIGESTSIZE</tt> ensures
//! the output byte buffer is large enough for the digest.
2015-11-05 06:59:46 +00:00
virtual void CalculateDigest ( byte * digest , const byte * input , size_t length )
{ Update ( input , length ) ; Final ( digest ) ; }
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Verifies the hash of the current message
//! \param digest a pointer to the buffer of an \a existing hash
2016-01-15 13:54:19 +00:00
//! \return \p true if the existing hash matches the computed hash, \p false otherwise
2015-11-18 20:32:28 +00:00
//! \throws ThrowIfInvalidTruncatedSize() if the existing hash's size exceeds DigestSize()
//! \details Verify() performs a bitwise compare on the buffers using VerifyBufsEqual(), which is
//! a constant time comparison function. digestLength cannot exceed DigestSize().
2016-02-01 18:41:25 +00:00
//! \details Verify() restarts the hash for the next message.
//! \pre <tt>COUNTOF(digest) == DigestSize()</tt> or <tt>COUNTOF(digest) == HASH::DIGESTSIZE</tt> ensures
//! the output byte buffer is large enough for the digest.
2015-11-05 06:59:46 +00:00
virtual bool Verify ( const byte * digest )
{ return TruncatedVerify ( digest , DigestSize ( ) ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Updates the hash with additional input and verifies the hash of the current message
//! \param digest a pointer to the buffer of an \a existing hash
//! \param input the additional input as a buffer
//! \param length the size of the buffer, in bytes
2016-01-15 13:54:19 +00:00
//! \return \p true if the existing hash matches the computed hash, \p false otherwise
2015-11-18 20:32:28 +00:00
//! \throws ThrowIfInvalidTruncatedSize() if the existing hash's size exceeds DigestSize()
//! \details Use this if your input is in one piece and you don't want to call Update()
//! and Verify() separately
//! \details VerifyDigest() performs a bitwise compare on the buffers using VerifyBufsEqual(),
//! which is a constant time comparison function. digestLength cannot exceed DigestSize().
2016-02-01 18:41:25 +00:00
//! \details VerifyDigest() restarts the hash for the next message.
//! \pre <tt>COUNTOF(digest) == DigestSize()</tt> or <tt>COUNTOF(digest) == HASH::DIGESTSIZE</tt> ensures
//! the output byte buffer is large enough for the digest.
2015-11-05 06:59:46 +00:00
virtual bool VerifyDigest ( const byte * digest , const byte * input , size_t length )
{ Update ( input , length ) ; return Verify ( digest ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Computes the hash of the current message
//! \param digest a pointer to the buffer to receive the hash
//! \param digestSize the size of the truncated digest, in bytes
2016-09-13 20:43:12 +00:00
//! \details TruncatedFinal() call Final() and then copies digestSize bytes to digest.
//! The hash is restarted the hash for the next message.
2015-11-05 06:59:46 +00:00
virtual void TruncatedFinal ( byte * digest , size_t digestSize ) = 0 ;
2015-11-18 20:32:28 +00:00
//! \brief Updates the hash with additional input and computes the hash of the current message
//! \param digest a pointer to the buffer to receive the hash
//! \param digestSize the length of the truncated hash, in bytes
//! \param input the additional input as a buffer
//! \param length the size of the buffer, in bytes
//! \details Use this if your input is in one piece and you don't want to call Update()
//! and CalculateDigest() separately.
2016-02-01 18:41:25 +00:00
//! \details CalculateTruncatedDigest() restarts the hash for the next message.
//! \pre <tt>COUNTOF(digest) == DigestSize()</tt> or <tt>COUNTOF(digest) == HASH::DIGESTSIZE</tt> ensures
//! the output byte buffer is large enough for the digest.
2015-11-05 06:59:46 +00:00
virtual void CalculateTruncatedDigest ( byte * digest , size_t digestSize , const byte * input , size_t length )
{ Update ( input , length ) ; TruncatedFinal ( digest , digestSize ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Verifies the hash of the current message
//! \param digest a pointer to the buffer of an \a existing hash
//! \param digestLength the size of the truncated hash, in bytes
2016-01-15 13:54:19 +00:00
//! \return \p true if the existing hash matches the computed hash, \p false otherwise
2015-11-18 20:32:28 +00:00
//! \throws ThrowIfInvalidTruncatedSize() if digestLength exceeds DigestSize()
//! \details TruncatedVerify() is a truncated version of Verify(). It can operate on a
//! buffer smaller than DigestSize(). However, digestLength cannot exceed DigestSize().
//! \details Verify() performs a bitwise compare on the buffers using VerifyBufsEqual(), which is
//! a constant time comparison function. digestLength cannot exceed DigestSize().
2016-02-01 18:41:25 +00:00
//! \details TruncatedVerify() restarts the hash for the next message.
2015-11-05 06:59:46 +00:00
virtual bool TruncatedVerify ( const byte * digest , size_t digestLength ) ;
2015-11-18 20:32:28 +00:00
//! \brief Updates the hash with additional input and verifies the hash of the current message
//! \param digest a pointer to the buffer of an \a existing hash
//! \param digestLength the size of the truncated hash, in bytes
//! \param input the additional input as a buffer
//! \param length the size of the buffer, in bytes
2016-01-15 13:54:19 +00:00
//! \return \p true if the existing hash matches the computed hash, \p false otherwise
2015-11-18 20:32:28 +00:00
//! \throws ThrowIfInvalidTruncatedSize() if digestLength exceeds DigestSize()
//! \details Use this if your input is in one piece and you don't want to call Update()
//! and TruncatedVerify() separately.
//! \details VerifyTruncatedDigest() is a truncated version of VerifyDigest(). It can operate
//! on a buffer smaller than DigestSize(). However, digestLength cannot exceed DigestSize().
2016-02-01 18:41:25 +00:00
//! \details VerifyTruncatedDigest() restarts the hash for the next message.
//! \pre <tt>COUNTOF(digest) == DigestSize()</tt> or <tt>COUNTOF(digest) == HASH::DIGESTSIZE</tt> ensures
//! the output byte buffer is large enough for the digest.
2015-11-05 06:59:46 +00:00
virtual bool VerifyTruncatedDigest ( const byte * digest , size_t digestLength , const byte * input , size_t length )
{ Update ( input , length ) ; return TruncatedVerify ( digest , digestLength ) ; }
2015-11-23 00:17:15 +00:00
2015-11-05 06:59:46 +00:00
protected :
2015-12-14 04:53:50 +00:00
//! \brief Validates a truncated digest size
//! \param size the requested digest size
//! \throws InvalidArgument if the algorithm's digest size cannot be truncated to the requested size
//! \details Throws an exception when the truncated digest size is greater than DigestSize()
2015-11-05 06:59:46 +00:00
void ThrowIfInvalidTruncatedSize ( size_t size ) const ;
} ;
//! \brief Interface for one direction (encryption or decryption) of a block cipher
2016-01-15 13:54:19 +00:00
//! \details These objects usually should not be used directly. See BlockTransformation for more details.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE BlockCipher : public SimpleKeyingInterface , public BlockTransformation
{
protected :
const Algorithm & GetAlgorithm ( ) const { return * this ; }
} ;
//! \brief Interface for one direction (encryption or decryption) of a stream cipher or cipher mode
2016-01-15 13:54:19 +00:00
//! \details These objects usually should not be used directly. See StreamTransformation for more details.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE SymmetricCipher : public SimpleKeyingInterface , public StreamTransformation
{
protected :
const Algorithm & GetAlgorithm ( ) const { return * this ; }
} ;
//! \brief Interface for message authentication codes
2016-01-15 13:54:19 +00:00
//! \details These objects usually should not be used directly. See HashTransformation for more details.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE MessageAuthenticationCode : public SimpleKeyingInterface , public HashTransformation
{
protected :
const Algorithm & GetAlgorithm ( ) const { return * this ; }
} ;
2015-11-18 20:32:28 +00:00
//! \brief Interface for one direction (encryption or decryption) of a stream cipher or block cipher mode with authentication
2016-01-15 13:54:19 +00:00
//! \details The StreamTransformation part of this interface is used to encrypt/decrypt the data, and the
//! MessageAuthenticationCode part of this interface is used to input additional authenticated data (AAD,
//! which is MAC'ed but not encrypted), and to generate/verify the MAC.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE AuthenticatedSymmetricCipher : public MessageAuthenticationCode , public StreamTransformation
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ AuthenticatedSymmetricCipher ( ) { }
2016-01-15 13:54:19 +00:00
//! \brief Exception thrown when the object is in the wrong state for the operation
//! \details this indicates that a member function was called in the wrong state, for example trying to encrypt
//! a message before having set the key or IV
2015-11-05 06:59:46 +00:00
class BadState : public Exception
{
public :
explicit BadState ( const std : : string & name , const char * message ) : Exception ( OTHER_ERROR , name + " : " + message ) { }
explicit BadState ( const std : : string & name , const char * function , const char * state ) : Exception ( OTHER_ERROR , name + " : " + function + " was called before " + state ) { }
} ;
2016-01-15 13:54:19 +00:00
//! \brief Provides the maximum length of AAD that can be input
//! \return the maximum length of AAD that can be input before the encrypted data
2015-11-05 06:59:46 +00:00
virtual lword MaxHeaderLength ( ) const = 0 ;
2016-01-15 13:54:19 +00:00
//! \brief Provides the maximum length of encrypted data
//! \return the maximum length of encrypted data
2015-11-05 06:59:46 +00:00
virtual lword MaxMessageLength ( ) const = 0 ;
2016-01-15 13:54:19 +00:00
//! \brief Provides the the maximum length of AAD
//! \return the maximum length of AAD that can be input after the encrypted data
2015-11-05 06:59:46 +00:00
virtual lword MaxFooterLength ( ) const { return 0 ; }
2016-01-15 13:54:19 +00:00
//! \brief Determines if data lengths must be specified prior to inputting data
//! \return true if the data lengths are required before inputting data, false otherwise
//! \details if this function returns true, SpecifyDataLengths() must be called before attempting to input data.
//! This is the case for some schemes, such as CCM.
//! \sa SpecifyDataLengths()
2015-11-05 06:59:46 +00:00
virtual bool NeedsPrespecifiedDataLengths ( ) const { return false ; }
2016-08-28 03:52:43 +00:00
//! \brief Prespecifies the data lengths
2016-01-15 13:54:19 +00:00
//! \details this function only needs to be called if NeedsPrespecifiedDataLengths() returns true
//! \sa NeedsPrespecifiedDataLengths()
2015-11-05 06:59:46 +00:00
void SpecifyDataLengths ( lword headerLength , lword messageLength , lword footerLength = 0 ) ;
2016-01-15 13:54:19 +00:00
//! \brief Encrypts and calculates a MAC in one call
//! \return true if the authenticated encryption succeeded, false otherwise
//! \details EncryptAndAuthenticate() encrypts and generates the MAC in one call. The function will truncate MAC if
//! <tt>macSize < TagSize()</tt>.
2015-11-05 06:59:46 +00:00
virtual void EncryptAndAuthenticate ( byte * ciphertext , byte * mac , size_t macSize , const byte * iv , int ivLength , const byte * header , size_t headerLength , const byte * message , size_t messageLength ) ;
2016-01-15 13:54:19 +00:00
//! \brief Decrypts and verifies a MAC in one call
//! \return true if the MAC is valid and the decoding succeeded, false otherwise
//! \details DecryptAndVerify() decrypts and verifies the MAC in one call. The function returns true iff MAC is valid.
//! DecryptAndVerify() will assume MAC is truncated if <tt>macLength < TagSize()</tt>.
2015-11-05 06:59:46 +00:00
virtual bool DecryptAndVerify ( byte * message , const byte * mac , size_t macLength , const byte * iv , int ivLength , const byte * header , size_t headerLength , const byte * ciphertext , size_t ciphertextLength ) ;
2016-01-15 13:54:19 +00:00
//! \brief Provides the name of this algorithm
//! \return the standard algorithm name
//! \details The standard algorithm name can be a name like \a AES or \a AES/GCM. Some algorithms
//! do not have standard names yet. For example, there is no standard algorithm name for
2017-03-17 22:31:40 +00:00
//! Shoup's ECIES.
2015-11-05 06:59:46 +00:00
virtual std : : string AlgorithmName ( ) const = 0 ;
2015-11-23 00:17:15 +00:00
2015-11-05 06:59:46 +00:00
protected :
const Algorithm & GetAlgorithm ( ) const
{ return * static_cast < const MessageAuthenticationCode * > ( this ) ; }
virtual void UncheckedSpecifyDataLengths ( lword headerLength , lword messageLength , lword footerLength )
{ CRYPTOPP_UNUSED ( headerLength ) ; CRYPTOPP_UNUSED ( messageLength ) ; CRYPTOPP_UNUSED ( footerLength ) ; }
} ;
//! \class RandomNumberGenerator
//! \brief Interface for random number generators
//! \details The library provides a number of random number generators, from software based to hardware based generators.
2015-11-19 18:09:33 +00:00
//! \details All generated values are uniformly distributed over the range specified.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE RandomNumberGenerator : public Algorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ RandomNumberGenerator ( ) { }
2015-11-05 06:59:46 +00:00
//! \brief Update RNG state with additional unpredictable values
//! \param input the entropy to add to the generator
2016-08-28 03:52:43 +00:00
//! \param length the size of the input buffer
2015-11-05 06:59:46 +00:00
//! \throws NotImplemented
2016-01-15 13:54:19 +00:00
//! \details A generator may or may not accept additional entropy. Call CanIncorporateEntropy() to test for the
2015-11-05 06:59:46 +00:00
//! ability to use additional entropy.
2015-11-19 18:09:33 +00:00
//! \details If a derived class does not override IncorporateEntropy(), then the base class throws
2015-11-18 20:32:28 +00:00
//! NotImplemented.
2015-11-05 06:59:46 +00:00
virtual void IncorporateEntropy ( const byte * input , size_t length )
{
CRYPTOPP_UNUSED ( input ) ; CRYPTOPP_UNUSED ( length ) ;
throw NotImplemented ( " RandomNumberGenerator: IncorporateEntropy not implemented " ) ;
}
//! \brief Determines if a generator can accept additional entropy
2016-01-15 13:54:19 +00:00
//! \return true if IncorporateEntropy() is implemented
2015-11-05 06:59:46 +00:00
virtual bool CanIncorporateEntropy ( ) const { return false ; }
//! \brief Generate new random byte and return it
2016-01-15 13:54:19 +00:00
//! \return a random 8-bit byte
2015-11-19 18:09:33 +00:00
//! \details Default implementation calls GenerateBlock() with one byte.
//! \details All generated values are uniformly distributed over the range specified within the
2016-12-27 17:34:57 +00:00
//! the constraints of a particular generator.
2015-11-05 06:59:46 +00:00
virtual byte GenerateByte ( ) ;
//! \brief Generate new random bit and return it
2016-01-15 13:54:19 +00:00
//! \return a random bit
2015-11-05 06:59:46 +00:00
//! \details The default implementation calls GenerateByte() and return its lowest bit.
2015-11-19 18:09:33 +00:00
//! \details All generated values are uniformly distributed over the range specified within the
2016-12-27 17:34:57 +00:00
//! the constraints of a particular generator.
2015-11-05 06:59:46 +00:00
virtual unsigned int GenerateBit ( ) ;
//! \brief Generate a random 32 bit word in the range min to max, inclusive
//! \param min the lower bound of the range
//! \param max the upper bound of the range
2016-01-15 13:54:19 +00:00
//! \return a random 32-bit word
2015-11-19 18:09:33 +00:00
//! \details The default implementation calls Crop() on the difference between max and
//! min, and then returns the result added to min.
//! \details All generated values are uniformly distributed over the range specified within the
2016-12-27 17:34:57 +00:00
//! the constraints of a particular generator.
2015-11-18 20:32:28 +00:00
virtual word32 GenerateWord32 ( word32 min = 0 , word32 max = 0xffffffffUL ) ;
2015-11-05 06:59:46 +00:00
//! \brief Generate random array of bytes
//! \param output the byte buffer
//! \param size the length of the buffer, in bytes
2015-11-19 18:09:33 +00:00
//! \details All generated values are uniformly distributed over the range specified within the
2016-12-27 17:34:57 +00:00
//! the constraints of a particular generator.
2015-11-19 18:09:33 +00:00
//! \note A derived generator \a must override either GenerateBlock() or
2017-03-17 22:31:40 +00:00
//! GenerateIntoBufferedTransformation(). They can override both, or have one call the other.
2015-11-05 06:59:46 +00:00
virtual void GenerateBlock ( byte * output , size_t size ) ;
//! \brief Generate random bytes into a BufferedTransformation
//! \param target the BufferedTransformation object which receives the bytes
//! \param channel the channel on which the bytes should be pumped
//! \param length the number of bytes to generate
2015-11-19 18:09:33 +00:00
//! \details The default implementation calls GenerateBlock() and pumps the result into
2017-03-17 22:31:40 +00:00
//! the DEFAULT_CHANNEL of the target.
2015-11-19 18:09:33 +00:00
//! \details All generated values are uniformly distributed over the range specified within the
2016-12-27 17:34:57 +00:00
//! the constraints of a particular generator.
2015-11-19 18:09:33 +00:00
//! \note A derived generator \a must override either GenerateBlock() or
//! GenerateIntoBufferedTransformation(). They can override both, or have one call the other.
2015-11-05 06:59:46 +00:00
virtual void GenerateIntoBufferedTransformation ( BufferedTransformation & target , const std : : string & channel , lword length ) ;
2015-11-18 20:32:28 +00:00
//! \brief Generate and discard n bytes
2015-11-05 06:59:46 +00:00
//! \param n the number of bytes to generate and discard
virtual void DiscardBytes ( size_t n ) ;
//! \brief Randomly shuffle the specified array
//! \param begin an iterator to the first element in the array
//! \param end an iterator beyond the last element in the array
//! \details The resulting permutation is uniformly distributed.
template < class IT > void Shuffle ( IT begin , IT end )
{
// TODO: What happens if there are more than 2^32 elements?
for ( ; begin ! = end ; + + begin )
2017-05-09 22:44:45 +00:00
std : : iter_swap ( begin , begin + GenerateWord32 ( 0 , static_cast < word32 > ( end - begin - 1 ) ) ) ;
2015-11-05 06:59:46 +00:00
}
} ;
2015-11-18 20:32:28 +00:00
//! \brief Random Number Generator that does not produce random numbers
2016-01-15 13:54:19 +00:00
//! \return reference that can be passed to functions that require a RandomNumberGenerator
2015-11-18 20:32:28 +00:00
//! \details NullRNG() returns a reference that can be passed to functions that require a
2016-08-28 03:52:43 +00:00
//! RandomNumberGenerator but don't actually use it. The NullRNG() throws NotImplemented
2015-11-18 20:32:28 +00:00
//! when a generation function is called.
2016-01-15 13:54:19 +00:00
//! \sa ClassNullRNG, PK_SignatureScheme::IsProbabilistic()
2015-11-05 06:59:46 +00:00
CRYPTOPP_DLL RandomNumberGenerator & CRYPTOPP_API NullRNG ( ) ;
//! \class WaitObjectContainer
class WaitObjectContainer ;
//! \class CallStack
class CallStack ;
//! \brief Interface for objects that can be waited on.
class CRYPTOPP_NO_VTABLE Waitable
{
public :
virtual ~ Waitable ( ) { }
//! \brief Maximum number of wait objects that this object can return
2016-01-15 13:54:19 +00:00
//! \return the maximum number of wait objects
2015-11-05 06:59:46 +00:00
virtual unsigned int GetMaxWaitObjectCount ( ) const = 0 ;
//! \brief Retrieves waitable objects
//! \param container the wait container to receive the references to the objects.
2017-03-17 22:31:40 +00:00
//! \param callStack CallStack() object used to select waitable objects
//! \details GetWaitObjects() is usually called in one of two ways. First, it can
2015-11-05 06:59:46 +00:00
//! be called like <tt>something.GetWaitObjects(c, CallStack("my func after X", 0));</tt>.
2017-03-17 22:31:40 +00:00
//! Second, if in an outer GetWaitObjects() method that itself takes a callStack
2015-11-05 06:59:46 +00:00
//! parameter, it can be called like
//! <tt>innerThing.GetWaitObjects(c, CallStack("MyClass::GetWaitObjects at X", &callStack));</tt>.
virtual void GetWaitObjects ( WaitObjectContainer & container , CallStack const & callStack ) = 0 ;
2016-01-15 13:54:19 +00:00
//! \brief Wait on this object
//! \return true if the wait succeeded, false otherwise
//! \details Wait() is the same as creating an empty container, calling GetWaitObjects(), and then calling
//! Wait() on the container.
2015-11-05 06:59:46 +00:00
bool Wait ( unsigned long milliseconds , CallStack const & callStack ) ;
} ;
2015-11-18 20:32:28 +00:00
//! \brief Default channel for BufferedTransformation
2017-03-17 22:31:40 +00:00
//! \details DEFAULT_CHANNEL is equal to an empty string
2015-11-05 06:59:46 +00:00
extern CRYPTOPP_DLL const std : : string DEFAULT_CHANNEL ;
//! \brief Channel for additional authenticated data
2015-11-18 20:32:28 +00:00
//! \details AAD_CHANNEL is equal to "AAD"
2015-11-05 06:59:46 +00:00
extern CRYPTOPP_DLL const std : : string AAD_CHANNEL ;
//! \brief Interface for buffered transformations
2015-11-18 20:32:28 +00:00
//! \details BufferedTransformation is a generalization of BlockTransformation,
//! StreamTransformation and HashTransformation.
2015-11-05 06:59:46 +00:00
//! \details A buffered transformation is an object that takes a stream of bytes as input (this may
//! be done in stages), does some computation on them, and then places the result into an internal
//! buffer for later retrieval. Any partial result already in the output buffer is not modified
//! by further input.
2017-03-17 22:31:40 +00:00
//! \details If a method takes a "blocking" parameter, and you pass false for it, then the method
2015-11-05 06:59:46 +00:00
//! will return before all input has been processed if the input cannot be processed without waiting
//! (for network buffers to become available, for example). In this case the method will return true
//! or a non-zero integer value. When this happens you must continue to call the method with the same
//! parameters until it returns false or zero, before calling any other method on it or attached
//! /p BufferedTransformation. The integer return value in this case is approximately
//! the number of bytes left to be processed, and can be used to implement a progress bar.
//! \details For functions that take a "propagation" parameter, <tt>propagation != 0</tt> means pass on
2015-11-18 20:32:28 +00:00
//! the signal to attached BufferedTransformation objects, with propagation decremented at each
2015-11-05 06:59:46 +00:00
//! step until it reaches <tt>0</tt>. <tt>-1</tt> means unlimited propagation.
2015-11-18 20:32:28 +00:00
//! \details \a All of the retrieval functions, like Get() and GetWord32(), return the actual
2017-03-17 22:31:40 +00:00
//! number of bytes retrieved, which is the lesser of the request number and MaxRetrievable().
2015-11-18 20:32:28 +00:00
//! \details \a Most of the input functions, like Put() and PutWord32(), return the number of
2015-11-05 06:59:46 +00:00
//! bytes remaining to be processed. A 0 value means all bytes were processed, and a non-0 value
//! means bytes remain to be processed.
//! \nosubgrouping
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE BufferedTransformation : public Algorithm , public Waitable
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ BufferedTransformation ( ) { }
//! \brief Construct a BufferedTransformation
2015-11-05 06:59:46 +00:00
BufferedTransformation ( ) : Algorithm ( false ) { }
//! \brief Provides a reference to this object
2016-01-15 13:54:19 +00:00
//! \return A reference to this object
2015-11-05 06:59:46 +00:00
//! \details Useful for passing a temporary object to a function that takes a non-const reference
BufferedTransformation & Ref ( ) { return * this ; }
//! \name INPUT
//@{
//! \brief Input a byte for processing
//! \param inByte the 8-bit byte (octet) to be processed.
//! \param blocking specifies whether the object should block when processing input.
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the block (i.e., bytes not processed)
2015-11-05 06:59:46 +00:00
//! \details <tt>Put(byte)</tt> calls <tt>Put(byte*, size_t)</tt>.
size_t Put ( byte inByte , bool blocking = true )
{ return Put ( & inByte , 1 , blocking ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Input a byte buffer for processing
//! \param inString the byte buffer to process
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the block (i.e., bytes not processed)
2015-11-18 20:32:28 +00:00
//! \details Internally, Put() calls Put2().
2015-11-05 06:59:46 +00:00
size_t Put ( const byte * inString , size_t length , bool blocking = true )
{ return Put2 ( inString , length , 0 , blocking ) ; }
//! Input a 16-bit word for processing.
//! \param value the 16-bit value to be processed
2016-11-14 08:48:21 +00:00
//! \param order the ByteOrder of the value to be processed.
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the block (i.e., bytes not processed)
2015-11-05 06:59:46 +00:00
size_t PutWord16 ( word16 value , ByteOrder order = BIG_ENDIAN_ORDER , bool blocking = true ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! Input a 32-bit word for processing.
//! \param value the 32-bit value to be processed.
2016-11-14 08:48:21 +00:00
//! \param order the ByteOrder of the value to be processed.
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input.
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the block (i.e., bytes not processed)
2015-11-05 06:59:46 +00:00
size_t PutWord32 ( word32 value , ByteOrder order = BIG_ENDIAN_ORDER , bool blocking = true ) ;
2015-11-18 20:32:28 +00:00
//! \brief Request space which can be written into by the caller
2015-11-05 06:59:46 +00:00
//! \param size the requested size of the buffer
//! \details The purpose of this method is to help avoid extra memory allocations.
2015-11-18 20:32:28 +00:00
//! \details size is an \a IN and \a OUT parameter and used as a hint. When the call is made,
2017-03-17 22:31:40 +00:00
//! size is the requested size of the buffer. When the call returns, size is the size of
2015-11-05 06:59:46 +00:00
//! the array returned to the caller.
2017-03-01 11:10:06 +00:00
//! \details The base class implementation sets size to 0 and returns NULL.
2015-11-18 20:32:28 +00:00
//! \note Some objects, like ArraySink, cannot create a space because its fixed. In the case of
2017-03-17 22:31:40 +00:00
//! an ArraySink, the pointer to the array is returned and the size is remaining size.
2015-11-05 06:59:46 +00:00
virtual byte * CreatePutSpace ( size_t & size )
2017-03-01 11:10:06 +00:00
{ size = 0 ; return NULLPTR ; }
2015-11-05 06:59:46 +00:00
2016-12-27 17:34:57 +00:00
//! \brief Determines whether input can be modified by the callee
2016-01-15 13:54:19 +00:00
//! \return true if input can be modified, false otherwise
2017-03-17 22:31:40 +00:00
//! \details The base class implementation returns false.
2015-11-05 06:59:46 +00:00
virtual bool CanModifyInput ( ) const
{ return false ; }
//! \brief Input multiple bytes that may be modified by callee.
2015-11-18 20:32:28 +00:00
//! \param inString the byte buffer to process
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return 0 indicates all bytes were processed during the call. Non-0 indicates the
2015-11-05 06:59:46 +00:00
//! number of bytes that were \a not processed
size_t PutModifiable ( byte * inString , size_t length , bool blocking = true )
{ return PutModifiable2 ( inString , length , 0 , blocking ) ; }
//! \brief Signals the end of messages to the object
2017-03-17 22:31:40 +00:00
//! \param propagation the number of attached transformations the MessageEnd() signal should be passed
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
2015-11-18 20:32:28 +00:00
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2015-11-05 06:59:46 +00:00
bool MessageEnd ( int propagation = - 1 , bool blocking = true )
2017-03-01 11:10:06 +00:00
{ return ! ! Put2 ( NULLPTR , 0 , propagation < 0 ? - 1 : propagation + 1 , blocking ) ; }
2015-11-05 06:59:46 +00:00
//! \brief Input multiple bytes for processing and signal the end of a message
2015-11-18 20:32:28 +00:00
//! \param inString the byte buffer to process
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes
2017-03-17 22:31:40 +00:00
//! \param propagation the number of attached transformations the MessageEnd() signal should be passed
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the block (i.e., bytes not processed)
2017-03-17 22:31:40 +00:00
//! \details Internally, PutMessageEnd() calls Put2() with a modified propagation to
2015-11-05 06:59:46 +00:00
//! ensure all attached transformations finish processing the message.
2015-11-18 20:32:28 +00:00
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2015-11-05 06:59:46 +00:00
size_t PutMessageEnd ( const byte * inString , size_t length , int propagation = - 1 , bool blocking = true )
{ return Put2 ( inString , length , propagation < 0 ? - 1 : propagation + 1 , blocking ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Input multiple bytes for processing
//! \param inString the byte buffer to process
//! \param length the size of the string, in bytes
//! \param messageEnd means how many filters to signal MessageEnd() to, including this one
//! \param blocking specifies whether the object should block when processing input
//! \details Derived classes must implement Put2().
2015-11-05 06:59:46 +00:00
virtual size_t Put2 ( const byte * inString , size_t length , int messageEnd , bool blocking ) = 0 ;
//! \brief Input multiple bytes that may be modified by callee.
2015-11-18 20:32:28 +00:00
//! \param inString the byte buffer to process.
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes.
2015-11-18 20:32:28 +00:00
//! \param messageEnd means how many filters to signal MessageEnd() to, including this one.
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input.
2015-11-18 20:32:28 +00:00
//! \details Internally, PutModifiable2() calls Put2().
2015-11-05 06:59:46 +00:00
virtual size_t PutModifiable2 ( byte * inString , size_t length , int messageEnd , bool blocking )
{ return Put2 ( inString , length , messageEnd , blocking ) ; }
2015-12-16 08:22:22 +00:00
//! \class BlockingInputOnly
//! \brief Exception thrown by objects that have \a not implemented nonblocking input processing
//! \details BlockingInputOnly inherits from NotImplemented
2015-11-05 06:59:46 +00:00
struct BlockingInputOnly : public NotImplemented
{ BlockingInputOnly ( const std : : string & s ) : NotImplemented ( s + " : Nonblocking input is not implemented by this object. " ) { } } ;
//@}
//! \name WAITING
//@{
//! \brief Retrieves the maximum number of waitable objects
unsigned int GetMaxWaitObjectCount ( ) const ;
//! \brief Retrieves waitable objects
2015-11-18 20:32:28 +00:00
//! \param container the wait container to receive the references to the objects
2017-03-17 22:31:40 +00:00
//! \param callStack CallStack() object used to select waitable objects
2015-11-18 20:32:28 +00:00
//! \details GetWaitObjects is usually called in one of two ways. First, it can
2015-11-05 06:59:46 +00:00
//! be called like <tt>something.GetWaitObjects(c, CallStack("my func after X", 0));</tt>.
2017-03-17 22:31:40 +00:00
//! Second, if in an outer GetWaitObjects() method that itself takes a callStack
2015-11-05 06:59:46 +00:00
//! parameter, it can be called like
//! <tt>innerThing.GetWaitObjects(c, CallStack("MyClass::GetWaitObjects at X", &callStack));</tt>.
void GetWaitObjects ( WaitObjectContainer & container , CallStack const & callStack ) ;
//@} // WAITING
//! \name SIGNALS
//@{
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Initialize or reinitialize this object, without signal propagation
2015-12-17 00:39:29 +00:00
//! \param parameters a set of NameValuePairs to initialize this object
2015-11-05 06:59:46 +00:00
//! \throws NotImplemented
2015-11-18 20:32:28 +00:00
//! \details IsolatedInitialize() is used to initialize or reinitialize an object using a variable
2017-03-17 22:31:40 +00:00
//! number of arbitrarily typed arguments. The function avoids the need for multiple constructors providing
2015-11-05 06:59:46 +00:00
//! all possible combintations of configurable parameters.
2015-11-18 20:32:28 +00:00
//! \details IsolatedInitialize() does not call Initialize() on attached transformations. If initialization
//! should be propagated, then use the Initialize() function.
//! \details If a derived class does not override IsolatedInitialize(), then the base class throws
//! NotImplemented.
2015-11-05 06:59:46 +00:00
virtual void IsolatedInitialize ( const NameValuePairs & parameters ) {
CRYPTOPP_UNUSED ( parameters ) ;
throw NotImplemented ( " BufferedTransformation: this object can't be reinitialized " ) ;
}
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Flushes data buffered by this object, without signal propagation
//! \param hardFlush indicates whether all data should be flushed
//! \param blocking specifies whether the object should block when processing input
2017-03-17 22:31:40 +00:00
//! \note hardFlush must be used with care
2015-11-05 06:59:46 +00:00
virtual bool IsolatedFlush ( bool hardFlush , bool blocking ) = 0 ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Marks the end of a series of messages, without signal propagation
//! \param blocking specifies whether the object should block when completing the processing on
//! the current series of messages
virtual bool IsolatedMessageSeriesEnd ( bool blocking )
{ CRYPTOPP_UNUSED ( blocking ) ; return false ; }
//! \brief Initialize or reinitialize this object, with signal propagation
2015-12-17 00:39:29 +00:00
//! \param parameters a set of NameValuePairs to initialize or reinitialize this object
2015-11-18 20:32:28 +00:00
//! \param propagation the number of attached transformations the Initialize() signal should be passed
2016-08-28 03:52:43 +00:00
//! \details Initialize() is used to initialize or reinitialize an object using a variable number of
2016-12-27 17:34:57 +00:00
//! arbitrarily typed arguments. The function avoids the need for multiple constructors providing
2015-11-05 06:59:46 +00:00
//! all possible combintations of configurable parameters.
2015-11-18 20:32:28 +00:00
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2015-11-05 06:59:46 +00:00
virtual void Initialize ( const NameValuePairs & parameters = g_nullNameValuePairs , int propagation = - 1 ) ;
//! \brief Flush buffered input and/or output, with signal propagation
//! \param hardFlush is used to indicate whether all data should be flushed
2017-03-17 22:31:40 +00:00
//! \param propagation the number of attached transformations the Flush() signal should be passed
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
2015-11-18 20:32:28 +00:00
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2015-11-05 06:59:46 +00:00
//! \note Hard flushes must be used with care. It means try to process and output everything, even if
2016-04-25 02:20:25 +00:00
//! there may not be enough data to complete the action. For example, hard flushing a HexDecoder
2015-11-05 06:59:46 +00:00
//! would cause an error if you do it after inputing an odd number of hex encoded characters.
2015-11-18 20:32:28 +00:00
//! \note For some types of filters, like ZlibDecompressor, hard flushes can only
2015-11-05 06:59:46 +00:00
//! be done at "synchronization points". These synchronization points are positions in the data
//! stream that are created by hard flushes on the corresponding reverse filters, in this
//! example ZlibCompressor. This is useful when zlib compressed data is moved across a
//! network in packets and compression state is preserved across packets, as in the SSH2 protocol.
virtual bool Flush ( bool hardFlush , int propagation = - 1 , bool blocking = true ) ;
//! \brief Marks the end of a series of messages, with signal propagation
2017-03-17 22:31:40 +00:00
//! \param propagation the number of attached transformations the MessageSeriesEnd() signal should be passed
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
//! \details Each object that receives the signal will perform its processing, decrement
2015-11-18 20:32:28 +00:00
//! propagation, and then pass the signal on to attached transformations if the value is not 0.
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2016-04-25 02:20:25 +00:00
//! \note There should be a MessageEnd() immediately before MessageSeriesEnd().
2015-11-05 06:59:46 +00:00
virtual bool MessageSeriesEnd ( int propagation = - 1 , bool blocking = true ) ;
//! \brief Set propagation of automatically generated and transferred signals
2016-08-28 03:52:43 +00:00
//! \param propagation then new value
2016-12-27 17:34:57 +00:00
//! \details Setting propagation to <tt>0</tt> means do not automatically generate signals. Setting
2015-11-18 20:32:28 +00:00
//! propagation to <tt>-1</tt> means unlimited propagation.
2015-11-05 06:59:46 +00:00
virtual void SetAutoSignalPropagation ( int propagation )
{ CRYPTOPP_UNUSED ( propagation ) ; }
//! \brief Retrieve automatic signal propagation value
2016-12-27 17:34:57 +00:00
//! \return the number of attached transformations the signal is propagated to. 0 indicates
2016-01-15 13:54:19 +00:00
//! the signal is only witnessed by this object
2015-11-05 06:59:46 +00:00
virtual int GetAutoSignalPropagation ( ) const { return 0 ; }
public :
//! \name RETRIEVAL OF ONE MESSAGE
//@{
//! \brief Provides the number of bytes ready for retrieval
2016-01-15 13:54:19 +00:00
//! \return the number of bytes ready for retrieval
2015-11-05 06:59:46 +00:00
//! \details All retrieval functions return the actual number of bytes retrieved, which is
2015-11-18 20:32:28 +00:00
//! the lesser of the request number and MaxRetrievable()
2015-11-05 06:59:46 +00:00
virtual lword MaxRetrievable ( ) const ;
//! \brief Determines whether bytes are ready for retrieval
2016-04-26 21:11:50 +00:00
//! \returns true if bytes are available for retrieval, false otherwise
2015-11-05 06:59:46 +00:00
virtual bool AnyRetrievable ( ) const ;
//! \brief Retrieve a 8-bit byte
//! \param outByte the 8-bit value to be retrieved
2016-01-15 13:54:19 +00:00
//! \return the number of bytes consumed during the call.
2017-03-17 22:31:40 +00:00
//! \details Use the return value of Get to detect short reads.
2015-11-05 06:59:46 +00:00
virtual size_t Get ( byte & outByte ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Retrieve a block of bytes
//! \param outString a block of bytes
2017-03-17 22:31:40 +00:00
//! \param getMax the number of bytes to Get
2016-01-15 13:54:19 +00:00
//! \return the number of bytes consumed during the call.
2017-03-17 22:31:40 +00:00
//! \details Use the return value of Get to detect short reads.
2015-11-05 06:59:46 +00:00
virtual size_t Get ( byte * outString , size_t getMax ) ;
//! \brief Peek a 8-bit byte
//! \param outByte the 8-bit value to be retrieved
2016-01-15 13:54:19 +00:00
//! \return the number of bytes read during the call.
2015-11-18 20:32:28 +00:00
//! \details Peek does not remove bytes from the object. Use the return value of
2017-03-17 22:31:40 +00:00
//! Get() to detect short reads.
2015-11-05 06:59:46 +00:00
virtual size_t Peek ( byte & outByte ) const ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Peek a block of bytes
//! \param outString a block of bytes
2017-03-17 22:31:40 +00:00
//! \param peekMax the number of bytes to Peek
2016-01-15 13:54:19 +00:00
//! \return the number of bytes read during the call.
2015-11-18 20:32:28 +00:00
//! \details Peek does not remove bytes from the object. Use the return value of
2017-03-17 22:31:40 +00:00
//! Get() to detect short reads.
2015-11-05 06:59:46 +00:00
virtual size_t Peek ( byte * outString , size_t peekMax ) const ;
//! \brief Retrieve a 16-bit word
//! \param value the 16-bit value to be retrieved
2016-11-14 08:48:21 +00:00
//! \param order the ByteOrder of the value to be processed.
2016-01-15 13:54:19 +00:00
//! \return the number of bytes consumed during the call.
2017-03-17 22:31:40 +00:00
//! \details Use the return value of GetWord16() to detect short reads.
2015-11-05 06:59:46 +00:00
size_t GetWord16 ( word16 & value , ByteOrder order = BIG_ENDIAN_ORDER ) ;
//! \brief Retrieve a 32-bit word
//! \param value the 32-bit value to be retrieved
2016-11-14 08:48:21 +00:00
//! \param order the ByteOrder of the value to be processed.
2016-01-15 13:54:19 +00:00
//! \return the number of bytes consumed during the call.
2017-03-17 22:31:40 +00:00
//! \details Use the return value of GetWord16() to detect short reads.
2015-11-05 06:59:46 +00:00
size_t GetWord32 ( word32 & value , ByteOrder order = BIG_ENDIAN_ORDER ) ;
//! \brief Peek a 16-bit word
//! \param value the 16-bit value to be retrieved
2016-11-14 08:48:21 +00:00
//! \param order the ByteOrder of the value to be processed.
2016-01-15 13:54:19 +00:00
//! \return the number of bytes consumed during the call.
2015-11-18 20:32:28 +00:00
//! \details Peek does not consume bytes in the stream. Use the return value
2017-03-17 22:31:40 +00:00
//! of GetWord16() to detect short reads.
2015-11-05 06:59:46 +00:00
size_t PeekWord16 ( word16 & value , ByteOrder order = BIG_ENDIAN_ORDER ) const ;
//! \brief Peek a 32-bit word
//! \param value the 32-bit value to be retrieved
2016-11-14 08:48:21 +00:00
//! \param order the ByteOrder of the value to be processed.
2016-01-15 13:54:19 +00:00
//! \return the number of bytes consumed during the call.
2015-11-18 20:32:28 +00:00
//! \details Peek does not consume bytes in the stream. Use the return value
2017-03-17 22:31:40 +00:00
//! of GetWord16() to detect short reads.
2015-11-05 06:59:46 +00:00
size_t PeekWord32 ( word32 & value , ByteOrder order = BIG_ENDIAN_ORDER ) const ;
//! move transferMax bytes of the buffered output to target as input
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Transfer bytes from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \param transferMax the number of bytes to transfer
//! \param channel the channel on which the transfer should occur
2016-01-15 13:54:19 +00:00
//! \return the number of bytes transferred during the call.
2015-11-18 20:32:28 +00:00
//! \details TransferTo removes bytes from this object and moves them to the destination.
2017-03-17 22:31:40 +00:00
//! \details The function always returns transferMax. If an accurate count is needed, then use TransferTo2().
2015-11-05 06:59:46 +00:00
lword TransferTo ( BufferedTransformation & target , lword transferMax = LWORD_MAX , const std : : string & channel = DEFAULT_CHANNEL )
{ TransferTo2 ( target , transferMax , channel ) ; return transferMax ; }
2016-08-28 03:52:43 +00:00
//! \brief Discard skipMax bytes from the output buffer
2015-11-05 06:59:46 +00:00
//! \param skipMax the number of bytes to discard
2016-08-28 03:52:43 +00:00
//! \details Skip() discards bytes from the output buffer, which is the AttachedTransformation(), if present.
2016-10-11 23:13:36 +00:00
//! The function always returns the parameter <tt>skipMax</tt>.
2016-08-28 03:52:43 +00:00
//! \details If you want to skip bytes from a Source, then perform the following.
2016-10-11 23:13:36 +00:00
//! <pre>
//! StringSource ss(str, false, new Redirector(TheBitBucket()));
//! ss.Pump(10); // Skip 10 bytes from Source
//! ss.Detach(new FilterChain(...));
//! ss.PumpAll();
2016-08-28 03:52:43 +00:00
//! </pre>
2015-11-05 06:59:46 +00:00
virtual lword Skip ( lword skipMax = LWORD_MAX ) ;
//! copy copyMax bytes of the buffered output to target as input
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Copy bytes from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \param copyMax the number of bytes to copy
//! \param channel the channel on which the transfer should occur
2016-01-15 13:54:19 +00:00
//! \return the number of bytes copied during the call.
2015-11-18 20:32:28 +00:00
//! \details CopyTo copies bytes from this object to the destination. The bytes are not removed from this object.
2017-03-17 22:31:40 +00:00
//! \details The function always returns copyMax. If an accurate count is needed, then use CopyRangeTo2().
2015-11-05 06:59:46 +00:00
lword CopyTo ( BufferedTransformation & target , lword copyMax = LWORD_MAX , const std : : string & channel = DEFAULT_CHANNEL ) const
{ return CopyRangeTo ( target , 0 , copyMax , channel ) ; }
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Copy bytes from this object using an index to another BufferedTransformation
//! \param target the destination BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \param position the 0-based index of the byte stream to begin the copying
//! \param copyMax the number of bytes to copy
//! \param channel the channel on which the transfer should occur
2016-01-15 13:54:19 +00:00
//! \return the number of bytes copied during the call.
2015-11-18 20:32:28 +00:00
//! \details CopyTo copies bytes from this object to the destination. The bytes remain in this
2015-11-05 06:59:46 +00:00
//! object. Copying begins at the index position in the current stream, and not from an absolute
//! position in the stream.
//! \details The function returns the new position in the stream after transferring the bytes starting at the index.
lword CopyRangeTo ( BufferedTransformation & target , lword position , lword copyMax = LWORD_MAX , const std : : string & channel = DEFAULT_CHANNEL ) const
{ lword i = position ; CopyRangeTo2 ( target , i , i + copyMax , channel ) ; return i - position ; }
//@}
//! \name RETRIEVAL OF MULTIPLE MESSAGES
//@{
//! \brief Provides the number of bytes ready for retrieval
2016-01-15 13:54:19 +00:00
//! \return the number of bytes ready for retrieval
2015-11-05 06:59:46 +00:00
virtual lword TotalBytesRetrievable ( ) const ;
2015-11-18 20:32:28 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Provides the number of meesages processed by this object
2016-01-15 13:54:19 +00:00
//! \return the number of meesages processed by this object
2017-03-17 22:31:40 +00:00
//! \details NumberOfMessages returns number of times MessageEnd() has been
2015-11-05 06:59:46 +00:00
//! received minus messages retrieved or skipped
virtual unsigned int NumberOfMessages ( ) const ;
//! \brief Determines if any messages are available for retrieval
2016-04-26 21:11:50 +00:00
//! \returns true if <tt>NumberOfMessages() > 0</tt>, false otherwise
2015-11-18 20:32:28 +00:00
//! \details AnyMessages returns true if <tt>NumberOfMessages() > 0</tt>
2015-11-05 06:59:46 +00:00
virtual bool AnyMessages ( ) const ;
2015-11-18 20:32:28 +00:00
//! \brief Start retrieving the next message
2016-01-15 13:54:19 +00:00
//! \return true if a message is ready for retrieval
2015-11-18 20:32:28 +00:00
//! \details GetNextMessage() returns true if a message is ready for retrieval; false
//! if no more messages exist or this message is not completely retrieved.
2015-11-05 06:59:46 +00:00
virtual bool GetNextMessage ( ) ;
2015-11-18 20:32:28 +00:00
//! \brief Skip a number of meessages
2016-01-15 13:54:19 +00:00
//! \return 0 if the requested number of messages was skipped, non-0 otherwise
2015-11-18 20:32:28 +00:00
//! \details SkipMessages() skips count number of messages. If there is an AttachedTransformation()
//! then SkipMessages() is called on the attached transformation. If there is no attached
//! transformation, then count number of messages are sent to TheBitBucket() using TransferMessagesTo().
2015-11-05 06:59:46 +00:00
virtual unsigned int SkipMessages ( unsigned int count = UINT_MAX ) ;
2015-11-18 20:32:28 +00:00
//! \brief Transfer messages from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
//! \param count the number of messages to transfer
//! \param channel the channel on which the transfer should occur
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the current transfer block (i.e., bytes not transferred)
//! \details TransferMessagesTo2() removes messages from this object and moves them to the destination.
2015-11-18 20:32:28 +00:00
//! If all bytes are not transferred for a message, then processing stops and the number of remaining
//! bytes is returned. TransferMessagesTo() does not proceed to the next message.
//! \details A return value of 0 indicates all messages were successfully transferred.
2015-11-05 06:59:46 +00:00
unsigned int TransferMessagesTo ( BufferedTransformation & target , unsigned int count = UINT_MAX , const std : : string & channel = DEFAULT_CHANNEL )
{ TransferMessagesTo2 ( target , count , channel ) ; return count ; }
2015-11-18 20:32:28 +00:00
2016-01-15 13:54:19 +00:00
//! \brief Copy messages from this object to another BufferedTransformation
2015-11-18 20:32:28 +00:00
//! \param target the destination BufferedTransformation
//! \param count the number of messages to transfer
//! \param channel the channel on which the transfer should occur
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the current transfer block (i.e., bytes not transferred)
2015-11-18 20:32:28 +00:00
//! \details CopyMessagesTo copies messages from this object and copies them to the destination.
//! If all bytes are not transferred for a message, then processing stops and the number of remaining
//! bytes is returned. CopyMessagesTo() does not proceed to the next message.
//! \details A return value of 0 indicates all messages were successfully copied.
2015-11-05 06:59:46 +00:00
unsigned int CopyMessagesTo ( BufferedTransformation & target , unsigned int count = UINT_MAX , const std : : string & channel = DEFAULT_CHANNEL ) const ;
2016-01-15 13:54:19 +00:00
//! \brief Skip all messages in the series
2015-11-05 06:59:46 +00:00
virtual void SkipAll ( ) ;
2016-01-15 13:54:19 +00:00
//! \brief Transfer all bytes from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
//! \param channel the channel on which the transfer should occur
//! \return the number of bytes that remain in the current transfer block (i.e., bytes not transferred)
//! \details TransferMessagesTo2() removes messages from this object and moves them to the destination.
//! Internally TransferAllTo() calls TransferAllTo2().
2015-11-05 06:59:46 +00:00
void TransferAllTo ( BufferedTransformation & target , const std : : string & channel = DEFAULT_CHANNEL )
{ TransferAllTo2 ( target , channel ) ; }
2016-01-15 13:54:19 +00:00
//! \brief Copy messages from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
//! \param channel the channel on which the transfer should occur
//! \details CopyAllTo copies messages from this object and copies them to the destination.
2015-11-05 06:59:46 +00:00
void CopyAllTo ( BufferedTransformation & target , const std : : string & channel = DEFAULT_CHANNEL ) const ;
2016-01-15 13:54:19 +00:00
//! \brief Retrieve the next message in a series
//! \return true if a message was retreved, false otherwise
//! \details Internally, the base class implementation returns false.
2015-11-05 06:59:46 +00:00
virtual bool GetNextMessageSeries ( ) { return false ; }
2016-01-15 13:54:19 +00:00
//! \brief Provides the number of messages in a series
//! \return the number of messages in this series
2015-11-05 06:59:46 +00:00
virtual unsigned int NumberOfMessagesInThisSeries ( ) const { return NumberOfMessages ( ) ; }
2016-01-15 13:54:19 +00:00
//! \brief Provides the number of messages in a series
//! \return the number of messages in this series
2015-11-05 06:59:46 +00:00
virtual unsigned int NumberOfMessageSeries ( ) const { return 0 ; }
//@}
//! \name NON-BLOCKING TRANSFER OF OUTPUT
//@{
2016-08-28 03:52:43 +00:00
2016-12-27 17:34:57 +00:00
// upon return, byteCount contains number of bytes that have finished being transferred,
2015-11-05 06:59:46 +00:00
// and returns the number of bytes left in the current transfer block
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Transfer bytes from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \param byteCount the number of bytes to transfer
//! \param channel the channel on which the transfer should occur
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the transfer block (i.e., bytes not transferred)
//! \details TransferTo() removes bytes from this object and moves them to the destination.
2015-11-05 06:59:46 +00:00
//! Transfer begins at the index position in the current stream, and not from an absolute
//! position in the stream.
2015-11-18 20:32:28 +00:00
//! \details byteCount is an \a IN and \a OUT parameter. When the call is made,
2016-01-15 13:54:19 +00:00
//! byteCount is the requested size of the transfer. When the call returns, byteCount is
2015-11-05 06:59:46 +00:00
//! the number of bytes that were transferred.
virtual size_t TransferTo2 ( BufferedTransformation & target , lword & byteCount , const std : : string & channel = DEFAULT_CHANNEL , bool blocking = true ) = 0 ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
// upon return, begin contains the start position of data yet to be finished copying,
// and returns the number of bytes left in the current transfer block
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Copy bytes from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \param begin the 0-based index of the first byte to copy in the stream
//! \param end the 0-based index of the last byte to copy in the stream
//! \param channel the channel on which the transfer should occur
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the copy block (i.e., bytes not copied)
2015-11-18 20:32:28 +00:00
//! \details CopyRangeTo2 copies bytes from this object to the destination. The bytes are not
2015-11-05 06:59:46 +00:00
//! removed from this object. Copying begins at the index position in the current stream, and
//! not from an absolute position in the stream.
2016-01-15 13:54:19 +00:00
//! \details begin is an \a IN and \a OUT parameter. When the call is made, begin is the
//! starting position of the copy. When the call returns, begin is the position of the first
2017-03-17 22:31:40 +00:00
//! byte that was \a not copied (which may be different than end). begin can be used for
//! subsequent calls to CopyRangeTo2().
2015-11-05 06:59:46 +00:00
virtual size_t CopyRangeTo2 ( BufferedTransformation & target , lword & begin , lword end = LWORD_MAX , const std : : string & channel = DEFAULT_CHANNEL , bool blocking = true ) const = 0 ;
2016-08-28 03:52:43 +00:00
2016-12-27 17:34:57 +00:00
// upon return, messageCount contains number of messages that have finished being transferred,
2015-11-05 06:59:46 +00:00
// and returns the number of bytes left in the current transfer block
2015-11-18 20:32:28 +00:00
//! \brief Transfer messages from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \param messageCount the number of messages to transfer
//! \param channel the channel on which the transfer should occur
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the current transfer block (i.e., bytes not transferred)
//! \details TransferMessagesTo2() removes messages from this object and moves them to the destination.
//! \details messageCount is an \a IN and \a OUT parameter. When the call is made, messageCount is the
2017-03-17 22:31:40 +00:00
//! the number of messages requested to be transferred. When the call returns, messageCount is the
2016-01-15 13:54:19 +00:00
//! number of messages actually transferred.
2015-11-05 06:59:46 +00:00
size_t TransferMessagesTo2 ( BufferedTransformation & target , unsigned int & messageCount , const std : : string & channel = DEFAULT_CHANNEL , bool blocking = true ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
// returns the number of bytes left in the current transfer block
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Transfer all bytes from this object to another BufferedTransformation
//! \param target the destination BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \param channel the channel on which the transfer should occur
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the current transfer block (i.e., bytes not transferred)
//! \details TransferMessagesTo2() removes messages from this object and moves them to the destination.
2015-11-05 06:59:46 +00:00
size_t TransferAllTo2 ( BufferedTransformation & target , const std : : string & channel = DEFAULT_CHANNEL , bool blocking = true ) ;
//@}
//! \name CHANNELS
//@{
//! \brief Exception thrown when a filter does not support named channels
struct NoChannelSupport : public NotImplemented
{ NoChannelSupport ( const std : : string & name ) : NotImplemented ( name + " : this object doesn't support multiple channels " ) { } } ;
//! \brief Exception thrown when a filter does not recognize a named channel
struct InvalidChannelName : public InvalidArgument
{ InvalidChannelName ( const std : : string & name , const std : : string & channel ) : InvalidArgument ( name + " : unexpected channel name \" " + channel + " \" " ) { } } ;
//! \brief Input a byte for processing on a channel
//! \param channel the channel to process the data.
//! \param inByte the 8-bit byte (octet) to be processed.
//! \param blocking specifies whether the object should block when processing input.
2016-01-15 13:54:19 +00:00
//! \return 0 indicates all bytes were processed during the call. Non-0 indicates the
2015-11-05 06:59:46 +00:00
//! number of bytes that were \a not processed.
size_t ChannelPut ( const std : : string & channel , byte inByte , bool blocking = true )
{ return ChannelPut ( channel , & inByte , 1 , blocking ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Input a byte buffer for processing on a channel
2015-11-05 06:59:46 +00:00
//! \param channel the channel to process the data
2015-11-18 20:32:28 +00:00
//! \param inString the byte buffer to process
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return 0 indicates all bytes were processed during the call. Non-0 indicates the
2015-11-05 06:59:46 +00:00
//! number of bytes that were \a not processed.
size_t ChannelPut ( const std : : string & channel , const byte * inString , size_t length , bool blocking = true )
{ return ChannelPut2 ( channel , inString , length , 0 , blocking ) ; }
//! \brief Input multiple bytes that may be modified by callee on a channel
//! \param channel the channel to process the data.
2015-11-18 20:32:28 +00:00
//! \param inString the byte buffer to process
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return 0 indicates all bytes were processed during the call. Non-0 indicates the
2015-11-05 06:59:46 +00:00
//! number of bytes that were \a not processed.
size_t ChannelPutModifiable ( const std : : string & channel , byte * inString , size_t length , bool blocking = true )
{ return ChannelPutModifiable2 ( channel , inString , length , 0 , blocking ) ; }
//! \brief Input a 16-bit word for processing on a channel.
//! \param channel the channel to process the data.
//! \param value the 16-bit value to be processed.
2016-11-14 08:48:21 +00:00
//! \param order the ByteOrder of the value to be processed.
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input.
2016-01-15 13:54:19 +00:00
//! \return 0 indicates all bytes were processed during the call. Non-0 indicates the
2015-11-05 06:59:46 +00:00
//! number of bytes that were \a not processed.
size_t ChannelPutWord16 ( const std : : string & channel , word16 value , ByteOrder order = BIG_ENDIAN_ORDER , bool blocking = true ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Input a 32-bit word for processing on a channel.
//! \param channel the channel to process the data.
//! \param value the 32-bit value to be processed.
2016-11-14 08:48:21 +00:00
//! \param order the ByteOrder of the value to be processed.
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input.
2016-01-15 13:54:19 +00:00
//! \return 0 indicates all bytes were processed during the call. Non-0 indicates the
2015-11-05 06:59:46 +00:00
//! number of bytes that were \a not processed.
size_t ChannelPutWord32 ( const std : : string & channel , word32 value , ByteOrder order = BIG_ENDIAN_ORDER , bool blocking = true ) ;
//! \brief Signal the end of a message
//! \param channel the channel to process the data.
2017-03-17 22:31:40 +00:00
//! \param propagation the number of attached transformations the ChannelMessageEnd() signal should be passed
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return 0 indicates all bytes were processed during the call. Non-0 indicates the
2015-11-05 06:59:46 +00:00
//! number of bytes that were \a not processed.
2015-11-18 20:32:28 +00:00
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2015-11-05 06:59:46 +00:00
bool ChannelMessageEnd ( const std : : string & channel , int propagation = - 1 , bool blocking = true )
2017-03-01 11:10:06 +00:00
{ return ! ! ChannelPut2 ( channel , NULLPTR , 0 , propagation < 0 ? - 1 : propagation + 1 , blocking ) ; }
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Input multiple bytes for processing and signal the end of a message
//! \param channel the channel to process the data.
2015-11-18 20:32:28 +00:00
//! \param inString the byte buffer to process
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes
2015-11-18 20:32:28 +00:00
//! \param propagation the number of attached transformations the ChannelPutMessageEnd() signal should be passed
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the block (i.e., bytes not processed)
2015-11-18 20:32:28 +00:00
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2015-11-05 06:59:46 +00:00
size_t ChannelPutMessageEnd ( const std : : string & channel , const byte * inString , size_t length , int propagation = - 1 , bool blocking = true )
{ return ChannelPut2 ( channel , inString , length , propagation < 0 ? - 1 : propagation + 1 , blocking ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Request space which can be written into by the caller
2015-11-05 06:59:46 +00:00
//! \param channel the channel to process the data
//! \param size the requested size of the buffer
2016-01-15 13:54:19 +00:00
//! \return a pointer to a memroy block with length size
2015-11-05 06:59:46 +00:00
//! \details The purpose of this method is to help avoid extra memory allocations.
2015-11-18 20:32:28 +00:00
//! \details size is an \a IN and \a OUT parameter and used as a hint. When the call is made,
2017-03-17 22:31:40 +00:00
//! size is the requested size of the buffer. When the call returns, size is the size of
2015-11-05 06:59:46 +00:00
//! the array returned to the caller.
2015-12-17 00:39:29 +00:00
//! \details The base class implementation sets size to 0 and returns NULL.
//! \note Some objects, like ArraySink(), cannot create a space because its fixed. In the case of
//! an ArraySink(), the pointer to the array is returned and the size is remaining size.
2015-11-05 06:59:46 +00:00
virtual byte * ChannelCreatePutSpace ( const std : : string & channel , size_t & size ) ;
//! \brief Input multiple bytes for processing on a channel.
//! \param channel the channel to process the data.
2015-11-18 20:32:28 +00:00
//! \param inString the byte buffer to process.
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes.
2015-11-18 20:32:28 +00:00
//! \param messageEnd means how many filters to signal MessageEnd() to, including this one.
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input.
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the block (i.e., bytes not processed)
2015-11-05 06:59:46 +00:00
virtual size_t ChannelPut2 ( const std : : string & channel , const byte * inString , size_t length , int messageEnd , bool blocking ) ;
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Input multiple bytes that may be modified by callee on a channel
//! \param channel the channel to process the data
2015-11-18 20:32:28 +00:00
//! \param inString the byte buffer to process
2015-11-05 06:59:46 +00:00
//! \param length the size of the string, in bytes
2015-11-18 20:32:28 +00:00
//! \param messageEnd means how many filters to signal MessageEnd() to, including this one
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return the number of bytes that remain in the block (i.e., bytes not processed)
2015-11-05 06:59:46 +00:00
virtual size_t ChannelPutModifiable2 ( const std : : string & channel , byte * inString , size_t length , int messageEnd , bool blocking ) ;
//! \brief Flush buffered input and/or output on a channel
//! \param channel the channel to flush the data
//! \param hardFlush is used to indicate whether all data should be flushed
2017-03-17 22:31:40 +00:00
//! \param propagation the number of attached transformations the ChannelFlush() signal should be passed
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
2016-01-15 13:54:19 +00:00
//! \return true of the Flush was successful
2015-11-18 20:32:28 +00:00
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2015-11-05 06:59:46 +00:00
virtual bool ChannelFlush ( const std : : string & channel , bool hardFlush , int propagation = - 1 , bool blocking = true ) ;
//! \brief Marks the end of a series of messages on a channel
//! \param channel the channel to signal the end of a series of messages
2017-03-17 22:31:40 +00:00
//! \param propagation the number of attached transformations the ChannelMessageSeriesEnd() signal should be passed
2015-11-05 06:59:46 +00:00
//! \param blocking specifies whether the object should block when processing input
//! \details Each object that receives the signal will perform its processing, decrement
2017-03-17 22:31:40 +00:00
//! propagation, and then pass the signal on to attached transformations if the value is not 0.
2015-11-18 20:32:28 +00:00
//! \details propagation count includes this object. Setting propagation to <tt>1</tt> means this
//! object only. Setting propagation to <tt>-1</tt> means unlimited propagation.
2016-04-25 02:20:25 +00:00
//! \note There should be a MessageEnd() immediately before MessageSeriesEnd().
2015-11-05 06:59:46 +00:00
virtual bool ChannelMessageSeriesEnd ( const std : : string & channel , int propagation = - 1 , bool blocking = true ) ;
//! \brief Sets the default retrieval channel
//! \param channel the channel to signal the end of a series of messages
//! \note this function may not be implemented in all objects that should support it.
virtual void SetRetrievalChannel ( const std : : string & channel ) ;
//@}
//! \name ATTACHMENT
2016-01-15 13:54:19 +00:00
//! \details Some BufferedTransformation objects (e.g. Filter objects) allow other BufferedTransformation objects to be
//! attached. When this is done, the first object instead of buffering its output, sends that output to the attached
//! object as input. The entire attachment chain is deleted when the anchor object is destructed.
2015-11-05 06:59:46 +00:00
//@{
//! \brief Determines whether the object allows attachment
2016-01-15 13:54:19 +00:00
//! \return true if the object allows an attachment, false otherwise
2017-03-17 22:31:40 +00:00
//! \details Sources and Filters will returns true, while Sinks and other objects will return false.
2015-11-05 06:59:46 +00:00
virtual bool Attachable ( ) { return false ; }
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Returns the object immediately attached to this object
2016-01-15 13:54:19 +00:00
//! \return the attached transformation
2015-12-17 00:39:29 +00:00
//! \details AttachedTransformation() returns NULL if there is no attachment. The non-const
//! version of AttachedTransformation() always returns NULL.
2017-03-01 11:10:06 +00:00
virtual BufferedTransformation * AttachedTransformation ( ) { CRYPTOPP_ASSERT ( ! Attachable ( ) ) ; return NULLPTR ; }
2016-08-28 03:52:43 +00:00
2015-11-05 06:59:46 +00:00
//! \brief Returns the object immediately attached to this object
2016-01-15 13:54:19 +00:00
//! \return the attached transformation
2015-12-17 00:39:29 +00:00
//! \details AttachedTransformation() returns NULL if there is no attachment. The non-const
//! version of AttachedTransformation() always returns NULL.
2015-11-05 06:59:46 +00:00
virtual const BufferedTransformation * AttachedTransformation ( ) const
{ return const_cast < BufferedTransformation * > ( this ) - > AttachedTransformation ( ) ; }
//! \brief Delete the current attachment chain and attach a new one
2015-11-18 20:32:28 +00:00
//! \param newAttachment the new BufferedTransformation to attach
2015-11-05 06:59:46 +00:00
//! \throws NotImplemented
2017-03-17 22:31:40 +00:00
//! \details Detach() deletes the current attachment chain and replace it with an optional newAttachment
//! \details If a derived class does not override Detach(), then the base class throws
2015-11-18 20:32:28 +00:00
//! NotImplemented.
2017-03-01 11:10:06 +00:00
virtual void Detach ( BufferedTransformation * newAttachment = NULLPTR ) {
2016-09-16 15:27:15 +00:00
CRYPTOPP_UNUSED ( newAttachment ) ; CRYPTOPP_ASSERT ( ! Attachable ( ) ) ;
2015-11-05 06:59:46 +00:00
throw NotImplemented ( " BufferedTransformation: this object is not attachable " ) ;
}
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Add newAttachment to the end of attachment chain
//! \param newAttachment the attachment to add to the end of the chain
2015-11-05 06:59:46 +00:00
virtual void Attach ( BufferedTransformation * newAttachment ) ;
//@}
2015-11-23 00:17:15 +00:00
2015-11-05 06:59:46 +00:00
protected :
//! \brief Decrements the propagation count while clamping at 0
2016-01-15 13:54:19 +00:00
//! \return the decremented propagation or 0
2015-11-05 06:59:46 +00:00
static int DecrementPropagation ( int propagation )
{ return propagation ! = 0 ? propagation - 1 : 0 ; }
private :
byte m_buf [ 4 ] ; // for ChannelPutWord16 and ChannelPutWord32, to ensure buffer isn't deallocated before non-blocking operation completes
} ;
2015-11-18 20:32:28 +00:00
//! \brief An input discarding BufferedTransformation
2016-01-15 13:54:19 +00:00
//! \return a reference to a BufferedTransformation object that discards all input
2015-11-05 06:59:46 +00:00
CRYPTOPP_DLL BufferedTransformation & TheBitBucket ( ) ;
//! \class CryptoMaterial
//! \brief Interface for crypto material, such as public and private keys, and crypto parameters
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CryptoMaterial : public NameValuePairs
{
public :
2016-01-15 13:54:19 +00:00
//! Exception thrown when invalid crypto material is detected
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL InvalidMaterial : public InvalidDataFormat
{
public :
explicit InvalidMaterial ( const std : : string & s ) : InvalidDataFormat ( s ) { }
} ;
2016-12-03 05:32:07 +00:00
virtual ~ CryptoMaterial ( ) { }
2015-11-05 06:59:46 +00:00
//! \brief Assign values to this object
2016-01-15 13:54:19 +00:00
//! \details This function can be used to create a public key from a private key.
2015-11-05 06:59:46 +00:00
virtual void AssignFrom ( const NameValuePairs & source ) = 0 ;
//! \brief Check this object for errors
2015-11-23 00:17:15 +00:00
//! \param rng a RandomNumberGenerator for objects which use randomized testing
2015-11-05 06:59:46 +00:00
//! \param level the level of thoroughness
2016-04-26 21:11:50 +00:00
//! \returns true if the tests succeed, false otherwise
2015-11-05 06:59:46 +00:00
//! \details There are four levels of thoroughness:
//! <ul>
//! <li>0 - using this object won't cause a crash or exception
//! <li>1 - this object will probably function, and encrypt, sign, other operations correctly
//! <li>2 - ensure this object will function correctly, and perform reasonable security checks
//! <li>3 - perform reasonable security checks, and do checks that may take a long time
//! </ul>
2016-01-19 18:05:54 +00:00
//! \details Level 0 does not require a RandomNumberGenerator. A NullRNG() can be used for level 0.
//! Level 1 may not check for weak keys and such. Levels 2 and 3 are recommended.
//! \sa ThrowIfInvalid()
2015-11-05 06:59:46 +00:00
virtual bool Validate ( RandomNumberGenerator & rng , unsigned int level ) const = 0 ;
//! \brief Check this object for errors
2015-11-23 00:17:15 +00:00
//! \param rng a RandomNumberGenerator for objects which use randomized testing
2015-11-05 06:59:46 +00:00
//! \param level the level of thoroughness
//! \throws InvalidMaterial
2016-01-15 13:54:19 +00:00
//! \details Internally, ThrowIfInvalid() calls Validate() and throws InvalidMaterial() if validation fails.
2016-01-19 18:05:54 +00:00
//! \sa Validate()
2015-11-05 06:59:46 +00:00
virtual void ThrowIfInvalid ( RandomNumberGenerator & rng , unsigned int level ) const
{ if ( ! Validate ( rng , level ) ) throw InvalidMaterial ( " CryptoMaterial: this object contains invalid values " ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Saves a key to a BufferedTransformation
//! \param bt the destination BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \throws NotImplemented
2016-01-19 18:05:54 +00:00
//! \details Save() writes the material to a BufferedTransformation.
2015-11-05 06:59:46 +00:00
//! \details If the material is a key, then the key is written with ASN.1 DER encoding. The key
2016-04-25 02:20:25 +00:00
//! includes an object identifier with an algorthm id, like a subjectPublicKeyInfo.
2016-01-15 13:54:19 +00:00
//! \details A "raw" key without the "key info" can be saved using a key's DEREncode() method.
//! \details If a derived class does not override Save(), then the base class throws
//! NotImplemented().
2015-11-05 06:59:46 +00:00
virtual void Save ( BufferedTransformation & bt ) const
{ CRYPTOPP_UNUSED ( bt ) ; throw NotImplemented ( " CryptoMaterial: this object does not support saving " ) ; }
2015-11-18 20:32:28 +00:00
//! \brief Loads a key from a BufferedTransformation
//! \param bt the source BufferedTransformation
2015-11-05 06:59:46 +00:00
//! \throws KeyingErr
2016-01-19 18:05:54 +00:00
//! \details Load() attempts to read material from a BufferedTransformation. If the
2015-11-05 06:59:46 +00:00
//! material is a key that was generated outside the library, then the following
//! usually applies:
//! <ul>
//! <li>the key should be ASN.1 BER encoded
//! <li>the key should be a "key info"
//! </ul>
//! \details "key info" means the key should have an object identifier with an algorthm id,
2016-04-25 02:20:25 +00:00
//! like a subjectPublicKeyInfo.
2016-01-19 18:05:54 +00:00
//! \details To read a "raw" key without the "key info", then call the key's BERDecode() method.
2017-03-17 22:31:40 +00:00
//! \note Load() generally does not check that the key is valid. Call Validate(), if needed.
2015-11-05 06:59:46 +00:00
virtual void Load ( BufferedTransformation & bt )
{ CRYPTOPP_UNUSED ( bt ) ; throw NotImplemented ( " CryptoMaterial: this object does not support loading " ) ; }
//! \brief Determines whether the object supports precomputation
2016-01-15 13:54:19 +00:00
//! \return true if the object supports precomputation, false otherwise
2016-01-19 18:05:54 +00:00
//! \sa Precompute()
2015-11-05 06:59:46 +00:00
virtual bool SupportsPrecomputation ( ) const { return false ; }
//! \brief Perform precomputation
//! \param precomputationStorage the suggested number of objects for the precompute table
//! \throws NotImplemented
2016-01-15 13:54:19 +00:00
//! \details The exact semantics of Precompute() varies, but it typically means calculate
//! a table of n objects that can be used later to speed up computation.
//! \details If a derived class does not override Precompute(), then the base class throws
2015-11-18 20:32:28 +00:00
//! NotImplemented.
2016-01-19 18:05:54 +00:00
//! \sa SupportsPrecomputation(), LoadPrecomputation(), SavePrecomputation()
2015-11-05 06:59:46 +00:00
virtual void Precompute ( unsigned int precomputationStorage ) {
2016-09-16 15:27:15 +00:00
CRYPTOPP_UNUSED ( precomputationStorage ) ; CRYPTOPP_ASSERT ( ! SupportsPrecomputation ( ) ) ;
2015-11-05 06:59:46 +00:00
throw NotImplemented ( " CryptoMaterial: this object does not support precomputation " ) ;
}
2016-01-15 13:54:19 +00:00
//! \brief Retrieve previously saved precomputation
//! \param storedPrecomputation BufferedTransformation with the saved precomputation
//! \throws NotImplemented
2016-01-19 18:05:54 +00:00
//! \sa SupportsPrecomputation(), Precompute()
2015-11-05 06:59:46 +00:00
virtual void LoadPrecomputation ( BufferedTransformation & storedPrecomputation )
2016-09-16 15:27:15 +00:00
{ CRYPTOPP_UNUSED ( storedPrecomputation ) ; CRYPTOPP_ASSERT ( ! SupportsPrecomputation ( ) ) ; throw NotImplemented ( " CryptoMaterial: this object does not support precomputation " ) ; }
2016-01-15 13:54:19 +00:00
//! \brief Save precomputation for later use
//! \param storedPrecomputation BufferedTransformation to write the precomputation
//! \throws NotImplemented
2016-01-19 18:05:54 +00:00
//! \sa SupportsPrecomputation(), Precompute()
2015-11-05 06:59:46 +00:00
virtual void SavePrecomputation ( BufferedTransformation & storedPrecomputation ) const
2016-09-16 15:27:15 +00:00
{ CRYPTOPP_UNUSED ( storedPrecomputation ) ; CRYPTOPP_ASSERT ( ! SupportsPrecomputation ( ) ) ; throw NotImplemented ( " CryptoMaterial: this object does not support precomputation " ) ; }
2015-11-05 06:59:46 +00:00
2016-01-15 13:54:19 +00:00
//! \brief Perform a quick sanity check
//! \details DoQuickSanityCheck() is for internal library use, and it should not be called by library users.
2015-11-05 06:59:46 +00:00
void DoQuickSanityCheck ( ) const { ThrowIfInvalid ( NullRNG ( ) , 0 ) ; }
2015-11-23 00:17:15 +00:00
2015-11-05 06:59:46 +00:00
# if (defined(__SUNPRO_CC) && __SUNPRO_CC < 0x590)
// Sun Studio 11/CC 5.8 workaround: it generates incorrect code when casting to an empty virtual base class
char m_sunCCworkaround ;
# endif
} ;
//! \class GeneratableCryptoMaterial
//! \brief Interface for generatable crypto material, such as private keys and crypto parameters
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE GeneratableCryptoMaterial : virtual public CryptoMaterial
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ GeneratableCryptoMaterial ( ) { }
2015-11-05 06:59:46 +00:00
//! \brief Generate a random key or crypto parameters
2015-11-23 00:17:15 +00:00
//! \param rng a RandomNumberGenerator to produce keying material
2015-11-05 06:59:46 +00:00
//! \param params additional initialization parameters
//! \throws KeyingErr if a key can't be generated or algorithm parameters are invalid
2017-03-17 22:31:40 +00:00
//! \details If a derived class does not override GenerateRandom(), then the base class throws
2015-11-18 20:32:28 +00:00
//! NotImplemented.
2015-11-05 06:59:46 +00:00
virtual void GenerateRandom ( RandomNumberGenerator & rng , const NameValuePairs & params = g_nullNameValuePairs ) {
CRYPTOPP_UNUSED ( rng ) ; CRYPTOPP_UNUSED ( params ) ;
throw NotImplemented ( " GeneratableCryptoMaterial: this object does not support key/parameter generation " ) ;
}
//! \brief Generate a random key or crypto parameters
2015-11-23 00:17:15 +00:00
//! \param rng a RandomNumberGenerator to produce keying material
2015-11-05 06:59:46 +00:00
//! \param keySize the size of the key, in bits
2016-08-28 03:52:43 +00:00
//! \throws KeyingErr if a key can't be generated or algorithm parameters are invalid
2017-03-17 22:31:40 +00:00
//! \details GenerateRandomWithKeySize calls GenerateRandom() with a NameValuePairs
2015-11-05 06:59:46 +00:00
//! object with only "KeySize"
void GenerateRandomWithKeySize ( RandomNumberGenerator & rng , unsigned int keySize ) ;
} ;
//! \brief Interface for public keys
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PublicKey : virtual public CryptoMaterial
{
} ;
//! \brief Interface for private keys
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PrivateKey : public GeneratableCryptoMaterial
{
} ;
//! \brief Interface for crypto prameters
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE CryptoParameters : public GeneratableCryptoMaterial
{
} ;
//! \brief Interface for asymmetric algorithms
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE AsymmetricAlgorithm : public Algorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ AsymmetricAlgorithm ( ) { }
2015-12-14 04:53:50 +00:00
//! \brief Retrieves a reference to CryptoMaterial
2016-01-15 13:54:19 +00:00
//! \return a reference to the crypto material
2015-11-05 06:59:46 +00:00
virtual CryptoMaterial & AccessMaterial ( ) = 0 ;
2016-08-28 03:52:43 +00:00
2015-12-14 04:53:50 +00:00
//! \brief Retrieves a reference to CryptoMaterial
2016-01-15 13:54:19 +00:00
//! \return a const reference to the crypto material
2015-11-05 06:59:46 +00:00
virtual const CryptoMaterial & GetMaterial ( ) const = 0 ;
2015-12-14 04:53:50 +00:00
//! \brief Loads this object from a BufferedTransformation
//! \param bt a BufferedTransformation object
//! \deprecated for backwards compatibility, calls <tt>AccessMaterial().Load(bt)</tt>
2015-11-05 06:59:46 +00:00
void BERDecode ( BufferedTransformation & bt )
{ AccessMaterial ( ) . Load ( bt ) ; }
2016-08-28 03:52:43 +00:00
2015-12-14 04:53:50 +00:00
//! \brief Saves this object to a BufferedTransformation
//! \param bt a BufferedTransformation object
//! \deprecated for backwards compatibility, calls GetMaterial().Save(bt)
2015-11-05 06:59:46 +00:00
void DEREncode ( BufferedTransformation & bt ) const
{ GetMaterial ( ) . Save ( bt ) ; }
} ;
//! \brief Interface for asymmetric algorithms using public keys
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PublicKeyAlgorithm : public AsymmetricAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ PublicKeyAlgorithm ( ) { }
2015-11-05 06:59:46 +00:00
// VC60 workaround: no co-variant return type
2016-08-28 03:52:43 +00:00
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to a Public Key
//! \return a reference to the public key
2015-12-14 04:53:50 +00:00
CryptoMaterial & AccessMaterial ( )
{ return AccessPublicKey ( ) ; }
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to a Public Key
//! \return a const reference the public key
2015-12-14 04:53:50 +00:00
const CryptoMaterial & GetMaterial ( ) const
{ return GetPublicKey ( ) ; }
2015-11-05 06:59:46 +00:00
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to a Public Key
//! \return a reference to the public key
2015-11-05 06:59:46 +00:00
virtual PublicKey & AccessPublicKey ( ) = 0 ;
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to a Public Key
//! \return a const reference the public key
2015-12-14 04:53:50 +00:00
virtual const PublicKey & GetPublicKey ( ) const
{ return const_cast < PublicKeyAlgorithm * > ( this ) - > AccessPublicKey ( ) ; }
2015-11-05 06:59:46 +00:00
} ;
//! \brief Interface for asymmetric algorithms using private keys
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PrivateKeyAlgorithm : public AsymmetricAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ PrivateKeyAlgorithm ( ) { }
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to a Private Key
//! \return a reference the private key
2015-11-05 06:59:46 +00:00
CryptoMaterial & AccessMaterial ( ) { return AccessPrivateKey ( ) ; }
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to a Private Key
//! \return a const reference the private key
2015-11-05 06:59:46 +00:00
const CryptoMaterial & GetMaterial ( ) const { return GetPrivateKey ( ) ; }
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to a Private Key
//! \return a reference the private key
2015-11-05 06:59:46 +00:00
virtual PrivateKey & AccessPrivateKey ( ) = 0 ;
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to a Private Key
//! \return a const reference the private key
2015-11-05 06:59:46 +00:00
virtual const PrivateKey & GetPrivateKey ( ) const { return const_cast < PrivateKeyAlgorithm * > ( this ) - > AccessPrivateKey ( ) ; }
} ;
//! \brief Interface for key agreement algorithms
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE KeyAgreementAlgorithm : public AsymmetricAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ KeyAgreementAlgorithm ( ) { }
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to Crypto Parameters
//! \return a reference the crypto parameters
2015-11-05 06:59:46 +00:00
CryptoMaterial & AccessMaterial ( ) { return AccessCryptoParameters ( ) ; }
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to Crypto Parameters
//! \return a const reference the crypto parameters
2015-11-05 06:59:46 +00:00
const CryptoMaterial & GetMaterial ( ) const { return GetCryptoParameters ( ) ; }
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to Crypto Parameters
//! \return a reference the crypto parameters
2015-11-05 06:59:46 +00:00
virtual CryptoParameters & AccessCryptoParameters ( ) = 0 ;
2016-01-15 13:54:19 +00:00
//! \brief Retrieves a reference to Crypto Parameters
//! \return a const reference the crypto parameters
2015-11-05 06:59:46 +00:00
virtual const CryptoParameters & GetCryptoParameters ( ) const { return const_cast < KeyAgreementAlgorithm * > ( this ) - > AccessCryptoParameters ( ) ; }
} ;
//! \brief Interface for public-key encryptors and decryptors
2015-12-14 04:53:50 +00:00
//! \details This class provides an interface common to encryptors and decryptors
//! for querying their plaintext and ciphertext lengths.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_CryptoSystem
{
public :
virtual ~ PK_CryptoSystem ( ) { }
2015-12-14 04:53:50 +00:00
//! \brief Provides the maximum length of plaintext for a given ciphertext length
2016-01-15 13:54:19 +00:00
//! \return the maximum size of the plaintext, in bytes
2015-12-14 04:53:50 +00:00
//! \details This function returns 0 if ciphertextLength is not valid (too long or too short).
2015-11-05 06:59:46 +00:00
virtual size_t MaxPlaintextLength ( size_t ciphertextLength ) const = 0 ;
2015-12-14 04:53:50 +00:00
//! \brief Calculate the length of ciphertext given length of plaintext
2016-01-15 13:54:19 +00:00
//! \return the maximum size of the ciphertext, in bytes
2015-12-14 04:53:50 +00:00
//! \details This function returns 0 if plaintextLength is not valid (too long).
2015-11-05 06:59:46 +00:00
virtual size_t CiphertextLength ( size_t plaintextLength ) const = 0 ;
2016-08-28 03:52:43 +00:00
//! \brief Determines whether this object supports the use of a named parameter
2015-12-14 04:53:50 +00:00
//! \param name the name of the parameter
2016-01-15 13:54:19 +00:00
//! \return true if the parameter name is supported, false otherwise
2015-12-14 04:53:50 +00:00
//! \details Some possible parameter names: EncodingParameters(), KeyDerivationParameters()
//! and others Parameters listed in argnames.h
2015-11-05 06:59:46 +00:00
virtual bool ParameterSupported ( const char * name ) const = 0 ;
2015-12-14 04:53:50 +00:00
//! \brief Provides the fixed ciphertext length, if one exists
2016-01-15 13:54:19 +00:00
//! \return the fixed ciphertext length if one exists, otherwise 0
2015-12-14 04:53:50 +00:00
//! \details "Fixed" here means length of ciphertext does not depend on length of plaintext.
//! In this case, it usually does depend on the key length.
2015-11-05 06:59:46 +00:00
virtual size_t FixedCiphertextLength ( ) const { return 0 ; }
2015-12-14 04:53:50 +00:00
//! \brief Provides the maximum plaintext length given a fixed ciphertext length
//! \return maximum plaintext length given the fixed ciphertext length, if one exists,
//! otherwise return 0.
//! \details FixedMaxPlaintextLength(0 returns the maximum plaintext length given the fixed ciphertext
//! length, if one exists, otherwise return 0.
2015-11-05 06:59:46 +00:00
virtual size_t FixedMaxPlaintextLength ( ) const { return 0 ; }
} ;
2015-11-23 00:17:15 +00:00
//! \class PK_Encryptor
2015-11-05 06:59:46 +00:00
//! \brief Interface for public-key encryptors
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_Encryptor : public PK_CryptoSystem , public PublicKeyAlgorithm
{
public :
2015-11-23 00:17:15 +00:00
//! \brief Exception thrown when trying to encrypt plaintext of invalid length
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL InvalidPlaintextLength : public Exception
{
public :
InvalidPlaintextLength ( ) : Exception ( OTHER_ERROR , " PK_Encryptor: invalid plaintext length " ) { }
} ;
2015-11-23 00:17:15 +00:00
//! \brief Encrypt a byte string
//! \param rng a RandomNumberGenerator derived class
//! \param plaintext the plaintext byte buffer
//! \param plaintextLength the size of the plaintext byte buffer
//! \param ciphertext a byte buffer to hold the encrypted string
2015-12-17 00:39:29 +00:00
//! \param parameters a set of NameValuePairs to initialize this object
2015-11-23 00:17:15 +00:00
//! \pre <tt>CiphertextLength(plaintextLength) != 0</tt> ensures the plaintext isn't too large
//! \pre <tt>COUNTOF(ciphertext) == CiphertextLength(plaintextLength)</tt> ensures the output
//! byte buffer is large enough.
//! \sa PK_Decryptor
2016-08-28 03:52:43 +00:00
virtual void Encrypt ( RandomNumberGenerator & rng ,
const byte * plaintext , size_t plaintextLength ,
2015-11-05 06:59:46 +00:00
byte * ciphertext , const NameValuePairs & parameters = g_nullNameValuePairs ) const = 0 ;
2015-11-23 00:17:15 +00:00
//! \brief Create a new encryption filter
2015-12-16 08:22:22 +00:00
//! \param rng a RandomNumberGenerator derived class
//! \param attachment an attached transformation
2015-12-17 00:39:29 +00:00
//! \param parameters a set of NameValuePairs to initialize this object
2015-12-16 08:22:22 +00:00
//! \details \p attachment can be \p NULL. The caller is responsible for deleting the returned pointer.
//! Encoding parameters should be passed in the "EP" channel.
virtual BufferedTransformation * CreateEncryptionFilter ( RandomNumberGenerator & rng ,
2017-03-01 11:10:06 +00:00
BufferedTransformation * attachment = NULLPTR , const NameValuePairs & parameters = g_nullNameValuePairs ) const ;
2015-11-05 06:59:46 +00:00
} ;
2015-11-23 00:17:15 +00:00
//! \class PK_Decryptor
2015-11-05 06:59:46 +00:00
//! \brief Interface for public-key decryptors
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_Decryptor : public PK_CryptoSystem , public PrivateKeyAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ PK_Decryptor ( ) { }
2015-11-23 00:17:15 +00:00
//! \brief Decrypt a byte string
//! \param rng a RandomNumberGenerator derived class
//! \param ciphertext the encrypted byte buffer
//! \param ciphertextLength the size of the encrypted byte buffer
//! \param plaintext a byte buffer to hold the decrypted string
2015-12-17 00:39:29 +00:00
//! \param parameters a set of NameValuePairs to initialize this object
2016-01-15 13:54:19 +00:00
//! \return the result of the decryption operation
2015-11-23 00:17:15 +00:00
//! \details If DecodingResult::isValidCoding is true, then DecodingResult::messageLength
2016-01-15 13:54:19 +00:00
//! is valid and holds the the actual length of the plaintext recovered. The result is undefined
//! if decryption failed. If DecodingResult::isValidCoding is false, then DecodingResult::messageLength
//! is undefined.
2016-01-17 03:28:23 +00:00
//! \pre <tt>COUNTOF(plaintext) == MaxPlaintextLength(ciphertextLength)</tt> ensures the output
//! byte buffer is large enough
2015-11-23 00:17:15 +00:00
//! \sa PK_Encryptor
2016-08-28 03:52:43 +00:00
virtual DecodingResult Decrypt ( RandomNumberGenerator & rng ,
const byte * ciphertext , size_t ciphertextLength ,
2015-11-05 06:59:46 +00:00
byte * plaintext , const NameValuePairs & parameters = g_nullNameValuePairs ) const = 0 ;
2016-01-15 13:54:19 +00:00
//! \brief Create a new decryption filter
//! \param rng a RandomNumberGenerator derived class
//! \param attachment an attached transformation
//! \param parameters a set of NameValuePairs to initialize this object
//! \return the newly created decryption filter
//! \note the caller is responsible for deleting the returned pointer
2016-08-28 03:52:43 +00:00
virtual BufferedTransformation * CreateDecryptionFilter ( RandomNumberGenerator & rng ,
2017-03-01 11:10:06 +00:00
BufferedTransformation * attachment = NULLPTR , const NameValuePairs & parameters = g_nullNameValuePairs ) const ;
2015-11-05 06:59:46 +00:00
2016-01-15 13:54:19 +00:00
//! \brief Decrypt a fixed size ciphertext
//! \param rng a RandomNumberGenerator derived class
//! \param ciphertext the encrypted byte buffer
//! \param plaintext a byte buffer to hold the decrypted string
//! \param parameters a set of NameValuePairs to initialize this object
//! \return the result of the decryption operation
//! \details If DecodingResult::isValidCoding is true, then DecodingResult::messageLength
//! is valid and holds the the actual length of the plaintext recovered. The result is undefined
//! if decryption failed. If DecodingResult::isValidCoding is false, then DecodingResult::messageLength
//! is undefined.
2016-01-17 03:28:23 +00:00
//! \pre <tt>COUNTOF(plaintext) == MaxPlaintextLength(ciphertextLength)</tt> ensures the output
//! byte buffer is large enough
2016-01-15 13:54:19 +00:00
//! \sa PK_Encryptor
2015-11-05 06:59:46 +00:00
DecodingResult FixedLengthDecrypt ( RandomNumberGenerator & rng , const byte * ciphertext , byte * plaintext , const NameValuePairs & parameters = g_nullNameValuePairs ) const
{ return Decrypt ( rng , ciphertext , FixedCiphertextLength ( ) , plaintext , parameters ) ; }
} ;
2015-12-14 20:50:56 +00:00
//! \class PK_SignatureScheme
2015-11-05 06:59:46 +00:00
//! \brief Interface for public-key signers and verifiers
2015-12-14 20:50:56 +00:00
//! \details This class provides an interface common to signers and verifiers for querying scheme properties
2016-12-11 06:02:00 +00:00
//! \sa DL_SignatureSchemeBase, TF_SignatureSchemeBase, DL_SignerBase, TF_SignerBase
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_SignatureScheme
{
public :
2015-12-14 20:50:56 +00:00
//! \class InvalidKeyLength
//! \brief Exception throw when the private or public key has a length that can't be used
//! \details InvalidKeyLength() may be thrown by any function in this class if the private
//! or public key has a length that can't be used
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL InvalidKeyLength : public Exception
{
public :
InvalidKeyLength ( const std : : string & message ) : Exception ( OTHER_ERROR , message ) { }
} ;
2015-12-14 20:50:56 +00:00
//! \class KeyTooShort
//! \brief Exception throw when the private or public key is too short to sign or verify
//! \details KeyTooShort() may be thrown by any function in this class if the private or public
//! key is too short to sign or verify anything
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL KeyTooShort : public InvalidKeyLength
{
public :
KeyTooShort ( ) : InvalidKeyLength ( " PK_Signer: key too short for this signature scheme " ) { }
} ;
virtual ~ PK_SignatureScheme ( ) { }
2015-12-14 20:50:56 +00:00
//! \brief Provides the signature length if it only depends on the key
2016-01-15 13:54:19 +00:00
//! \return the signature length if it only depends on the key, in bytes
2015-12-14 20:50:56 +00:00
//! \details SignatureLength() returns the signature length if it only depends on the key, otherwise 0.
2015-11-05 06:59:46 +00:00
virtual size_t SignatureLength ( ) const = 0 ;
2015-12-14 20:50:56 +00:00
//! \brief Provides the maximum signature length produced given the length of the recoverable message part
//! \param recoverablePartLength the length of the recoverable message part, in bytes
2016-01-15 13:54:19 +00:00
//! \return the maximum signature length produced for a given length of recoverable message part, in bytes
2015-12-14 20:50:56 +00:00
//! \details MaxSignatureLength() returns the maximum signature length produced given the length of the
//! recoverable message part.
2015-11-05 06:59:46 +00:00
virtual size_t MaxSignatureLength ( size_t recoverablePartLength = 0 ) const
{ CRYPTOPP_UNUSED ( recoverablePartLength ) ; return SignatureLength ( ) ; }
2015-12-14 20:50:56 +00:00
//! \brief Provides the length of longest message that can be recovered
2016-01-15 13:54:19 +00:00
//! \return the length of longest message that can be recovered, in bytes
2015-12-14 20:50:56 +00:00
//! \details MaxRecoverableLength() returns the length of longest message that can be recovered, or 0 if
//! this signature scheme does not support message recovery.
2015-11-05 06:59:46 +00:00
virtual size_t MaxRecoverableLength ( ) const = 0 ;
2015-12-14 20:50:56 +00:00
//! \brief Provides the length of longest message that can be recovered from a signature of given length
//! \param signatureLength the length of the signature, in bytes
2016-01-15 13:54:19 +00:00
//! \return the length of longest message that can be recovered from a signature of given length, in bytes
2015-12-14 20:50:56 +00:00
//! \details MaxRecoverableLengthFromSignatureLength() returns the length of longest message that can be
//! recovered from a signature of given length, or 0 if this signature scheme does not support message
//! recovery.
2015-11-05 06:59:46 +00:00
virtual size_t MaxRecoverableLengthFromSignatureLength ( size_t signatureLength ) const = 0 ;
2015-12-14 20:50:56 +00:00
//! \brief Determines whether a signature scheme requires a random number generator
2016-01-15 13:54:19 +00:00
//! \return true if the signature scheme requires a RandomNumberGenerator() to sign
2015-12-14 20:50:56 +00:00
//! \details if IsProbabilistic() returns false, then NullRNG() can be passed to functions that take
//! RandomNumberGenerator().
2015-11-05 06:59:46 +00:00
virtual bool IsProbabilistic ( ) const = 0 ;
2015-12-14 20:50:56 +00:00
//! \brief Determines whether the non-recoverable message part can be signed
2016-01-15 13:54:19 +00:00
//! \return true if the non-recoverable message part can be signed
2015-11-05 06:59:46 +00:00
virtual bool AllowNonrecoverablePart ( ) const = 0 ;
2015-12-14 20:50:56 +00:00
//! \brief Determines whether the signature must be input before the message
2016-01-15 13:54:19 +00:00
//! \return true if the signature must be input before the message during verifcation
2015-12-14 20:50:56 +00:00
//! \details if SignatureUpfront() returns true, then you must input the signature before the message
//! during verification. Otherwise you can input the signature at anytime.
2015-11-05 06:59:46 +00:00
virtual bool SignatureUpfront ( ) const { return false ; }
2015-12-14 20:50:56 +00:00
//! \brief Determines whether the recoverable part must be input before the non-recoverable part
2016-01-15 13:54:19 +00:00
//! \return true if the recoverable part must be input before the non-recoverable part during signing
2015-12-14 20:50:56 +00:00
//! \details RecoverablePartFirst() determines whether you must input the recoverable part before the
//! non-recoverable part during signing
2015-11-05 06:59:46 +00:00
virtual bool RecoverablePartFirst ( ) const = 0 ;
} ;
2015-12-14 20:50:56 +00:00
//! \class PK_MessageAccumulator
2015-11-05 06:59:46 +00:00
//! \brief Interface for accumulating messages to be signed or verified
2015-12-14 20:50:56 +00:00
//! \details Only Update() should be called from the PK_MessageAccumulator() class. No other functions
//! inherited from HashTransformation, like DigestSize() and TruncatedFinal(), should be called.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_MessageAccumulator : public HashTransformation
{
public :
2016-01-15 13:54:19 +00:00
//! \warning DigestSize() should not be called on PK_MessageAccumulator
2015-11-05 06:59:46 +00:00
unsigned int DigestSize ( ) const
{ throw NotImplemented ( " PK_MessageAccumulator: DigestSize() should not be called " ) ; }
2016-01-15 13:54:19 +00:00
//! \warning TruncatedFinal() should not be called on PK_MessageAccumulator
2016-08-28 03:52:43 +00:00
void TruncatedFinal ( byte * digest , size_t digestSize )
2015-11-05 06:59:46 +00:00
{
CRYPTOPP_UNUSED ( digest ) ; CRYPTOPP_UNUSED ( digestSize ) ;
throw NotImplemented ( " PK_MessageAccumulator: TruncatedFinal() should not be called " ) ;
}
} ;
2015-12-14 20:50:56 +00:00
//! \class PK_Signer
2015-11-05 06:59:46 +00:00
//! \brief Interface for public-key signers
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_Signer : public PK_SignatureScheme , public PrivateKeyAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ PK_Signer ( ) { }
2015-12-14 20:50:56 +00:00
//! \brief Create a new HashTransformation to accumulate the message to be signed
//! \param rng a RandomNumberGenerator derived class
2016-01-15 13:54:19 +00:00
//! \return a pointer to a PK_MessageAccumulator
2015-12-14 20:50:56 +00:00
//! \details NewSignatureAccumulator() can be used with all signing methods. Sign() will autimatically delete the
2016-01-17 05:18:26 +00:00
//! accumulator pointer. The caller is responsible for deletion if a method is called that takes a reference.
2015-11-05 06:59:46 +00:00
virtual PK_MessageAccumulator * NewSignatureAccumulator ( RandomNumberGenerator & rng ) const = 0 ;
2015-12-14 20:50:56 +00:00
//! \brief Input a recoverable message to an accumulator
//! \param messageAccumulator a reference to a PK_MessageAccumulator
//! \param recoverableMessage a pointer to the recoverable message part to be signed
//! \param recoverableMessageLength the size of the recoverable message part
2015-11-05 06:59:46 +00:00
virtual void InputRecoverableMessage ( PK_MessageAccumulator & messageAccumulator , const byte * recoverableMessage , size_t recoverableMessageLength ) const = 0 ;
2015-12-14 20:50:56 +00:00
//! \brief Sign and delete the messageAccumulator
//! \param rng a RandomNumberGenerator derived class
//! \param messageAccumulator a pointer to a PK_MessageAccumulator derived class
//! \param signature a block of bytes for the signature
2016-01-15 13:54:19 +00:00
//! \return actual signature length
2015-12-14 20:50:56 +00:00
//! \details Sign() deletes the messageAccumulator, even if an exception is thrown.
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(signature) == MaxSignatureLength()</tt>
2015-11-05 06:59:46 +00:00
virtual size_t Sign ( RandomNumberGenerator & rng , PK_MessageAccumulator * messageAccumulator , byte * signature ) const ;
2015-12-14 20:50:56 +00:00
//! \brief Sign and restart messageAccumulator
//! \param rng a RandomNumberGenerator derived class
//! \param messageAccumulator a pointer to a PK_MessageAccumulator derived class
//! \param signature a block of bytes for the signature
//! \param restart flag indicating whether the messageAccumulator should be restarted
2016-01-15 13:54:19 +00:00
//! \return actual signature length
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(signature) == MaxSignatureLength()</tt>
2015-11-05 06:59:46 +00:00
virtual size_t SignAndRestart ( RandomNumberGenerator & rng , PK_MessageAccumulator & messageAccumulator , byte * signature , bool restart = true ) const = 0 ;
2015-12-14 20:50:56 +00:00
//! \brief Sign a message
//! \param rng a RandomNumberGenerator derived class
//! \param message a pointer to the message
//! \param messageLen the size of the message to be signed
//! \param signature a block of bytes for the signature
2016-01-15 13:54:19 +00:00
//! \return actual signature length
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(signature) == MaxSignatureLength()</tt>
2015-11-05 06:59:46 +00:00
virtual size_t SignMessage ( RandomNumberGenerator & rng , const byte * message , size_t messageLen , byte * signature ) const ;
2015-12-14 20:50:56 +00:00
//! \brief Sign a recoverable message
//! \param rng a RandomNumberGenerator derived class
//! \param recoverableMessage a pointer to the recoverable message part to be signed
//! \param recoverableMessageLength the size of the recoverable message part
//! \param nonrecoverableMessage a pointer to the non-recoverable message part to be signed
//! \param nonrecoverableMessageLength the size of the non-recoverable message part
//! \param signature a block of bytes for the signature
2016-01-15 13:54:19 +00:00
//! \return actual signature length
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(signature) == MaxSignatureLength(recoverableMessageLength)</tt>
2016-08-28 03:52:43 +00:00
virtual size_t SignMessageWithRecovery ( RandomNumberGenerator & rng , const byte * recoverableMessage , size_t recoverableMessageLength ,
2015-11-05 06:59:46 +00:00
const byte * nonrecoverableMessage , size_t nonrecoverableMessageLength , byte * signature ) const ;
} ;
2015-12-14 20:50:56 +00:00
//! \class PK_Verifier
2015-11-05 06:59:46 +00:00
//! \brief Interface for public-key signature verifiers
2015-12-14 20:50:56 +00:00
//! \details The Recover* functions throw NotImplemented if the signature scheme does not support
//! message recovery.
//! \details The Verify* functions throw InvalidDataFormat if the scheme does support message
//! recovery and the signature contains a non-empty recoverable message part. The
2016-01-17 05:18:26 +00:00
//! Recover* functions should be used in that case.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE PK_Verifier : public PK_SignatureScheme , public PublicKeyAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ PK_Verifier ( ) { }
2016-01-17 05:18:26 +00:00
//! \brief Create a new HashTransformation to accumulate the message to be verified
2016-01-17 17:48:28 +00:00
//! \return a pointer to a PK_MessageAccumulator
2016-01-17 05:18:26 +00:00
//! \details NewVerificationAccumulator() can be used with all verification methods. Verify() will autimatically delete
//! the accumulator pointer. The caller is responsible for deletion if a method is called that takes a reference.
2015-11-05 06:59:46 +00:00
virtual PK_MessageAccumulator * NewVerificationAccumulator ( ) const = 0 ;
2016-01-17 05:18:26 +00:00
//! \brief Input signature into a message accumulator
//! \param messageAccumulator a pointer to a PK_MessageAccumulator derived class
//! \param signature the signature on the message
//! \param signatureLength the size of the signature
2015-11-05 06:59:46 +00:00
virtual void InputSignature ( PK_MessageAccumulator & messageAccumulator , const byte * signature , size_t signatureLength ) const = 0 ;
2016-01-17 05:18:26 +00:00
//! \brief Check whether messageAccumulator contains a valid signature and message
//! \param messageAccumulator a pointer to a PK_MessageAccumulator derived class
2016-01-17 17:48:28 +00:00
//! \return true if the signature is valid, false otherwise
2016-01-17 05:18:26 +00:00
//! \details Verify() deletes the messageAccumulator, even if an exception is thrown.
2015-11-05 06:59:46 +00:00
virtual bool Verify ( PK_MessageAccumulator * messageAccumulator ) const ;
2016-01-17 05:18:26 +00:00
//! \brief Check whether messageAccumulator contains a valid signature and message, and restart messageAccumulator
//! \param messageAccumulator a reference to a PK_MessageAccumulator derived class
//! \return true if the signature is valid, false otherwise
2016-08-28 03:52:43 +00:00
//! \details VerifyAndRestart() restarts the messageAccumulator
2015-11-05 06:59:46 +00:00
virtual bool VerifyAndRestart ( PK_MessageAccumulator & messageAccumulator ) const = 0 ;
2016-01-17 05:18:26 +00:00
//! \brief Check whether input signature is a valid signature for input message
//! \param message a pointer to the message to be verified
//! \param messageLen the size of the message
//! \param signature a pointer to the signature over the message
//! \param signatureLen the size of the signature
//! \return true if the signature is valid, false otherwise
2016-08-28 03:52:43 +00:00
virtual bool VerifyMessage ( const byte * message , size_t messageLen ,
2016-01-17 05:18:26 +00:00
const byte * signature , size_t signatureLen ) const ;
2015-11-05 06:59:46 +00:00
2016-01-17 05:18:26 +00:00
//! \brief Recover a message from its signature
//! \param recoveredMessage a pointer to the recoverable message part to be verified
//! \param messageAccumulator a pointer to a PK_MessageAccumulator derived class
//! \return the result of the verification operation
//! \details Recover() deletes the messageAccumulator, even if an exception is thrown.
//! \pre <tt>COUNTOF(recoveredMessage) == MaxRecoverableLengthFromSignatureLength(signatureLength)</tt>
2015-11-05 06:59:46 +00:00
virtual DecodingResult Recover ( byte * recoveredMessage , PK_MessageAccumulator * messageAccumulator ) const ;
2016-01-17 05:18:26 +00:00
//! \brief Recover a message from its signature
//! \param recoveredMessage a pointer to the recoverable message part to be verified
//! \param messageAccumulator a pointer to a PK_MessageAccumulator derived class
//! \return the result of the verification operation
//! \details RecoverAndRestart() restarts the messageAccumulator
//! \pre <tt>COUNTOF(recoveredMessage) == MaxRecoverableLengthFromSignatureLength(signatureLength)</tt>
2015-11-05 06:59:46 +00:00
virtual DecodingResult RecoverAndRestart ( byte * recoveredMessage , PK_MessageAccumulator & messageAccumulator ) const = 0 ;
2016-01-17 05:18:26 +00:00
//! \brief Recover a message from its signature
//! \param recoveredMessage a pointer for the recovered message
//! \param nonrecoverableMessage a pointer to the non-recoverable message part to be signed
//! \param nonrecoverableMessageLength the size of the non-recoverable message part
//! \param signature the signature on the message
//! \param signatureLength the size of the signature
//! \return the result of the verification operation
//! \pre <tt>COUNTOF(recoveredMessage) == MaxRecoverableLengthFromSignatureLength(signatureLength)</tt>
2016-08-28 03:52:43 +00:00
virtual DecodingResult RecoverMessage ( byte * recoveredMessage ,
2016-01-17 05:18:26 +00:00
const byte * nonrecoverableMessage , size_t nonrecoverableMessageLength ,
2015-11-05 06:59:46 +00:00
const byte * signature , size_t signatureLength ) const ;
} ;
2015-12-14 20:50:56 +00:00
//! \class SimpleKeyAgreementDomain
2015-11-05 06:59:46 +00:00
//! \brief Interface for domains of simple key agreement protocols
2015-12-14 20:50:56 +00:00
//! \details A key agreement domain is a set of parameters that must be shared
//! by two parties in a key agreement protocol, along with the algorithms
//! for generating key pairs and deriving agreed values.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE SimpleKeyAgreementDomain : public KeyAgreementAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ SimpleKeyAgreementDomain ( ) { }
2016-01-17 03:28:23 +00:00
//! \brief Provides the size of the agreed value
2017-03-17 22:31:40 +00:00
//! \return size of agreed value produced in this domain
2015-11-05 06:59:46 +00:00
virtual unsigned int AgreedValueLength ( ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Provides the size of the private key
//! \return size of private keys in this domain
2015-11-05 06:59:46 +00:00
virtual unsigned int PrivateKeyLength ( ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Provides the size of the public key
//! \return size of public keys in this domain
2015-11-05 06:59:46 +00:00
virtual unsigned int PublicKeyLength ( ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Generate private key in this domain
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer for the generated private key in this domain
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(privateKey) == PrivateKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual void GeneratePrivateKey ( RandomNumberGenerator & rng , byte * privateKey ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Generate a public key from a private key in this domain
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer with the previously generated private key
//! \param publicKey a byte buffer for the generated public key in this domain
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(publicKey) == PublicKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual void GeneratePublicKey ( RandomNumberGenerator & rng , const byte * privateKey , byte * publicKey ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Generate a private/public key pair
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer for the generated private key in this domain
//! \param publicKey a byte buffer for the generated public key in this domain
//! \details GenerateKeyPair() is equivalent to calling GeneratePrivateKey() and then GeneratePublicKey().
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(privateKey) == PrivateKeyLength()</tt>
//! \pre <tt>COUNTOF(publicKey) == PublicKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual void GenerateKeyPair ( RandomNumberGenerator & rng , byte * privateKey , byte * publicKey ) const ;
2016-01-17 03:28:23 +00:00
//! \brief Derive agreed value
//! \param agreedValue a byte buffer for the shared secret
//! \param privateKey a byte buffer with your private key in this domain
//! \param otherPublicKey a byte buffer with the other party's public key in this domain
//! \param validateOtherPublicKey a flag indicating if the other party's public key should be validated
//! \return true upon success, false in case of failure
//! \details Agree() derives an agreed value from your private keys and couterparty's public keys.
//! \details The other party's public key is validated by default. If you have previously validated the
//! static public key, use <tt>validateStaticOtherPublicKey=false</tt> to save time.
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(agreedValue) == AgreedValueLength()</tt>
//! \pre <tt>COUNTOF(privateKey) == PrivateKeyLength()</tt>
//! \pre <tt>COUNTOF(otherPublicKey) == PublicKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual bool Agree ( byte * agreedValue , const byte * privateKey , const byte * otherPublicKey , bool validateOtherPublicKey = true ) const = 0 ;
} ;
//! \brief Interface for domains of authenticated key agreement protocols
2016-01-17 03:28:23 +00:00
//! \details In an authenticated key agreement protocol, each party has two
//! key pairs. The long-lived key pair is called the static key pair,
//! and the short-lived key pair is called the ephemeral key pair.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE AuthenticatedKeyAgreementDomain : public KeyAgreementAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ AuthenticatedKeyAgreementDomain ( ) { }
2016-01-17 03:28:23 +00:00
//! \brief Provides the size of the agreed value
2017-03-17 22:31:40 +00:00
//! \return size of agreed value produced in this domain
2015-11-05 06:59:46 +00:00
virtual unsigned int AgreedValueLength ( ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Provides the size of the static private key
//! \return size of static private keys in this domain
2015-11-05 06:59:46 +00:00
virtual unsigned int StaticPrivateKeyLength ( ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Provides the size of the static public key
//! \return size of static public keys in this domain
2015-11-05 06:59:46 +00:00
virtual unsigned int StaticPublicKeyLength ( ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Generate static private key in this domain
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer for the generated private key in this domain
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(privateKey) == PrivateStaticKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual void GenerateStaticPrivateKey ( RandomNumberGenerator & rng , byte * privateKey ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Generate a static public key from a private key in this domain
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer with the previously generated private key
//! \param publicKey a byte buffer for the generated public key in this domain
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(publicKey) == PublicStaticKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual void GenerateStaticPublicKey ( RandomNumberGenerator & rng , const byte * privateKey , byte * publicKey ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Generate a static private/public key pair
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer for the generated private key in this domain
//! \param publicKey a byte buffer for the generated public key in this domain
//! \details GenerateStaticKeyPair() is equivalent to calling GenerateStaticPrivateKey() and then GenerateStaticPublicKey().
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(privateKey) == PrivateStaticKeyLength()</tt>
//! \pre <tt>COUNTOF(publicKey) == PublicStaticKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual void GenerateStaticKeyPair ( RandomNumberGenerator & rng , byte * privateKey , byte * publicKey ) const ;
2016-01-17 03:28:23 +00:00
//! \brief Provides the size of ephemeral private key
//! \return the size of ephemeral private key in this domain
2015-11-05 06:59:46 +00:00
virtual unsigned int EphemeralPrivateKeyLength ( ) const = 0 ;
2016-01-17 03:28:23 +00:00
//! \brief Provides the size of ephemeral public key
//! \return the size of ephemeral public key in this domain
2015-11-05 06:59:46 +00:00
virtual unsigned int EphemeralPublicKeyLength ( ) const = 0 ;
2016-01-17 03:28:23 +00:00
2015-11-23 00:17:15 +00:00
//! \brief Generate ephemeral private key
2016-01-17 03:28:23 +00:00
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer for the generated private key in this domain
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(privateKey) == PrivateEphemeralKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual void GenerateEphemeralPrivateKey ( RandomNumberGenerator & rng , byte * privateKey ) const = 0 ;
2016-01-17 03:28:23 +00:00
2015-11-23 00:17:15 +00:00
//! \brief Generate ephemeral public key
2016-01-17 03:28:23 +00:00
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer for the generated private key in this domain
//! \param publicKey a byte buffer for the generated public key in this domain
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(publicKey) == PublicEphemeralKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual void GenerateEphemeralPublicKey ( RandomNumberGenerator & rng , const byte * privateKey , byte * publicKey ) const = 0 ;
2016-01-17 03:28:23 +00:00
2015-11-23 00:17:15 +00:00
//! \brief Generate private/public key pair
2016-01-17 03:28:23 +00:00
//! \param rng a RandomNumberGenerator derived class
//! \param privateKey a byte buffer for the generated private key in this domain
//! \param publicKey a byte buffer for the generated public key in this domain
//! \details GenerateEphemeralKeyPair() is equivalent to calling GenerateEphemeralPrivateKey() and then GenerateEphemeralPublicKey()
2015-11-05 06:59:46 +00:00
virtual void GenerateEphemeralKeyPair ( RandomNumberGenerator & rng , byte * privateKey , byte * publicKey ) const ;
2015-11-23 00:17:15 +00:00
//! \brief Derive agreed value
2016-01-17 03:28:23 +00:00
//! \param agreedValue a byte buffer for the shared secret
//! \param staticPrivateKey a byte buffer with your static private key in this domain
//! \param ephemeralPrivateKey a byte buffer with your ephemeral private key in this domain
//! \param staticOtherPublicKey a byte buffer with the other party's static public key in this domain
//! \param ephemeralOtherPublicKey a byte buffer with the other party's ephemeral public key in this domain
//! \param validateStaticOtherPublicKey a flag indicating if the other party's public key should be validated
2016-01-15 13:54:19 +00:00
//! \return true upon success, false in case of failure
2016-01-17 03:28:23 +00:00
//! \details Agree() derives an agreed value from your private keys and couterparty's public keys.
//! \details The other party's ephemeral public key is validated by default. If you have previously validated
//! the static public key, use <tt>validateStaticOtherPublicKey=false</tt> to save time.
2016-01-17 05:18:26 +00:00
//! \pre <tt>COUNTOF(agreedValue) == AgreedValueLength()</tt>
//! \pre <tt>COUNTOF(staticPrivateKey) == StaticPrivateKeyLength()</tt>
//! \pre <tt>COUNTOF(ephemeralPrivateKey) == EphemeralPrivateKeyLength()</tt>
//! \pre <tt>COUNTOF(staticOtherPublicKey) == StaticPublicKeyLength()</tt>
//! \pre <tt>COUNTOF(ephemeralOtherPublicKey) == EphemeralPublicKeyLength()</tt>
2015-11-05 06:59:46 +00:00
virtual bool Agree ( byte * agreedValue ,
const byte * staticPrivateKey , const byte * ephemeralPrivateKey ,
const byte * staticOtherPublicKey , const byte * ephemeralOtherPublicKey ,
bool validateStaticOtherPublicKey = true ) const = 0 ;
} ;
// interface for password authenticated key agreement protocols, not implemented yet
#if 0
//! \brief Interface for protocol sessions
/*! The methods should be called in the following order:
InitializeSession ( rng , parameters ) ; // or call initialize method in derived class
while ( true )
{
if ( OutgoingMessageAvailable ( ) )
{
length = GetOutgoingMessageLength ( ) ;
GetOutgoingMessage ( message ) ;
; // send outgoing message
}
if ( LastMessageProcessed ( ) )
break ;
; // receive incoming message
ProcessIncomingMessage ( message ) ;
}
; // call methods in derived class to obtain result of protocol session
*/
class ProtocolSession
{
public :
2016-01-15 13:54:19 +00:00
//! Exception thrown when an invalid protocol message is processed
2015-11-05 06:59:46 +00:00
class ProtocolError : public Exception
{
public :
ProtocolError ( ErrorType errorType , const std : : string & s ) : Exception ( errorType , s ) { }
} ;
2016-01-15 13:54:19 +00:00
//! Exception thrown when a function is called unexpectedly
2015-11-05 06:59:46 +00:00
/*! for example calling ProcessIncomingMessage() when ProcessedLastMessage() == true */
class UnexpectedMethodCall : public Exception
{
public :
UnexpectedMethodCall ( const std : : string & s ) : Exception ( OTHER_ERROR , s ) { }
} ;
virtual ~ ProtocolSession ( ) { }
2017-03-01 11:10:06 +00:00
ProtocolSession ( ) : m_rng ( NULLPTR ) , m_throwOnProtocolError ( true ) , m_validState ( false ) { }
2016-12-03 05:32:07 +00:00
2015-11-05 06:59:46 +00:00
virtual void InitializeSession ( RandomNumberGenerator & rng , const NameValuePairs & parameters ) = 0 ;
bool GetThrowOnProtocolError ( ) const { return m_throwOnProtocolError ; }
void SetThrowOnProtocolError ( bool throwOnProtocolError ) { m_throwOnProtocolError = throwOnProtocolError ; }
bool HasValidState ( ) const { return m_validState ; }
virtual bool OutgoingMessageAvailable ( ) const = 0 ;
virtual unsigned int GetOutgoingMessageLength ( ) const = 0 ;
virtual void GetOutgoingMessage ( byte * message ) = 0 ;
virtual bool LastMessageProcessed ( ) const = 0 ;
virtual void ProcessIncomingMessage ( const byte * message , unsigned int messageLength ) = 0 ;
protected :
void HandleProtocolError ( Exception : : ErrorType errorType , const std : : string & s ) const ;
void CheckAndHandleInvalidState ( ) const ;
void SetValidState ( bool valid ) { m_validState = valid ; }
RandomNumberGenerator * m_rng ;
private :
bool m_throwOnProtocolError , m_validState ;
} ;
class KeyAgreementSession : public ProtocolSession
{
public :
virtual ~ KeyAgreementSession ( ) { }
2016-02-29 16:22:11 +00:00
virtual unsigned int GetAgreedValueLength ( ) const = 0 ;
virtual void GetAgreedValue ( byte * agreedValue ) const = 0 ;
2015-11-05 06:59:46 +00:00
} ;
class PasswordAuthenticatedKeyAgreementSession : public KeyAgreementSession
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ PasswordAuthenticatedKeyAgreementSession ( ) { }
2016-08-28 03:52:43 +00:00
void InitializePasswordAuthenticatedKeyAgreementSession ( RandomNumberGenerator & rng ,
const byte * myId , unsigned int myIdLength ,
const byte * counterPartyId , unsigned int counterPartyIdLength ,
2015-11-05 06:59:46 +00:00
const byte * passwordOrVerifier , unsigned int passwordOrVerifierLength ) ;
} ;
class PasswordAuthenticatedKeyAgreementDomain : public KeyAgreementAlgorithm
{
public :
2016-02-29 16:22:11 +00:00
virtual ~ PasswordAuthenticatedKeyAgreementDomain ( ) { }
2015-11-05 06:59:46 +00:00
//! return whether the domain parameters stored in this object are valid
virtual bool ValidateDomainParameters ( RandomNumberGenerator & rng ) const
{ return GetCryptoParameters ( ) . Validate ( rng , 2 ) ; }
virtual unsigned int GetPasswordVerifierLength ( const byte * password , unsigned int passwordLength ) const = 0 ;
virtual void GeneratePasswordVerifier ( RandomNumberGenerator & rng , const byte * userId , unsigned int userIdLength , const byte * password , unsigned int passwordLength , byte * verifier ) const = 0 ;
enum RoleFlags { CLIENT = 1 , SERVER = 2 , INITIATOR = 4 , RESPONDER = 8 } ;
virtual bool IsValidRole ( unsigned int role ) = 0 ;
virtual PasswordAuthenticatedKeyAgreementSession * CreateProtocolSession ( unsigned int role ) const = 0 ;
} ;
# endif
2016-01-17 05:18:26 +00:00
//! \brief Exception thrown when an ASN.1 BER decoing error is encountered
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL BERDecodeErr : public InvalidArgument
{
2016-08-28 03:52:43 +00:00
public :
2015-11-05 06:59:46 +00:00
BERDecodeErr ( ) : InvalidArgument ( " BER decode error " ) { }
BERDecodeErr ( const std : : string & s ) : InvalidArgument ( s ) { }
} ;
//! \brief Interface for encoding and decoding ASN1 objects
2015-11-18 20:32:28 +00:00
//! \details Each class that derives from ASN1Object should provide a serialization format
//! that controls subobject layout. Most of the time the serialization format is
//! taken from a standard, like P1363 or an RFC.
2015-11-05 06:59:46 +00:00
class CRYPTOPP_DLL CRYPTOPP_NO_VTABLE ASN1Object
{
public :
virtual ~ ASN1Object ( ) { }
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Decode this object from a BufferedTransformation
//! \param bt BufferedTransformation object
//! \details Uses Basic Encoding Rules (BER)
2015-11-05 06:59:46 +00:00
virtual void BERDecode ( BufferedTransformation & bt ) = 0 ;
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Encode this object into a BufferedTransformation
//! \param bt BufferedTransformation object
//! \details Uses Distinguished Encoding Rules (DER)
2015-11-05 06:59:46 +00:00
virtual void DEREncode ( BufferedTransformation & bt ) const = 0 ;
2016-08-28 03:52:43 +00:00
2015-11-18 20:32:28 +00:00
//! \brief Encode this object into a BufferedTransformation
//! \param bt BufferedTransformation object
//! \details Uses Basic Encoding Rules (BER).
//! \details This may be useful if DEREncode() would be too inefficient.
2015-11-05 06:59:46 +00:00
virtual void BEREncode ( BufferedTransformation & bt ) const { DEREncode ( bt ) ; }
} ;
2017-01-28 10:43:24 +00:00
//! \brief Specifies the build-time version of the library
//! \returns integer representing the build-time version
2017-01-28 12:09:27 +00:00
//! \details LibraryVersion can help detect inadvertent mixing and matching of library
//! versions. When using Crypto++ distributed by a third party, LibraryVersion()
2017-01-28 10:43:24 +00:00
//! records the version of the shared object that was built by the third party.
2017-01-28 12:09:27 +00:00
//! The LibraryVersion() record resides in <tt>cryptlib.o</tt> on Unix compatibles
2017-01-28 10:43:24 +00:00
//! and <tt>cryptlib.obj</tt> on Windows. It does not change when an app links
//! to the library.
2017-01-28 12:09:27 +00:00
//! \details LibraryVersion() is declared with C linkage (<tt>extern "C"</tt>) within the
2017-01-28 10:43:24 +00:00
//! CryptoPP namespace to help programs locate the symbol. If the symbol is present, then
//! the library version is 5.7 or above. If it is missing, then the library version is
//! 5.6.5 or below.
//! \details The function could be used as shown below.
//! <pre>
2017-01-28 12:09:27 +00:00
//! if (LibraryVersion() != HeaderVersion())
2017-01-28 10:43:24 +00:00
//! {
//! cout << "Potential version mismatch" << endl;
//!
2017-01-28 12:09:27 +00:00
//! const int lmaj = (LibraryVersion() / 100U) % 10;
//! const int lmin = (LibraryVersion() / 10U) % 10;
//! const int hmaj = (HeaderVersion() / 100U) % 10;
//! const int hmin = (HeaderVersion() / 10U) % 10;
2017-01-28 10:43:24 +00:00
//!
2017-01-28 12:09:27 +00:00
//! if(lmaj != hmaj)
2017-01-28 10:43:24 +00:00
//! cout << "Major version mismatch" << endl;
2017-01-28 12:09:27 +00:00
//! else if(lmin != hmin)
2017-01-28 10:43:24 +00:00
//! cout << "Minor version mismatch" << endl;
//! }
//! </pre>
2017-01-28 12:09:27 +00:00
//! \sa HeaderVersion(), <A HREF="http://github.com/weidai11/cryptopp/issues/371">GitHub Issue 371</A>.
2017-02-21 17:59:20 +00:00
//! \since Crypto++ 6.0
2017-01-28 10:43:24 +00:00
extern " C " {
2017-03-14 14:26:51 +00:00
int LibraryVersion ( CRYPTOPP_NOINLINE_DOTDOTDOT ) ;
2017-01-28 10:43:24 +00:00
} // C linkage
//! \brief Specifies the runtime version of the library
//! \returns integer representing the runtime version
2017-01-28 12:09:27 +00:00
//! \details HeaderVersion() can help detect inadvertent mixing and matching of library
//! versions. When using Crypto++ distributed by a third party, HeaderVersion()
2017-01-28 10:43:24 +00:00
//! records the version of the headers used by the app when the app is compiled.
2017-01-28 12:09:27 +00:00
//! \details HeaderVersion() is declared with C linkage (<tt>extern "C"</tt>) within the
2017-01-28 10:43:24 +00:00
//! CryptoPP namespace to help programs locate the symbol. If the symbol is present, then
//! the library version is 5.7 or above. If it is missing, then the library version is
//! 5.6.5 or below.
//! \details The function could be used as shown below.
//! <pre>
2017-01-28 12:09:27 +00:00
//! if (LibraryVersion() != HeaderVersion())
2017-01-28 10:43:24 +00:00
//! {
//! cout << "Potential version mismatch" << endl;
//!
2017-01-28 12:09:27 +00:00
//! const int lmaj = (LibraryVersion() / 100U) % 10;
//! const int lmin = (LibraryVersion() / 10U) % 10;
//! const int hmaj = (HeaderVersion() / 100U) % 10;
//! const int hmin = (HeaderVersion() / 10U) % 10;
2017-01-28 10:43:24 +00:00
//!
2017-01-28 12:09:27 +00:00
//! if(lmaj != hmaj)
2017-01-28 10:43:24 +00:00
//! cout << "Major version mismatch" << endl;
2017-01-28 12:09:27 +00:00
//! else if(lmin != hmin)
2017-01-28 10:43:24 +00:00
//! cout << "Minor version mismatch" << endl;
//! }
//! </pre>
2017-01-28 12:09:27 +00:00
//! \sa LibraryVersion(), <A HREF="http://github.com/weidai11/cryptopp/issues/371">GitHub Issue 371</A>.
2017-02-21 17:59:20 +00:00
//! \since Crypto++ 6.0
2017-01-28 10:43:24 +00:00
extern " C " {
2017-01-28 12:09:27 +00:00
inline int HeaderVersion ( )
2017-01-28 10:43:24 +00:00
{
return CRYPTOPP_VERSION ;
}
} // C linkage
2015-11-05 06:59:46 +00:00
NAMESPACE_END
# if CRYPTOPP_MSC_VERSION
# pragma warning(pop)
# endif
# endif