blob: 74dd9b1d98bf501161df55dcd258c8be901f6517 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
// requires
// * gmp.h
// * param.h
#ifndef __PBC_A1_PARAM_H__
#define __PBC_A1_PARAM_H__
struct symtab_s;
int pbc_param_init_a1(pbc_param_ptr par, struct symtab_s *tab);
/*@manual a1param
Generate type A1 pairing parameters and store them in 'p'. The group order
will be 'n'. The order of the base field is a few bits longer. To be secure,
generic discrete log algorithms must be infeasible in groups of order 'n', and
finite field discrete log algorithms must be infeasible in finite fields of
order roughly 'n'^2^. Additionally, 'n' should be hard to factorize.
For example: 'n' a product of two primes, each at least 512 bits.
The file `param/a1.param` contains sample parameters for a
type A1 pairing, but it is only for benchmarking: it is useless without
the factorization of +n+, the order of the group.
*/
void pbc_param_init_a1_gen(pbc_param_t param, mpz_t n);
#endif //__PBC_A1_PARAM_H__
|
