This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. BETH, Verfahren der schnellen Fourier-Transformation, Teubner, Stuttgart, 1984.
T. BETH, On the Computational Complexity of the General Discrete Fourier Transform, Theor. Comp. Sci., 51 (1987), pp.331–339.
J. CANNON, CAYLEY — A Language for Group Theory, University of Sydney, 1982.
M. CLAUSEN, Fast Fourier Transforms for Metabelian Groups, SIAM J. Comput., June 1989.
M. CLAUSEN, Fast Generalized Fourier Transforms, Theor. Comp. Sci., in press.
M. CLAUSEN, Beiträge zum Entwurf schneller Spektraltransformationen, der Fakultät für Informatik der Universität Karlsruhe vorgelegte Habilitationsschrift, Nov. 1988.
M. CLAUSEN and D. GOLLMANN, Spectral Transforms for Symmetric Groups — Fast Algorithms and VLSI Architectures, Proceedings of 3rd. International Workshop on Spectral Techniques, Dortmund 1988,to appear.
M. CLAUSEN and A. SHOKROLLAHI, An Alternative Approach to Complex Arithmetic, Proceedings of AAECC-7, Toulouse, June 1989.
J.W. COOLEY and J.W. TUKEY, An Algorithm for the Machine Calculation of Complex Fourier Series, Math. Comp. 19 (1965), pp. 297–301.
J.H. COZZENS and L.A. FINKELSTEIN, Computing the Discrete Fourier Transform Using Residue Number Systems in a Ring of Algebraic Integers, IEEE Trans. Inform. Theory, IT-31 (1985), pp. 580–588.
J.H. COZZENS and L.A. FINKELSTEIN, Range and Error Analysis for a Fast Fourier Transform Computed over Z[ω], IEEE Trans. Inform. Theory, IT-33 (1987), pp. 582–590.
P. DIACONIS, Spectral Analysis for Ranked Data, Department of Statistics, Stanford University, preprint.
D. GOLLMANN and W.G. CHAMBERS, Cascading Clock Controlled Automata, submitted to Eurocrypt '89, 1989.
S.L. HURST, D.M. MILLER and J.C. MUZIO, Spectral Techniques in Digital Logic, Academic Press, 1985.
M.G. KARPOVSKY (ed.), Spectral Techniques and Fault Detection, Academic Press, 1985.
Z. KOHAVI, Switching and Finite Automata Theory, McGraw-Hill, New York, 1970.
A.G. KONHEIM, Cryptography, a Primer, John Wiley & Sons, New York, 1981.
F. PICHLER, Schnelle lineare Methoden zur Filterung von Bildern, presented at INFO II, Petras (Greece), July 1979.
F. PICHLER, Schnelle Faltung von Bildern, Berichte der ÖAGM-Tagung 1981, pp. 13–20.
F. PICHLER, Analog Scrambling by the General Fast Fourier Transform, Comp. Sci. Lect. Notes, 149 (1983), pp. 173–178.
F. PICHLER, Finite State Machine Modelling of Cryptographic Systems in LOOPS, Comp. Sci. Lect. Notes, 304 (1987), pp. 65–73.
F. PICHLER, CAST — Computer Aided Systems Theory: A framework for interactive method banks, in: R. Trappl (ed.), Cybernetics and Systems '88, Kluwer Academic Publishers (1988), pp. 731–736.
F. PICHLER and H. PRÄHOFER, CAST:FSM — Computer Aided Systems Theory: Finite State Machines, in: R. Trappl (ed.), Cybernetics and Systems '88, Kluwer Academic Publishers (1988), pp. 737–742.
R.A. RUEPPEL, Analysis and Design of Stream Ciphers, Springer, Berlin, 1986.
M. SCHÖNERT, GAP, Group and Programming, Announcement of a CA-system at the conference on “Computational Group Theory”, Oberwolfach, May 1988.
P. WICHMANN, Cryptanalysis of a Modified Rotor Machine, Proceedings of Eurocrypt '89, LNCS, Springer, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beth, T., Clausen, M., Gollmann, D. (1990). Computer algebra and Computer Aided Systems Theory. In: Pichler, F., Moreno-Diaz, R. (eds) Computer Aided Systems Theory — EUROCAST '89. EUROCAST 1989. Lecture Notes in Computer Science, vol 410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52215-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-52215-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52215-7
Online ISBN: 978-3-540-46932-2
eBook Packages: Springer Book Archive