Batch RSA
From MaRDI portal
Publication:1363068
DOI10.1007/S001459900021zbMATH Open1053.94553OpenAlexW2912274982WikidataQ127621926 ScholiaQ127621926MaRDI QIDQ1363068FDOQ1363068
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of short RSA secret exponents
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- Elliptic Curve Cryptosystems
- Title not available (Why is that?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Reducing elliptic curve logarithms to logarithms in a finite field
- Time bounds for selection
- Fast evaluation of logarithms in fields of characteristic two
- On hiding information from an oracle
- Title not available (Why is that?)
- Amortized Computational Complexity
- Modifications to the number field sieve
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Post-quantum RSA
- Improved batch exponentiation
- Batch Decryption of Encrypted Short Messages and Its Application on Concurrent SSL Handshakes
- Practical statistically-sound proofs of exponentiation in any group
- Execution of cryptographic operations according to RSA scheme in resource-constrained environments
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
- Certifying RSA
This page was built for publication: Batch RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363068)