More flexible exponentiation with precomputation
From MaRDI portal
Recommendations
Cited in
(30)- 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
- Fast cryptography in genus 2
- Cold boot attacks in the discrete logarithm setting
- Accelerating oblivious transfer with batch multi-exponentiation
- A note on speeding up exponentiation by precomputation
- On symmetric encryption with distinguishable decryption failures
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- Parallelizing the Weil and Tate pairings
- Parallel modular exponentiation using load balancing without precomputation
- Speeding up discrete log and factoring based schemes via precomputations
- scientific article; zbMATH DE number 503339 (Why is no real title available?)
- Efficient exponentiation using precomputation and vector addition chains
- Variable-Precision Exponential Evaluation
- Simplified small exponent test for batch verification
- A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA)
- Efficient computation outsourcing for inverting a class of homomorphic functions
- 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
- 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?
This page was built for publication: More flexible exponentiation with precomputation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940686)
