Speeding up discrete log and factoring based schemes via precomputations

DOI10.1007/BFB0054129MaRDI QIDQ4249640zbMATH OpenFDO

Authors Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0054129

zbMATH Keywords

precomputationsecurity analyses

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 503339
• More flexible exponentiation with precomputation
• Efficient signature generation by smart cards

Cited in

(15)

• On the distribution of the Diffie-Hellman pairs
• Delegating a product of group exponentiations with application to signature schemes
• A polynomial-time algorithm for solving the hidden subset sum problem
• Reusing nonces in Schnorr signatures (and keeping it secure...)
• Efficient and secure delegation of exponentiation in general groups to a single malicious server
• Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
• Speeding up exponentiation using an untrusted computational resource
• On the uniformity of distribution of the RSA pairs
• scientific article; zbMATH DE number 4133979 (Why is no real title available?)
• Towards a provably secure DoS-resilient key exchange protocol with perfect forward secrecy
• CRT-based outsourcing algorithms for modular exponentiations
• Improved cryptographic puzzle based on~modular exponentiation
• Efficient algorithms for secure outsourcing of bilinear pairings
• More flexible exponentiation with precomputation
• Channel allocation revisited through 1-extendability of graphs

This page was built for publication: Speeding up discrete log and factoring based schemes via precomputations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249640)