scientific article; zbMATH DE number 1406771
From MaRDI portal
Publication:4940686
zbMath0939.94537MaRDI QIDQ4940686
Publication date: 1 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
Fast cryptography in genus 2 ⋮ Mercurial commitments with applications to zero-knowledge sets ⋮ A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA) ⋮ More efficient DDH pseudorandom generators ⋮ Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ 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...) ⋮ On Symmetric Encryption with Distinguishable Decryption Failures ⋮ Parallel modular exponentiation using load balancing without precomputation ⋮ Improving the Performance of Cryptographic Voting Protocols ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ Simplified small exponent test for batch verification ⋮ Efficient computation outsourcing for inverting a class of homomorphic functions ⋮ Should one always use repeated squaring for modular exponentiation? ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ Delegating a product of group exponentiations with application to signature schemes ⋮ Cold Boot Attacks in the Discrete Logarithm Setting ⋮ Zero-Knowledge Sets with Short Proofs ⋮ Structure computation and discrete logarithms in finite abelian $p$-groups ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm ⋮ Parallelizing the Weil and Tate Pairings ⋮ Efficient algorithms for speeding up the computations of elliptic curve cryptosystems ⋮ Enhanced Digital Signature Using RNS Digit Exponent Representation ⋮ Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
This page was built for publication:
