MCPcopy Create free account

hub / github.com/RustCrypto/KEMs / functions

Functions448 in github.com/RustCrypto/KEMs

⨍ Functions 448◇ Types & classes 113
↓ 1 callersFunctionbase_mul_pclmul
(a: u64, b: u64)
hqc-kem/src/poly.rs:49
↓ 1 callersFunctionbase_mul_soft
(a: u64, b: u64)
hqc-kem/src/poly.rs:63
↓ 1 callersFunctionbench_decapsulate
(group: &mut BenchmarkGroup<'_, M>)
frodo-kem/benches/frodo.rs:108
↓ 1 callersFunctionbench_encapsulate
(group: &mut BenchmarkGroup<'_, M>)
frodo-kem/benches/frodo.rs:51
↓ 1 callersFunctionbench_keygen
(group: &mut BenchmarkGroup<'_, M>)
frodo-kem/benches/frodo.rs:12
↓ 1 callersFunctionbitrev7
(x: usize)
ml-kem/src/algebra.rs:301
↓ 1 callersMethodc1
(&self)
frodo-kem/src/hazmat/models.rs:102
↓ 1 callersMethodc1_mut
Returns a mutable reference to the c1 component
frodo-kem/src/hazmat/models.rs:107
↓ 1 callersMethodc2
(&self)
frodo-kem/src/hazmat/models.rs:114
↓ 1 callersMethodc2_mut
Returns a mutable reference to the c2 component
frodo-kem/src/hazmat/models.rs:119
↓ 1 callersFunctioncode_decode
Decode codeword: RM decode then RS decode.
hqc-kem/src/code.rs:14
↓ 1 callersFunctioncode_encode
Encode message: RS encode then RM encode.
hqc-kem/src/code.rs:7
↓ 1 callersFunctioncompute_elp
Berlekamp algorithm: compute error locator polynomial sigma. Constant-time implementation using mask-based updates. Returns degree of sigma.
hqc-kem/src/reed_solomon.rs:50
↓ 1 callersFunctioncompute_error_values
constant-time mask operations indexed across multiple arrays
hqc-kem/src/reed_solomon.rs:130
↓ 1 callersFunctioncompute_syndromes
indices used in arithmetic matching FIPS spec
hqc-kem/src/reed_solomon.rs:34
↓ 1 callersFunctioncompute_z_poly
Compute z polynomial for error value computation.
hqc-kem/src/reed_solomon.rs:109
↓ 1 callersFunctionconcat_slices
(slices: I, out: &mut [u8])
dhkem/src/expander.rs:144
↓ 1 callersMethodct_eq
(&self, other: &Self)
hqc-kem/src/types.rs:225
↓ 1 callersFunctiondecaps
(dk_kem: &[u8], c_kem: &[u8], p: &HqcParameters)
hqc-kem/src/kem.rs:126
↓ 1 callersMethoddecapsulate
So we can use the names as in the RFC
x-wing/src/lib.rs:207
↓ 1 callersMethoddecode_message
Matrix decoding from a bit sequence See Algorithm 2 in the [spec](https://frodokem.org/files/FrodoKEM-specification-20210604.pdf).
frodo-kem/src/hazmat/traits.rs:648
↓ 1 callersFunctiondecode_optional_hex
(opt: &Option<String>, field: &str)
ml-kem/tests/wycheproof.rs:77
↓ 1 callersMethodek_pke
Borrow the encryption key.
ml-kem/src/encapsulation_key.rs:62
↓ 1 callersFunctionencaps
( ek_kem: &[u8], p: &HqcParameters, rng: &mut (impl CryptoRng + ?Sized), )
hqc-kem/src/kem.rs:107
↓ 1 callersMethodencapsulate
Encapsulate a message into a ciphertext. See Algorithm 13 in the [spec](https://frodokem.org/files/FrodoKEM-specification-20210604.pdf). Algorithm 8.
frodo-kem/src/hazmat/traits.rs:215
↓ 1 callersMethodencapsulate_deterministic
( &self, randomness: &ArrayN<u8, ENCAPSULATION_RANDOMNESS_SIZE>, )
x-wing/src/lib.rs:108
↓ 1 callersMethodencapsulate_deterministic
(&self, m: &B32)
ml-kem/src/encapsulation_key.rs:45
↓ 1 callersMethodencapsulate_deterministic
(&self, m: &ArrayN<u8, 32>)
ml-kem/tests/encap-decap.rs:18
↓ 1 callersMethodencapsulate_with_rng
(&self, rng: &mut R)
x-wing/src/lib.rs:134
↓ 1 callersMethodencapsulate_with_rng
( &self, rng: &mut R, )
dhkem/src/ecdh_kem.rs:213
↓ 1 callersMethodencode
(&self)
module-lattice/src/encoding.rs:158
↓ 1 callersFunctionencode_single
Encode a single byte into a 128-bit RM(1,7) codeword (two u64s).
hqc-kem/src/reed_muller.rs:19
↓ 1 callersMethodencryption_key_from_decryption_key
(&self, secret_key: &DecryptionKey)
frodo-kem/src/lib.rs:942
↓ 1 callersFunctionexpand_and_sum
Sum repeated codewords into 128 accumulators.
hqc-kem/src/reed_muller.rs:65
↓ 1 callersMethodexpand_labeled_hpke
Create a new expander which uses the prefixes that implement HPKE `LabeledExpand` as described in [RFC9810 §4]. # Errors Returns [`InvalidLength`] if
dhkem/src/expander.rs:124
↓ 1 callersMethodexpand_multi_info
Performs the [RFC5869] `HKDF-Expand` operation with `info` assembled from a slice-of-slices. This is equivalent to calling `expand` with the `info` a
dhkem/src/expander.rs:109
↓ 1 callersFunctionextract_and_expand
(shared_secret: &[u8], kem_context: &[u8])
dhkem/tests/hpke_p256_test.rs:45
↓ 1 callersFunctionfft
Evaluate polynomial at all 2^M field elements using additive FFT. `f` has `f_coeffs` coefficients. `w` receives 2^M evaluations.
hqc-kem/src/fft.rs:187
↓ 1 callersFunctionfft_retrieve_error_poly
Retrieve error polynomial from FFT evaluations. `error[i] = 1` if `w[alpha^(-i)] == 0`, i.e., alpha^(-i) is a root of sigma.
hqc-kem/src/fft.rs:241
↓ 1 callersFunctionfind_peaks
Find the peak in the Hadamard transform (constant-time).
hqc-kem/src/reed_muller.rs:85
↓ 1 callersMethodflatten
(polys: Array<EncodedPolynomial<Self>, K>)
module-lattice/src/encoding.rs:80
↓ 1 callersFunctionhadamard_transform
Hadamard transform using a flag to track which buffer has the result.
hqc-kem/src/reed_muller.rs:45
↓ 1 callersFunctionhash_i
I function: SHA3-512(data || 0x02). Returns 64 bytes.
hqc-kem/src/shake.rs:77
↓ 1 callersFunctionhash_j
J function: SHA3-256(data || 0x03). Returns 32 bytes.
hqc-kem/src/shake.rs:88
↓ 1 callersMethodhpk
(&self)
frodo-kem/src/hazmat/models.rs:363
↓ 1 callersMethodhpk_mut
Returns a mutable reference to the hash of the public key
frodo-kem/src/hazmat/models.rs:368
↓ 1 callersFunctionkaratsuba
Recursive Karatsuba multiplication. Stack layout per level: [alh(size_l) | blh(size_l) | tmp1(2*size_l) | copies(2*size_l) | deeper...] Total local =
hqc-kem/src/poly.rs:166
↓ 1 callersFunctionkaratsuba_add1
( alh: &mut [u64], blh: &mut [u64], a: &[u64], b: &[u64], size_l: usize, size_h: usize
hqc-kem/src/poly.rs:131
↓ 1 callersFunctionkaratsuba_add2
(o: &mut [u64], tmp1: &mut [u64], tmp2: &[u64], size_l: usize, size_h: usize)
hqc-kem/src/poly.rs:150
↓ 1 callersFunctionkeygen
(p: &HqcParameters, rng: &mut impl CryptoRng)
hqc-kem/src/kem.rs:57
↓ 1 callersFunctionkl_divergence
(p: &Distribution, q: &Distribution)
ml-kem/src/algebra.rs:521
↓ 1 callersMethodmatrix_b_mut
Returns a mutable reference to the matrix B
frodo-kem/src/hazmat/models.rs:248
↓ 1 callersMethodmatrix_s_mut
Returns a mutable reference to the matrix s
frodo-kem/src/hazmat/models.rs:355
↓ 1 callersMethodmul_add_as_plus_e
Multiply by s on the right. Uses matrix A row-wise Inputs: s, e (N x N_BAR) Output: out = A*s + e (N x N_BAR)
frodo-kem/src/hazmat/traits.rs:441
↓ 1 callersMethodmul_bs
Matrix multiply B on the lhs and S on the rhs
frodo-kem/src/hazmat/traits.rs:584
↓ 1 callersMethodnext
(&mut self)
ml-kem/src/algebra.rs:57
↓ 1 callersFunctionpke_decrypt
PKE decryption. Returns decrypted message bytes (k bytes).
hqc-kem/src/pke.rs:122
↓ 1 callersFunctionpke_keygen
PKE key generation from a PKE seed. Returns (ek_pke, dk_pke) where: - ek_pke = seed_pke_ek || s_bytes (pk_bytes total) - dk_pke = seed_pke_dk (SEED_B
hqc-kem/src/pke.rs:19
↓ 1 callersFunctionpoly_mul
Multiplication in `R_q`, modulo X^256 + 1
ml-kem/src/algebra.rs:365
↓ 1 callersMethodpublic_key_mut
Returns a mutable reference to the public key
frodo-kem/src/hazmat/models.rs:342
↓ 1 callersFunctionradix_big
Radix conversion for larger sizes.
hqc-kem/src/fft.rs:74
↓ 1 callersMethodrandom_s
(&self)
frodo-kem/src/hazmat/models.rs:326
↓ 1 callersMethodrandom_s_mut
Returns a mutable reference to the shared secret
frodo-kem/src/hazmat/models.rs:331
↓ 1 callersFunctionreduce
Reduce polynomial modulo X^n - 1.
hqc-kem/src/poly.rs:224
↓ 1 callersFunctionreed_muller_decode
Decode concatenated RM codewords into message bytes.
hqc-kem/src/reed_muller.rs:136
↓ 1 callersFunctionreed_muller_encode
Encode message bytes into concatenated RM codewords. Each byte of `msg` (length n1) is RM-encoded into `mult` repetitions of 128-bit codewords, produ
hqc-kem/src/reed_muller.rs:114
↓ 1 callersFunctionreed_solomon_decode
Decode RS codeword, correcting up to delta errors. Modifies `cdw` in place, then extracts message from positions [2*delta..n1-1].
hqc-kem/src/reed_solomon.rs:201
↓ 1 callersFunctionreed_solomon_encode
Encode message into RS codeword (systematic). Message bytes are placed at positions [n1-k..n1-1] (high end). Parity bytes at positions [0..n1-k-1] (l
hqc-kem/src/reed_solomon.rs:13
↓ 1 callersFunctionrun_test
(test_vector: TestVector)
x-wing/src/lib.rs:437
↓ 1 callersMethodsalt
(&self)
frodo-kem/src/hazmat/models.rs:126
↓ 1 callersMethodsalt_mut
Returns a mutable reference to the salt
frodo-kem/src/hazmat/models.rs:131
↓ 1 callersMethodseed_a_mut
Returns a mutable reference to the seed A
frodo-kem/src/hazmat/models.rs:236
↓ 1 callersMethodsub
Matrix subtraction
frodo-kem/src/hazmat/traits.rs:612
↓ 1 callersMethodto_bytes
(&self)
ml-kem/src/encapsulation_key.rs:91
↓ 1 callersMethodtry_fill_bytes
(&mut self, dst: &mut [u8])
ml-kem/tests/pkcs8.rs:132
↓ 1 callersFunctionvect_compare
Constant-time byte comparison. Returns 0 if equal, non-zero otherwise.
hqc-kem/src/poly.rs:24
↓ 1 callersFunctionverify_decap_group
(tg: &acvp::DecapTestGroup)
ml-kem/tests/encap-decap.rs:81
↓ 1 callersFunctionverify_encap_group
(tg: &acvp::EncapTestGroup)
ml-kem/tests/encap-decap.rs:57
FunctionPRF
(s: &B32, b: u8)
ml-kem/src/crypto.rs:49
Functionacvp_encap_decap
()
ml-kem/tests/encap-decap.rs:39
Functionacvp_key_gen
()
ml-kem/tests/key-gen.rs:12
Methodadd
(self, rhs: Elem<F>)
module-lattice/src/algebra.rs:147
Methodalgorithm
(&self)
frodo-kem/src/hazmat/traits.rs:432
Methodas_ref
(&self)
frodo-kem/src/hazmat/models.rs:75
Functionbench_against_liboqs
(c: &mut Criterion)
frodo-kem/benches/frodo.rs:171
Functionbench_decaps
(c: &mut Criterion)
hqc-kem/benches/kem.rs:26
Functionbench_encaps
(c: &mut Criterion)
hqc-kem/benches/kem.rs:15
Functionbench_keygen
(c: &mut Criterion)
hqc-kem/benches/kem.rs:7
Functionbyte_codec
()
module-lattice/tests/encode.rs:79
Functionbyte_codec_12_mod
()
module-lattice/tests/encode.rs:126
Functionbyte_codec_test
(decoded: &DecodedValue, encoded: &EncodedPolynomial<D>)
module-lattice/tests/encode.rs:50
Functionbyte_decode
FIPS 203: Algorithm 5 `ByteDecode_d(F)` FIPS 204: Algorithm 18 `SimpleBitUnpack`
module-lattice/src/encoding.rs:115
Functionbyte_encode
FIPS 203: Algorithm 4 `ByteEncode_d`. FIPS 204: Algorithm 16 `SimpleBitPack`.
module-lattice/src/encoding.rs:91
Functionbyte_encode_alternating_bits
()
module-lattice/tests/encode.rs:409
Functionbyte_encode_decode_d10_roundtrip
()
module-lattice/tests/encode.rs:162
Functionbyte_encode_decode_d12_modular_reduction
()
module-lattice/tests/encode.rs:189
Functionbyte_encode_decode_d12_roundtrip
()
module-lattice/tests/encode.rs:175
Functionbyte_encode_decode_d1_roundtrip
()
module-lattice/tests/encode.rs:136
Functionbyte_encode_decode_d4_roundtrip
()
module-lattice/tests/encode.rs:149
Functionbyte_encode_max_values
()
module-lattice/tests/encode.rs:217
← previousnext →101–200 of 448, ranked by callers