Mercurial > dropbear
view mycrypt_gf.h @ 16:09ab3354aa21 libtomcrypt
propagate of e8bea23df30f9f46c647d06db3b223427b4e3604 and b0b6b4a8843b94d9f049cb5ffe0b1ae91ec1bf8b from branch 'au.asn.ucc.matt.ltc-orig' to 'au.asn.ucc.matt.ltc-db'
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Tue, 15 Jun 2004 14:27:14 +0000 |
parents | d7da3b1e1540 |
children |
line wrap: on
line source
/* ---- GF(2^w) polynomial basis ---- */ #ifdef GF #define LSIZE 32 /* handle upto 1024-bit GF numbers */ typedef unsigned long gf_int[LSIZE]; typedef unsigned long *gf_intp; extern void gf_copy(gf_intp a, gf_intp b); extern void gf_zero(gf_intp a); extern int gf_iszero(gf_intp a); extern int gf_isone(gf_intp a); extern int gf_deg(gf_intp a); extern void gf_shl(gf_intp a, gf_intp b); extern void gf_shr(gf_intp a, gf_intp b); extern void gf_add(gf_intp a, gf_intp b, gf_intp c); extern void gf_mul(gf_intp a, gf_intp b, gf_intp c); extern void gf_div(gf_intp a, gf_intp b, gf_intp q, gf_intp r); extern void gf_mod(gf_intp a, gf_intp m, gf_intp b); extern void gf_mulmod(gf_intp a, gf_intp b, gf_intp m, gf_intp c); extern void gf_invmod(gf_intp A, gf_intp M, gf_intp B); extern void gf_sqrt(gf_intp a, gf_intp M, gf_intp b); extern void gf_gcd(gf_intp A, gf_intp B, gf_intp c); extern int gf_is_prime(gf_intp a); extern int gf_size(gf_intp a); extern void gf_toraw(gf_intp a, unsigned char *dst); extern void gf_readraw(gf_intp a, unsigned char *str, int len); #endif