Abstract
As a generalisation of clock-controlled shift registers, we consider a class of key-stream generators where a clocking sequence is used to control a “pseudorandom” walk on a finite group.
This research was supported in part by Deutscher Akademischer Austauschdienst and the British Council under the British-German Academic Research Collaboration programme. Simon Blackburn is supported by E.P.S.R.C. Research Grant GR/H23719
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
P. Diaconis, Group Representations in Probability and Statistics, Institute of Mathematical Statistics Lecture Notes-Monograph Series, 11, Hayward (CA), 1988.
D. Gollmann, W.G. Chambers, Clock-Controlled Shift Registers: A Review, IEEE J-SAC 7/4 (1989), 525–533.
M. Schönert et al., GAP: Groups, Algorithms and Programming, RWTH Aachen, 1992.
R. Lidl, H. Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, 1986.
R.A. Rueppel, Analysis and Design of Stream Ciphers, Springer, 1986.
M. Stamp, C.F. Martin, An Algorithm for the k-Error Linear Complexity of Binary Sequences with Period 2n, IEEE Trans. Inform. Theory 39/4 (1993), 1398–1401.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baum, U., Blackburn, S. (1995). Clock-controlled pseudorandom generators on finite groups. In: Preneel, B. (eds) Fast Software Encryption. FSE 1994. Lecture Notes in Computer Science, vol 1008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60590-8_2
Download citation
DOI: https://doi.org/10.1007/3-540-60590-8_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60590-4
Online ISBN: 978-3-540-47809-6
eBook Packages: Springer Book Archive