Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Jager, T. (2012). The Generic Composite Residuosity Problem. In: Black-Box Models of Computation in Cryptology. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-8348-1990-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-8348-1990-1_5
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-8348-1989-5
Online ISBN: 978-3-8348-1990-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)