Abstract
Let m =plbe a product of two distinct primespand l and letE m be the set of integers e, 1 ≤ e ≤ φ(m), with gcd(eφ(m))= 1. Here we present some results of [514] about the distribution modulo m of theRSA pairs (x x e).For example such pairs arise in theRSA signaturescheme, and thus studying their behaviour is a very natural question.
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). Distribution of the RSA and Exponential Pairs. 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_22
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8037-4_22
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9415-9
Online ISBN: 978-3-0348-8037-4
eBook Packages: Springer Book Archive