scientific article; zbMATH DE number 1303125

MaRDI QIDQ4249640zbMATH OpenFDO

Authors Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan

Publication date 17 June 1999

zbMATH Keywords

precomputationsecurity analyses

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 503339
• Publication:4940686
• Efficient signature generation by smart cards

Cited in

(14)

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

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 Q4249640)