Publication:4940686
From MaRDI portal
zbMath0939.94537MaRDI QIDQ4940686
Publication date: 1 March 2000
Related Items
Zero-Knowledge Sets with Short Proofs, Fast cryptography in genus 2, Parallel modular exponentiation using load balancing without precomputation, Simplified small exponent test for batch verification, Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm, Should one always use repeated squaring for modular exponentiation?, Mercurial commitments with applications to zero-knowledge sets, More efficient DDH pseudorandom generators, Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields, Speeding up exponentiation using an untrusted computational resource, Efficient algorithms for speeding up the computations of elliptic curve cryptosystems, Cold Boot Attacks in the Discrete Logarithm Setting, Accelerating Oblivious Transfer with Batch Multi-exponentiation, On Symmetric Encryption with Distinguishable Decryption Failures, Structure computation and discrete logarithms in finite abelian $p$-groups, Parallelizing the Weil and Tate Pairings
