The following pages link to (Q4940686):
Displayed 16 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- Parallel modular exponentiation using load balancing without precomputation (Q414922) (← links)
- Simplified small exponent test for batch verification (Q501674) (← links)
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm (Q765476) (← links)
- Should one always use repeated squaring for modular exponentiation? (Q963373) (← links)
- Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields (Q2383972) (← links)
- Speeding up exponentiation using an untrusted computational resource (Q2491304) (← links)
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems (Q2572747) (← links)
- Cold Boot Attacks in the Discrete Logarithm Setting (Q2790059) (← links)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation (Q2817471) (← links)
- On Symmetric Encryption with Distinguishable Decryption Failures (Q2946887) (← links)
- Structure computation and discrete logarithms in finite abelian $p$-groups (Q3081295) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- Zero-Knowledge Sets with Short Proofs (Q5458606) (← links)