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 key sequences of period d, M ∞ the subset of encryptions with non-computable key sequences.
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.
Reference
N. J. A. Sloane, Encrypting by Random Rotations. Lecture Notes in Computer Science 434, Springer 1990.
Eberhard Hopf, On Causality, Statistics and Probability, Journal of Mathematics and Physics 13, pp. 51–102 (1934).
See F.L. Bauer, Efficient Solution of a Non-Monotonic Inverse Oroblem. In: W.H.J. Feijen et al. (des.), Beauty is our Business. Springer 1990, pp. 19–26.
According to M. J. Wiener, Efficient DES Key Search. CRYPTO ‘83, Santa Barbara, CA, Aug. 22–26, 1993.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bauer, F.L. (2002). Composition of Classes of Methods. In: Decrypted Secrets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04736-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-04736-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04738-5
Online ISBN: 978-3-662-04736-1
eBook Packages: Springer Book Archive