Batch RSA
type: Item
instance of: scholarly article
title: Batch RSA
zbMATH Open document ID: 1053.94553
author: Amos Fiat
published in: Journal of Cryptology
publication date: 1997-01-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1046190
zbMATH Keywords: RSA, Amortization, Computational complexity, Asymmetric cryptography.
MaRDI profile type: Publication
full work available at URL: s001459900021
OpenAlex ID: W2912274982
cites work: On hiding information from an oracle
cites work: Q4091421
cites work: Time bounds for selection
cites work: Q4279678
cites work: Fast evaluation of logarithms in fields of characteristic two
cites work: Modifications to the number field sieve
cites work: New directions in cryptography
cites work: Q4940699
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: Q3775466
cites work: Elliptic Curve Cryptosystems
cites work: Q3935355
cites work: Q4273679
cites work: Q3211242
cites work: Reducing elliptic curve logarithms to logarithms in a finite field
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Amortized Computational Complexity
cites work: Cryptanalysis of short RSA secret exponents
Wikidata QID: Q127621926
DOI: 10.1007/S001459900021
description: scientific article; zbMATH DE number 1046190