scientific article; zbMATH DE number 1406771
From MaRDI portal
zbMATH Open0939.94537MaRDI QIDQ4940686FDOQ4940686
Authors: Chae Hoon Lim, Pil Joong Lee 
Publication date: 1 March 2000
Title of this publication is not available (Why is that?)
Recommendations
Cited In (27)
- Should one always use repeated squaring for modular exponentiation?
- Fast cryptography in genus 2
- A note on speeding up exponentiation by precomputation
- Accelerating Oblivious Transfer with Batch Multi-exponentiation
- Parallel modular exponentiation using load balancing without precomputation
- Zero-Knowledge Sets with Short Proofs
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- Speeding up exponentiation using an untrusted computational resource
- Improving the Performance of Cryptographic Voting Protocols
- Variable-Precision Exponential Evaluation
- Enhanced Digital Signature Using RNS Digit Exponent Representation
- Delegating a product of group exponentiations with application to signature schemes
- Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm
- Parallelizing the Weil and Tate pairings
- Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- On Symmetric Encryption with Distinguishable Decryption Failures
- A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA)
- Simplified small exponent test for batch verification
- More efficient DDH pseudorandom generators
- Mercurial commitments with applications to zero-knowledge sets
- Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
- Efficient computation outsourcing for inverting a class of homomorphic functions
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
- Cold Boot Attacks in the Discrete Logarithm Setting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940686)
