## File: blumshub.h

package info (click to toggle)
libcrypto++ 8.2.0-2
 `12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758` ``````// blumshub.h - originally written and placed in the public domain by Wei Dai /// \file blumshub.h /// \brief Classes for Blum Blum Shub generator #ifndef CRYPTOPP_BLUMSHUB_H #define CRYPTOPP_BLUMSHUB_H #include "cryptlib.h" #include "modarith.h" #include "integer.h" NAMESPACE_BEGIN(CryptoPP) /// BlumBlumShub without factorization of the modulus class PublicBlumBlumShub : public RandomNumberGenerator, public StreamTransformation { public: virtual ~PublicBlumBlumShub() {} PublicBlumBlumShub(const Integer &n, const Integer &seed); unsigned int GenerateBit(); byte GenerateByte(); void GenerateBlock(byte *output, size_t size); void ProcessData(byte *outString, const byte *inString, size_t length); bool IsSelfInverting() const {return true;} bool IsForwardTransformation() const {return true;} protected: ModularArithmetic modn; Integer current; word maxBits, bitsLeft; }; /// BlumBlumShub with factorization of the modulus class BlumBlumShub : public PublicBlumBlumShub { public: virtual ~BlumBlumShub() {} // Make sure p and q are both primes congruent to 3 mod 4 and at least 512 bits long, // seed is the secret key and should be about as big as p*q BlumBlumShub(const Integer &p, const Integer &q, const Integer &seed); bool IsRandomAccess() const {return true;} void Seek(lword index); protected: const Integer p, q; const Integer x0; }; NAMESPACE_END #endif ``````