Let us walk on the 3-isogeny graph
|
#include "isogeny_walks.h"
Go to the source code of this file.
Data Structures | |
struct | cgl_hash_2_ctx |
struct | cgl_hash_3_ctx |
Typedefs | |
typedef struct cgl_hash_2_ctx | cgl_hash_2_ctx |
typedef struct cgl_hash_3_ctx | cgl_hash_3_ctx |
Functions | |
void | cgl_hash_init_2 (cgl_hash_2_ctx *ctx, fp2_t input_A) |
void | cgl_hash_digest_2 (fp2_t *output, const cgl_hash_2_ctx *ctx, const uint8_t *input_bitstring) |
void | cgl_hash_init_3 (cgl_hash_3_ctx *ctx, fp2_t input_A, uint8_t choice) |
void | cgl_hash_digest_3 (fp2_t *output, const cgl_hash_3_ctx *ctx, const uint8_t *input_trit_string) |
typedef struct cgl_hash_2_ctx cgl_hash_2_ctx |
typedef struct cgl_hash_3_ctx cgl_hash_3_ctx |
void cgl_hash_digest_2 | ( | fp2_t * | output, |
const cgl_hash_2_ctx * | ctx, | ||
const uint8_t * | input_bitstring ) |
Definition at line 9 of file cgl_hash.c.
References BIT_LENGTH_PATH, fp2_set_to_zero(), isogeny_walks_2(), cgl_hash_2_ctx::j0, and cgl_hash_2_ctx::j_.
Referenced by main().
void cgl_hash_digest_3 | ( | fp2_t * | output, |
const cgl_hash_3_ctx * | ctx, | ||
const uint8_t * | input_trit_string ) |
Definition at line 23 of file cgl_hash.c.
References a1, cgl_hash_3_ctx::a1, a3, cgl_hash_3_ctx::a3, fp2_set_to_zero(), isogeny_walks_3(), isogeny_walks_switch_from_model_3(), and TRITLENGTH_PATH.
Referenced by main().
void cgl_hash_init_2 | ( | cgl_hash_2_ctx * | ctx, |
fp2_t | input_A ) |
Definition at line 16 of file cgl_hash.c.
References isogeny_walks_from_montgomery_model_2(), isogeny_walks_get_previous_step_2(), cgl_hash_2_ctx::j0, and cgl_hash_2_ctx::j_.
Referenced by main().
void cgl_hash_init_3 | ( | cgl_hash_3_ctx * | ctx, |
fp2_t | input_A, | ||
uint8_t | choice ) |
Definition at line 32 of file cgl_hash.c.
References cgl_hash_3_ctx::a1, cgl_hash_3_ctx::a3, isogeny_walks_from_montgomery_model_3(), and isogeny_walks_get_points_3().
Referenced by main().