Publication:4940686
From MaRDI portal
zbMath0939.94537MaRDI QIDQ4940686
Publication date: 1 March 2000
Related Items
A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA), Enhanced Digital Signature Using RNS Digit Exponent Representation, Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm, Zero-Knowledge Sets with Short Proofs, Improving the Performance of Cryptographic Voting Protocols, Fast cryptography in genus 2, Parallel modular exponentiation using load balancing without precomputation, Simplified small exponent test for batch verification, Efficient computation outsourcing for inverting a class of homomorphic functions, 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?, Delegating a product of group exponentiations with application to signature schemes, Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography, Reusing nonces in Schnorr signatures (and keeping it secure...), Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions, 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
