Abstract
Let us recall that an encryption X : V* ⇢ W* is usually finitely generated by a cryptosystem M. Let M* denote the set of all encryptions defined in this way by M. An encryption method S is a subset of M*. M d indicates the subset of periodic encryptions with period d, M ∞ the subset of encryptions with non-computable keys.
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
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bauer, F.L. (2000). Composition of Classes of Methods. In: Decrypted Secrets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04024-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-04024-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04026-3
Online ISBN: 978-3-662-04024-9
eBook Packages: Springer Book Archive