Let us walk on the 3-isogeny graph
Loading...
Searching...
No Matches
random.h
Go to the documentation of this file.
1
#ifndef RANDOM_H
2
#define RANDOM_H
3
4
#include <inttypes.h>
5
#include "../common/namespace.h"
6
7
#define random_boundedl1 COMMON(random_boundedl1)
8
#define random_coin COMMON(random_coin)
9
10
// // set up e[0]..e[w-1] having l1 norm at most S, assuming S<128, w<128
11
// void random_boundedl1(int8_t *e,long long w,long long S);
12
13
// return -1 with probability num/den, 0 with probability 1-num/den
14
// assuming 0 <= num <= den, 0 < den < 2^63
15
int64_t
random_coin
(
uint64_t
num
,
uint64_t
den
);
16
17
void
random_wombats
(
uint8_t
*key,
const
long
long
numkeys
,
const
long
long
batch_start
,
const
long
long
batch_stop
,
const
long
long
batch_sumykeys
);
18
19
#endif
num
num
Definition
j-invariants.m:29
i
for i
Definition
prime_search.m:10
batch_start
#define batch_start
Definition
primes.h:55
batch_stop
#define batch_stop
Definition
primes.h:56
random_wombats
void random_wombats(uint8_t *key, const long long numkeys, const long long batch_start, const long long batch_stop, const long long batch_sumykeys)
Definition
random.c:15
random_coin
#define random_coin
Definition
random.h:8
dCTIDH
src
common
random.h
Generated by
1.9.8