Functions — github.com/dignifiedquire/rust-accumulators

hub / github.com/dignifiedquire/rust-accumulators / functions

Functions86 in github.com/dignifiedquire/rust-accumulators

⨍ Functions 86 ◇ Types & classes 15

↓ 14 callersFunctionmodpow_uint_int

Calculates a ^ e % n.

src/math.rs:24

↓ 13 callersMethodadd

(&mut self, x: &BigUint)

src/accumulator.rs:68

↓ 11 callersMethodmem_wit_create

(&self, x: &BigUint)

src/accumulator.rs:81

↓ 9 callersFunctionmap_i_to_p_i

(i: usize)

src/vc/binary.rs:194

↓ 7 callersFunctionhash_binary

(m: &BigUint, lambda: usize)

src/vc/general.rs:126

↓ 6 callersMethodbatch_add

(&mut self, xs: &[BigUint])

src/accumulator.rs:140

↓ 6 callersFunctionni_poe_prove

NI-PoE Prove Assumes `u^x = w` All operations are `mod n`.

src/proofs.rs:18

↓ 5 callersFunctionni_poe_verify

NI-PoE Verify Assumes `u^x = w` All operations are `mod n`.

src/proofs.rs:38

↓ 5 callersMethodstate

Returns the current public state.

src/accumulator.rs:40

↓ 4 callersMethodopen

(&self, b: &Self::Domain, i: usize)

src/vc/binary.rs:67

↓ 3 callersMethodcommit

(&mut self, m: &[Self::Domain])

src/vc/binary.rs:55

↓ 3 callersMethodcommit

