Abstract
We have already mentioned that there exists a variety of very strong results (stronger than for almost all other cryptosystems) on bit security, see [182, 220] and references therein. Here we show that the methods of Chapter 6, more specifically Lemma 6.4, allow us to obtain several new results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Basel AG
About this chapter
Cite this chapter
Shparlinski, I. (2003). Bit Security of the RSA Encryption and the Shamir Message Passing Scheme. In: Shparlinski, I. (eds) Cryptographic Applications of Analytic Number Theory. Progress in Computer Science and Applied Logic, vol 22. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8037-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8037-4_19
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9415-9
Online ISBN: 978-3-0348-8037-4
eBook Packages: Springer Book Archive