Functions — github.com/Election-Tech-Initiative/electionguard-verifier

hub / github.com/Election-Tech-Initiative/electionguard-verifier / functions

Functions128 in github.com/Election-Tech-Initiative/electionguard-verifier

Raise one group element to the power of an element of the corresponding exponential group, modulo the group's prime modulus.

src/crypto/group.rs:183

↓ 30 callersMethodcheck

(&mut self, cond: bool, msg: &str)

src/errors.rs:14

↓ 28 callersFunctionhash_umc

Hash together a BigUint, a message, and a commitment.

src/crypto/hash.rs:56

↓ 18 callersFunctiongenerator

()

src/crypto/group.rs:113

↓ 17 callersMethodas_uint

(&self)

src/crypto/group.rs:52

↓ 17 callersFunctionextended_base_hash

()

src/crypto/elgamal.rs:87

↓ 16 callersFunctionpublic_key

()

src/crypto/elgamal.rs:83

↓ 11 callersFunctionhash_umcc

Hash together a BigUint, a message, and two commitments.

src/crypto/hash.rs:67

↓ 11 callersFunctionrandom_exponent

(rng: &mut impl Rng)

src/generate.rs:428

↓ 11 callersMethodscope

(&'b mut self, desc: &str)

src/errors.rs:26

↓ 7 callersMethodinverse

Take the multiplicative inverse of the element.

src/crypto/group.rs:136

↓ 6 callersFunctionhash_uee

Hash together a BigUint and two group Elements.

src/crypto/hash.rs:90

↓ 6 callersFunctionprime

()

src/crypto/group.rs:117

↓ 5 callersMethodcheck_get

(&mut self, slice: &'b [T], index: usize)

src/errors.rs:20

↓ 5 callersMethodcheck_zero

Use this `Proof` to establish that `message` is an encryption of zero under `public_key`.

src/crypto/chaum_pedersen.rs:57

↓ 5 callersMethodcheck_zero_one

( &self, public_key: &Element, message: &Message, gen_challenge: impl FnOnce(&

src/crypto/chaum_pedersen/disj.rs:28

↓ 5 callersMethodis_ok

(&self)

src/crypto/schnorr.rs:117

↓ 5 callersMethodis_zero

Test if an exponent is zero

src/crypto/group.rs:208

↓ 4 callersMethodcheck_equal

Use this `Proof` to establish that `message1` is equal to `message2`.

src/crypto/chaum_pedersen.rs:170

↓ 4 callersMethodcheck_exp

Use this `Proof` to establish that `result = base^secret_key`, where `secret_key` is the secret key corresponding to `public_key`.

src/crypto/chaum_pedersen.rs:322

↓ 4 callersMethodcheck_plaintext

Use this `Proof` to establish that `message` is an encryption of `plaintext`.

src/crypto/chaum_pedersen.rs:238

↓ 4 callersMethodh_sub

Homomorphic subtraction of encrypted messages. Converts the encryptions of `a` and `b` into the encryption of `a - b`.

src/crypto/elgamal.rs:69

↓ 4 callersFunctionhash_uints

(xs: &[&BigUint])

src/crypto/hash.rs:50

↓ 4 callersMethodtranscript_zero

Check validity of this transcript for proving that `message` is an encryption of zero.

src/crypto/chaum_pedersen.rs:73

↓ 3 callersFunctioncheck

(r: &Record)

src/check.rs:10

↓ 3 callersFunctiongenerate

(rng: &mut impl Rng, e: Election)

src/generate.rs:49

↓ 3 callersMethodh_add

Homomorphic addition of encrypted messages. Converts the encryptions of `a` and `b` into the encryption of `a + b`.

src/crypto/elgamal.rs:51

↓ 3 callersMethodto_exponent

(&self)

src/crypto/group.rs:96

↓ 3 callersMethodtranscript_plaintext

Check validity of this transcript for proving that `message` is an encryption of `plaintext`.

src/crypto/chaum_pedersen.rs:257

↓ 2 callersMethodcheck

Use this `Proof` to establish that the prover possesses the private key corresponding to `public_key`.

src/crypto/schnorr.rs:38

↓ 2 callersFunctioncheck_decrypted_value

(errs: &mut ErrorContext, r: &Record, dv: &DecryptedValue)

src/check.rs:176

↓ 2 callersFunctioncompute_base_hash

(_parameters: &Parameters)

src/check.rs:290

↓ 2 callersFunctioncompute_encrypted_tally

( cast_ballots: &[CastBallot], contest_index: usize, selection_index: usize, )

src/check.rs:269

↓ 2 callersFunctioncompute_extended_base_hash

( _base_hash: &BigUint, _trustee_public_keys: &[TrusteePublicKey], )

src/check.rs:306

↓ 2 callersFunctioncompute_joint_public_key

(trustee_public_keys: &[TrusteePublicKey])

src/check.rs:294

↓ 2 callersFunctioncompute_lagrange_coefficient

( fragments: &[Fragment], // The index of the fragment whose Lagrange coefficient we are computing.

src/check.rs:322

↓ 2 callersFunctioncompute_reassembled_share

(fragments: &[Fragment])

src/check.rs:343

↓ 2 callersFunctioncompute_selection_sum

(cast_selections: &[CastSelection])

src/check.rs:255

↓ 2 callersFunctioncompute_share_product

Compute the decrypted version of `message.ciphertext`, using the product of the `shares`.

src/check.rs:314

↓ 2 callersFunctiongenerate_cast_ballot

( rng: &mut impl Rng, joint_public_key: &Element, extended_base_hash: &BigUint, b: &Ballot, )

src/generate.rs:179

↓ 2 callersFunctiongenerate_decrypted_value

( rng: &mut impl Rng, trustees: &TrusteeInfo, extended_base_hash: &BigUint, message: Message,

src/generate.rs:307

↓ 2 callersFunctionprime_minus_one

()

src/crypto/group.rs:121

↓ 2 callersMethodtranscript

Check validity of this transcript for proving possession of the private key corresponding to `public_key`.

src/crypto/schnorr.rs:54

↓ 2 callersMethodtranscript_equal

Check validity of this transcript for proving that `message1` is equal to `message2`.

src/crypto/chaum_pedersen.rs:184

↓ 1 callersFunctioncheck_record

(errs: &mut ErrorContext, r: &Record)

src/check.rs:20

↓ 1 callersFunctiondiscrete_log

(element: &Element)

src/generate.rs:405

↓ 1 callersFunctiongenerate_contest_tallies

( rng: &mut impl Rng, trustee_info: &TrusteeInfo, extended_base_hash: &BigUint, cast_ballots:

src/generate.rs:253

↓ 1 callersFunctiongenerate_spoiled_ballot

( rng: &mut impl Rng, trustee_info: &TrusteeInfo, extended_base_hash: &BigUint, cast: schema::

src/generate.rs:285

↓ 1 callersFunctiongenerate_trustee_public_keys

( rng: &mut impl Rng, base_hash: &BigUint, trustee_secrets: &[TrusteeSecrets], )

src/generate.rs:152

↓ 1 callersFunctiongenerate_trustee_secrets

( rng: &mut impl Rng, num_trustees: usize, threshold: usize, )

src/generate.rs:112

↓ 1 callersMethodh_neg

Homomorphic negation of encrypted messages. Converts the encryption of `a` into the encryption of `-a`.

src/crypto/elgamal.rs:60

↓ 1 callersMethodis_one

Test if an exponent is one

src/crypto/group.rs:219

↓ 1 callersFunctionprivate_key

()

src/crypto/elgamal.rs:79

↓ 1 callersFunctionrandom_element

(rng: &mut impl Rng)

src/generate.rs:418

↓ 1 callersMethodresolve

(self, resolver: R)

src/crypto/hash.rs:39

↓ 1 callersFunctionrun

()

src/main.rs:47

↓ 1 callersMethodtranscript_exp

Check validity of this transcript for proving that `result = base^secret_key`, where `secret_key` is the secret key corresponding to `public_key`.

src/crypto/chaum_pedersen.rs:342

↓ 1 callersMethodtranscript_zero_one

( &self, public_key: &Element, message: &Message, )

src/crypto/chaum_pedersen/disj.rs:52

Methodadd

Add group exponents, modulo the group's prime modulus *minus one*.

src/crypto/group.rs:227

Functionall_primes_parse

()

src/crypto/group.rs:573

Functiondeserialize

(deserializer: D)

src/serialize/hash.rs:11

Functiondeserialize

(deserializer: D)

src/serialize/big_uint.rs:22

Methoddiv

Divide a group element by another group element.

src/crypto/group.rs:166

Methodencrypt

Encrypt `m` using `public_key` and a `one_time_secret` key.

src/crypto/elgamal.rs:27

Methodexec

(self, resolver: R)

src/crypto/hash.rs:24

This succeeds if and only if the given value is strictly less than the prime modulus of the group.

src/crypto/group.rs:470

Methodfrom_element

(e: Element)

src/crypto/group.rs:100

Methodfrom_exponent

(e: Exponent)

src/crypto/group.rs:104

Methodgen

Return the generator element of the group `G`.

src/crypto/group.rs:36

Functiongen_pow

(exp: &Exponent)

src/crypto/group.rs:196

Functionhash_uuu

Hash together three BigUints.

src/crypto/hash.rs:85

Methodis_ok

(&self)

src/crypto/chaum_pedersen.rs:421

Methodis_ok

(&self)

src/crypto/chaum_pedersen/disj.rs:154

src/bin/encrypt_election.rs:11

Methodmul

Multiply group elements, modulo the group's prime modulus.

src/crypto/group.rs:150

Methodneg

Negate an element of the exponential group.

src/crypto/group.rs:287

Methodnew

(errs: &'a mut Vec<String>)

src/errors.rs:7

Methodnew

Inject an integer into the group: this wraps modulo the prime modulus if the number is greater than or equal to the modulus.

src/crypto/group.rs:42

Methodone

Return the element one, which is always part of any valid group.

src/crypto/group.rs:129

Functionparse_biguint_hex_or_panic

Parse a hex string (which might contain spaces, tabs, or newlines) into a BigUint or panic if it can't be done (this is meant to be used for hard-code

src/crypto/group.rs:594

Functionprime_modulus_minus_one_correct

()

src/crypto/group.rs:583

Methodprove

( public_key: &Element, secret_key: &Exponent, one_time_exponent: &Exponent, g

src/crypto/schnorr.rs:66

Functionprove_check

()

src/crypto/schnorr.rs:133

Functionprove_check_disj_one

()

src/crypto/chaum_pedersen/disj.rs:197

Functionprove_check_disj_one_flipped

()

src/crypto/chaum_pedersen/disj.rs:257

Functionprove_check_disj_two

()

src/crypto/chaum_pedersen/disj.rs:227

Functionprove_check_disj_zero

()

src/crypto/chaum_pedersen/disj.rs:168

Functionprove_check_equal

()

src/crypto/chaum_pedersen.rs:518

Functionprove_check_equal_extreme_nonce

()

src/crypto/chaum_pedersen.rs:582

Functionprove_check_equal_fail

()

src/crypto/chaum_pedersen.rs:550

Functionprove_check_exp

()

src/crypto/chaum_pedersen.rs:695

Functionprove_check_exp_fail

()

src/crypto/chaum_pedersen.rs:725

Functionprove_check_fail

()

src/crypto/schnorr.rs:154

Functionprove_check_plaintext

()

src/crypto/chaum_pedersen.rs:612

Functionprove_check_plaintext_extreme_nonce

()

src/crypto/chaum_pedersen.rs:668

Functionprove_check_plaintext_fail

()

src/crypto/chaum_pedersen.rs:640

Functionprove_check_zero

()

src/crypto/chaum_pedersen.rs:442

Functionprove_check_zero_extreme_nonce

()

src/crypto/chaum_pedersen.rs:493

next →1–100 of 128, ranked by callers