Abstract
Probabilistic algorithms are important in cryptography. On the one hand, the algorithms used in encryption and digital signature schemes often include random choices (as in Vernam’s one-time pad or the DSA) and therefore are probabilistic. On the other hand, when studying the security of cryptographic schemes, adversaries are usually modeled as probabilistic algorithms The subsequent chapters, which deal with provable security properties, require a thorough understanding of this notion. Therefore, we clarify what is meant precisely by a probabilistic algorithm, and discuss the underlying probabilistic model.
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
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Delfs, H., Knebl, H. (2002). Probabilistic Algorithms. In: Introduction to Cryptography. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87126-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-87126-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-87128-3
Online ISBN: 978-3-642-87126-9
eBook Packages: Springer Book Archive