Batch RSA

DOI10.1007/S001459900021MaRDI QIDQ1363068zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

RSA, Amortization, Computational complexity, Asymmetric cryptography.

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 503340
• Batch RSA signature scheme
• A fast and secure RSA public key cryptosystem
• Cryptanalysis and improvement on batch verifying multiple RSA digital signatures

Cites work

• scientific article; zbMATH DE number 4191556 (Why is no real title available?)
• scientific article; zbMATH DE number 4035724 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 475432 (Why is no real title available?)
• scientific article; zbMATH DE number 503340 (Why is no real title available?)
• scientific article; zbMATH DE number 1406783 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Amortized Computational Complexity
• Cryptanalysis of short RSA secret exponents
• Elliptic Curve Cryptosystems
• Fast evaluation of logarithms in fields of characteristic two
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Modifications to the number field sieve
• New directions in cryptography
• On hiding information from an oracle
• Reducing elliptic curve logarithms to logarithms in a finite field
• Time bounds for selection

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)