From fca74d4bc3569506a6659880a89aa009dc11f552 Mon Sep 17 00:00:00 2001 From: wukong Date: Mon, 23 Nov 2015 17:48:48 +0100 Subject: moon-abe cleanup Change-Id: Ie1259856db03f0b9e80de3e967ec6bd1f03191b3 --- moon-abe/pbc-0.5.14/include/pbc_f_param.h | 27 --------------------------- 1 file changed, 27 deletions(-) delete mode 100644 moon-abe/pbc-0.5.14/include/pbc_f_param.h (limited to 'moon-abe/pbc-0.5.14/include/pbc_f_param.h') diff --git a/moon-abe/pbc-0.5.14/include/pbc_f_param.h b/moon-abe/pbc-0.5.14/include/pbc_f_param.h deleted file mode 100644 index 5c484a98..00000000 --- a/moon-abe/pbc-0.5.14/include/pbc_f_param.h +++ /dev/null @@ -1,27 +0,0 @@ -// Type F pairings. - -// Requires: -// * param.h -#ifndef __PBC_F_PARAM_H__ -#define __PBC_F_PARAM_H__ - -struct symtab_s; -int pbc_param_init_f(pbc_param_ptr par, struct symtab_s *tab); - -/*@manual fparam -Generate type F pairing parameters and store them in 'p'. -Both the group order r and the order of the base field q will be roughly -'bits'-bit numbers. -To be secure, generic discrete log algorithms must -be infeasible in groups of order r, and finite field discrete log algorithms -must be infeasible in finite fields of order q^12, e.g. 'bits' = 160. - -Type F should be used when the top priority is to minimize bandwidth (e.g. -short signatures). The current implementation makes them slow. - -If finite field discrete log algorithms improve further, type D pairings will -have to use larger fields, but type F can still remain short, up to a point. -*/ -void pbc_param_init_f_gen(pbc_param_t p, int bits); - -#endif //__PBC_F_PARAM_H__ -- cgit 1.2.3-korg