chunkName must be string of 4 characters*/

* Wrapper around mbedtls_asn1_get_mpi() that rejects zero. * * The value zero is: * - never a valid value for an RSA parameter * - interpreted as

return the current count for denugging purposes or similar */

* Signed addition: X = A + B */

How many pixels.

Return 0xff if low <= c <= high, 0 otherwise. * * Constant flow with respect to c. */

* Quick access to an EC context inside a PK context. * * \warning This function can only be used when the type of the context, as * returned by mbe

* Quick access to an RSA context inside a PK context. * * \warning This function can only be used when the type of the context, as * returned by mb

* Estimates the length of the encoded bit stream of the data. * @param input input data * @param version version of the symbol * @return number of

* Estimates the length of the encoded bit stream of 8 bit data. * @param size * @return number of bits */

* DIVISION WITH REMAINDER * Please read the comments before the definition of * `BigUnsigned::divideWithRemainder' in `BigUnsigned.cc' for lots of

* Sliding-window exponentiation: X = A^E mod N (HAC 14.85) */

* Export X into unsigned binary data, big endian */

* Get pk_info structure from type */

* Initialise context */

* Do an RSA public key operation */

in an idat chunk, each scanline is a multiple of 8 bits, unlike the lodepng output buffer*/

* MD5 process buffer */

* Signed addition: X = A + b */

* Do an RSA private key operation */

* SHA-256 process buffer */

* Estimates the length of the encoded bit stream of alphabet-numeric data. * @param size * @return number of bits */

* Insert a structured-append header to the head of the input data. * @param input input data. * @param size number of structured symbols. * @param

Gets the symbol for the given length, cfr. the DEFLATE spec. Returns the symbol in the range [257-285] (inclusive) */

Appends the length and distance to the LZ77 arrays of the ZopfliLZ77Store. context must be a ZopfliLZ77Store*. */

* @return true iff this polynomial is the monomial "0" */

* Fill X with size bytes of random. * * Use a temporary bytes representation to make sure the result is the same * regardless of the platform endia

* Greatest common divisor: G = gcd(A, B) (HAC 14.54) */