Internally we map the incoming integers onto a binary vc in the following way ms: [a, b, c] a' = hash_binary(a), b' .. vc[a'..., b'..., c'...]

src/vc/general.rs:47

↓ 3 callersMethodopen

(&self, b: &Self::Domain, i: usize)

src/vc/general.rs:55

↓ 3 callersFunctionshamir_trick

Calculates the `(xy)`-th root of `g`, given the `x`-th root and `y`-th root of `g.` Operations are `mod n`.

src/math.rs:51

↓ 3 callersMethodver_mem

(&self, w: &BigUint, x: &BigUint)

src/accumulator.rs:94

↓ 2 callersMethodbatch_open

(&self, b: &[Self::Domain], is: &[usize])

src/vc/general.rs:71

↓ 2 callersMethoddel

(&mut self, x: &BigUint)

src/accumulator.rs:101

↓ 2 callersMethodmem_wit_create_star

(&self, x: &BigUint)

src/accumulator.rs:241

↓ 2 callersFunctionni_poke2_prove

NI-PoKE2 Prove assumes `u^x = w` All operations are `mod n`.

src/proofs.rs:64

↓ 2 callersMethodnon_mem_wit_create

(&self, x: &BigUint)

src/accumulator.rs:115

↓ 2 callersMethodnon_mem_wit_create_star

( &self, x: &BigUint, )

src/accumulator.rs:284

↓ 2 callersFunctionroot_factor

Given `y = g^x` and `x = \prod x_i`, calculates the `x_i`-th roots, for all `i`. All operations are `mod n`.

src/math.rs:83

↓ 1 callersMethodagg_mem_wit

( &self, w_x: &BigUint, w_y: &BigUint, x: &BigUint, y: &BigUint, )

src/accumulator.rs:215

↓ 1 callersMethodbatch_del

(&mut self, pairs: &[(BigUint, BigUint)])

src/accumulator.rs:166

↓ 1 callersMethodbatch_open

(&self, b: &[Self::Domain], i: &[usize])

src/vc/binary.rs:94

↓ 1 callersMethodbatch_verify

(&self, b: &[Self::Domain], is: &[usize], pi: &Self::BatchCommitment)

src/vc/general.rs:87

↓ 1 callersMethodcreate_all_mem_wit

(&self, set: &[BigUint])

src/accumulator.rs:211

↓ 1 callersMethoddel_w_mem

(&mut self, w: &BigUint, x: &BigUint)

src/accumulator.rs:198

↓ 1 callersMethodmem_wit_x

( &self, _other: &BigUint, w_x: &BigUint, w_y: &BigUint, _x: &BigUint,

src/accumulator.rs:253

↓ 1 callersFunctionni_poke2_verify

NI-PoKE2 Verify assumes `u^x = w` All operations are `mod n`

src/proofs.rs:103

↓ 1 callersFunctionpow_assign

Calculates a = a.pow(b). TODO: this can be speed up using various techniques, like precomputations.

src/math.rs:10

↓ 1 callersMethodstate

(&self)

src/vc/binary.rs:175

↓ 1 callersFunctiontest_batch_add_size

(size: usize)

src/accumulator.rs:503

↓ 1 callersMethodupdate

(&mut self, b: &Self::Domain, b_prime: &Self::Domain, i: usize)

src/vc/binary.rs:183

↓ 1 callersMethodupdate

(&mut self, b: &Self::Domain, b_prime: &Self::Domain, i: usize)

src/vc/general.rs:109

↓ 1 callersMethodver_batch_add

(&self, w: &BigUint, root: &BigUint, xs: &[BigUint])

src/accumulator.rs:157

↓ 1 callersMethodver_mem_star

(&self, x: &BigUint, pi: &(BigUint, BigUint))

src/accumulator.rs:249

↓ 1 callersMethodver_non_mem

(&self, w: &(BigUint, BigInt), x: &BigUint)

src/accumulator.rs:126

↓ 1 callersMethodver_non_mem_star

( &self, x: &BigUint, pi: &(BigUint, BigUint, (BigUint, BigUint, BigInt), BigUint),

src/accumulator.rs:319

Methodbatch_verify

(&self, b: &[Self::Domain], i: &[usize], pi: &Self::BatchCommitment)

src/vc/binary.rs:139

Functionbench_add_1

(c: &mut Criterion)

benches/accumulators_benchmarks.rs:29

Functionbench_batch_add_1

(c: &mut Criterion)

benches/accumulators_benchmarks.rs:61

Functionbench_mem_wit_create_1

(c: &mut Criterion)

benches/accumulators_benchmarks.rs:38

Functionbench_square

(c: &mut Criterion)

benches/accumulators_benchmarks.rs:117

Functionbench_ver_batch_add_1

(c: &mut Criterion)

benches/accumulators_benchmarks.rs:70

Functionbench_ver_mem_1

(c: &mut Criterion)

benches/accumulators_benchmarks.rs:50

Functioncreate_vector_commitment

( lambda: usize, n: usize, )

src/vc/general.rs:10

Methodgenerate_primes

Based on https://github.com/RustCrypto/RSA/blob/master/src/algorithms.rs

src/group/rsa.rs:13

Functionhash_group

Hash the given numbers into the given group. Only works for `OutputSize >= |n|`.

src/hash.rs:25

Functionhash_prime

Hash the given numbers to a prime number. Currently uses only 128bits.

src/hash.rs:13

Functionnonce_hash

Nonce based Hash to prime Prover provide a nonce such that H(nonce|| DATA ) = l with l ∈ Primes(λ). Verification becomes a constant time operation whi

src/hash.rs:42

Functionnone

(_c: &mut Criterion)

benches/accumulators_benchmarks.rs:98

Methodsetup

Generates a group of unknown order and initializes the group with a generator of that group. Setup(λ, z) → pp, A0 Generate the public parameters

src/accumulator.rs:46

Methodsetup

(rng: &mut R, lambda: usize, n: usize)

src/vc/binary.rs:42

Methodsetup

(rng: &mut R, lambda: usize, n: usize)

src/vc/general.rs:31

Methodstate

(&self)

src/vc/general.rs:103

Functiontest_aggregation

()

src/accumulator.rs:602

Functiontest_aggregation_non_mem_star

()

src/accumulator.rs:671

Functiontest_batch_add_large

()

src/accumulator.rs:570

Functiontest_batch_add_small

()

src/accumulator.rs:563

Functiontest_binary_vc_basics

()

src/vc/binary.rs:209

Functiontest_binary_vc_batch

()

src/vc/binary.rs:237

Functiontest_binary_vc_update

src/accumulator.rs:386

Functiontest_general_vc_basics

()

src/vc/general.rs:143

Functiontest_general_vc_batch

()

src/vc/general.rs:160

Functiontest_general_vc_update

()

src/vc/general.rs:179

Functiontest_hash_group

()

src/hash.rs:93

Functiontest_hash_nonce

()

src/hash.rs:107

Functiontest_hash_prime

()

src/hash.rs:80

Functiontest_math_non_mempership

()

src/accumulator.rs:445

Functiontest_ni_poke2

()

src/proofs.rs:171

Functiontest_pow_assign_basics

Functiontest_root_factor

()

src/math.rs:172

Functiontest_shamir_trick

src/accumulator.rs:363

Functiontest_universal

()

src/accumulator.rs:420

Methodver_agg_mem_wit

(&self, w_xy: &BigUint, pi: &BigUint, x: &BigUint, y: &BigUint)

src/accumulator.rs:236

Methodver_batch_del

(&self, w: &BigUint, root: &BigUint, xs: &[BigUint])

src/accumulator.rs:189

Methodver_mem_x

(&self, other: &BigUint, pi: &BigUint, x: &BigUint, y: &BigUint)

src/accumulator.rs:264

Methodverify

(&self, b: &Self::Domain, i: usize, pi: &Self::Commitment)

src/vc/binary.rs:78

Methodverify

(&self, b: &Self::Domain, i: usize, pi: &Self::Commitment)

src/vc/general.rs:63

Functionverify_nonce_hash

Verify if given BIGUINT is a prime, complements the nonce_hash() function

src/hash.rs:67