PBC Library Manual 0.5.11 - Stanford Crypto Group

More documents

Recommendations

Info

7.3. Example cryptosystems Chapter 7. Bundled programs In the example subdirectory there are various programs that read curve parameters on standard input and perform computations that would be required in a typical implementation of a pairing-based cryptosystem. Sample schemes include: • Boneh-Lynn-Shacham short signatures • Hess identity-based signatures • Joux tripartite Diffie-Hellman • Paterson identity-based signatures • Yuan-Li identity-based authenticated key agreement • Zhang-Kim identity-based blind/ring signatures • Zhang-Safavi-Naini-Susilo signatures More work would be required to turn these programs into real applications. 7.4. Benchmarks I use the programs in the benchmark subdirectory to measure running times of pairings, and also RSA decryptions. The benchmark program takes pairing parameters on standard input and reports the average running time of the pairing over 10 runs, while timersa estimates the time required to perform one 1024-bit RSA decryption. 33
Chapter 8. <strong>PBC</strong> internals The source code is organized by subdirectories: include: Headers describing the official API. Headers in other places are for internal use only. arith: Finite fields: modular arithmetic, polynomial rings, and polynomial rings modulo a polynomial. Finite fields of low characteristic are unsupported. ecc: Elliptic curve generation, elliptic curve groups and pairings. One source file is dedicated to each type of pairing, containing specialized optimizations. Some of the code requires arbitrary precision complex numbers, which also live here but should be moved elsewhere one day. misc: Dynamic arrays, symbol tables, benchmarking, logging, debugging, other utilities. gen: Programs that generate pairing parameters and list Hilbert polynomials. These were used to prepare the samples in the param directory. example: Example programs showing how to use the library. guru: Tests, experimental code. 8.1. <strong>Group</strong>s, rings, fields Algebraic structures are represented in the field_t data type, which mostly contains pointers to functions written to perform operations such as addition and multiplication in that particular group, ring or field: struct field_s { ... void (*init)(element_ptr); void (*clear)(element_ptr); ... void (*add)(element_ptr, element_ptr, element_ptr); void (*sub)(element_ptr, element_ptr, element_ptr); void (*mul)(element_ptr, element_ptr, element_ptr); ... }; typedef struct field_s *field_ptr; typedef struct field_s field_t[1]; 34
Page 1 and 2: PBC Library Manual 0.5.11 Ben Lynn
Page 3 and 4: Table of Contents Preface .........
Page 5 and 6: Preface The PBC library is a free p
Page 7 and 8: Chapter 1. Installing PBC The first
Page 9 and 10: Chapter 2. Tutorial This chapter wa
Page 11 and 12: 2.2. Import/export Chapter 2. Tutor
Page 13 and 14: Chapter 3. Pairing functions An app
Page 15 and 16: Chapter 3. Pairing functions Get re
Page 17 and 18: Chapter 4. Element functions Elemen
Page 19 and 20: void element_set0(element_t e) Set
Page 21 and 22: Chapter 4. Element functions z must
Page 23 and 24: Chapter 4. Element functions void e
Page 25 and 26: size_t element_out_str(FILE * strea
Page 27 and 28: int element_length_in_bytes_x_only(
Page 29 and 30: Chapter 5. Param functions Pairings
Page 31 and 32: Chapter 5. Param functions Generate
Page 33 and 34: Chapter 6. Other functions Random n
Page 35 and 36: Reports informational message. void
Page 37: nd(G) init_pairing_A(); Other sampl
Page 41 and 42: Additionally, defining PBC_DEBUG ca
Page 43 and 44: The lack of an x term simplifies so
Page 45 and 46: Chapter 8. PBC internals b: E: y^2=
Page 47 and 48: Returns the pointer at index i in t
Page 49 and 50: Chapter 8. PBC internals I would li
Page 51: Appendix A. Contributors Ben Lynn w

PBC Library Manual 0.5.11 - Stanford Crypto Group

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?