Batch RSA

DOI10.1007/s001459900021zbMath1053.94553OpenAlexW2912274982WikidataQ127621926 ScholiaQ127621926MaRDI QIDQ1363068

Amos Fiat

Publication date: 1997

Published in: Journal of Cryptology (Search for Journal in Brave)

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

zbMATH Keywords

RSA, Amortization, Computational complexity, Asymmetric cryptography.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items

Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ Improved batch exponentiation

Cites Work

• On hiding information from an oracle
• Modifications to the number field sieve
• Time bounds for selection
• Fast evaluation of logarithms in fields of characteristic two
• Cryptanalysis of short RSA secret exponents
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Amortized Computational Complexity
• Elliptic Curve Cryptosystems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Reducing elliptic curve logarithms to logarithms in a finite field
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item