data has already been hashed (probably with SHA or SHA-1). */ returns * 1: correct signature * 0: incorrect signature * -1: error */

For historical reasons, the standard function for reading passwords is * in the DES library -- if someone ever wants to disable DES, * this function

LHASH *conf: Config file */ char *value: Value */

constant_time_ge returns 0xff if a>=b and 0x00 otherwise. */

* Extract min and max values from an ASIdOrRange. */

felem_diff_128_64 subtracts |in| from |out| * On entry: * in[i] < 2^62 + 2^17 * On exit: * out[i] < out[i] + 2^63 */

felem_is_zero returns a limb with all bits set if |in| == 0 (mod p) and 0 * otherwise. * On entry: * in[i] < 2^59 + 2^14 */

felem_to_BN converts an felem into an OpenSSL BIGNUM */

From internal representation to OpenSSL BIGNUM */

Set 256 bit key into context */

Low-level encryption routine - encrypts one 64 bit block*/

The following hash seems to work very well on normal text strings * no collisions on /usr/dict/words and it distributes on %2^n quite * well, not as

Why not inline 'rep movsd'? I failed to find information on what * value in Direction Flag one can expect and consequently have to * apply "better-s

point_add calcuates (x1, y1, z1) + (x2, y2, z2) * * The method is taken from * http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addit

felem_to_BN converts an felem into an OpenSSL BIGNUM */

Convert the bit-string representation of a polynomial * ( \sum_{i=0}^n a_i * x^i) into an array of integers corresponding * to the bits with non-ze

Returns -2 for errors because both -1 and 0 are valid results. */

unsigned add of b to a */

this has 'package' visibility */

NB: this wrapper would normally be placed in rsa_lib.c and the static * implementation would probably be in rsa_eay.c. Nonetheless, is kept here so

return the actual cipher being used */