Abstract
The problem of generating randon elements in groups has direct application to cryptography. For instance, we like to know whether the DES permutations are randon permutations of the 264 possible 64-bit words. The whole symmetric group is known to be generated by certain k-functions (7). Another example is the Wyner voice encryption scheme (12) which requires the production of large numbers of random real orthogonal matrices. N. J. A. Sloane has given a survey on this problem (11) which has led to the following questions for a given group G:
-
1.
How does one generate elements of G at random?
-
2.
How can one test if certain given elements of G really are random?
-
3.
Does a given subset H generate the whole group G?
-
4.
If so, how long does it take?
In this paper, we consider these questions for the orthogonal group O(d) for any positive integer d. By looking at the Lie algebra o(d) of O(d) and one-parameter subgroups of O(d), we can find the generation of an arbitrary element in terms of one-parameter rotation groups in uniform fashion. The length of generation can be determined. Random elements are generated using random number generator on the real parameter space of each one-parameter subgroup.
Chapter PDF
Similar content being viewed by others
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.
References
R. Bernhard, Breaching system security, IEEE Spectrum, 19 (1982), 24–31.
G. R. Blakley, Information theory without the finiteness assumption, I: Cryptosystems as group-theoretic objects, Crypto’ 84 Conference.
S. Chen and L. Greenberg, Hyperbolic spaces, Contribution to Analysis, Papers dedicated to L. Bers, Academic Press, 1974, 49–88.
S. Chen, Transformation groups and semigroups as cryptosystems, to appear.
S. Chen and R. Yoh, The category of generalized Lie groups, Trans. Amer. Math. Soc., 199 (1974), 281–294.
B. S. Kaliski, jr., Wyner’s speech scrambler, Crypto’ 84 Conference.
A. G. Konheim, Cryptography: A Primer, John-Wiley & Sons, 1981.
N. R. F. MacKinnon, The development of speech encipherment, Radio and Electronic Engineer, 50 (1980), 147–155.
J. Reeds, Cracking a random number generator, Cryptologia, 1 (1977), 20–26.
D. Slepian, Prolate spheroidal wave functions, fourier analysis, and uncertainty, Part V: the discrete case, Bell System Tech. Journal, 57 (1978), 1371–1430.
N. J. A. Sloane, Encrypting by random rotations, Cryptography, T. Beth Ed., Springer-Verlag, Lecture Notes in Computer Sciences, 1983, 71–128.
A. D. Wyner, An analog scrambling scheme which does not expand bandwidth, Part I: discrete time, IEEE Trans. Information Theory, IT-25, No. 3, 1979, 261–274.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Ss. (1985). On Rotation Group and Encryption of Analog Signals. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive