Computer algebra and Computer Aided Systems Theory

  • Thomas Beth
  • Michael Clausen
  • Dieter Gollmann
Systems Theory And CAST
Part of the Lecture Notes in Computer Science book series (LNCS, volume 410)


Fast Fourier Transform Discrete Fourier Transform Residue Number System Complex Arithmetic Metabelian Group 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T. BETH, Verfahren der schnellen Fourier-Transformation, Teubner, Stuttgart, 1984.Google Scholar
  2. [2]
    T. BETH, On the Computational Complexity of the General Discrete Fourier Transform, Theor. Comp. Sci., 51 (1987), pp.331–339.Google Scholar
  3. [3]
    J. CANNON, CAYLEY — A Language for Group Theory, University of Sydney, 1982.Google Scholar
  4. [4]
    M. CLAUSEN, Fast Fourier Transforms for Metabelian Groups, SIAM J. Comput., June 1989.Google Scholar
  5. [5]
    M. CLAUSEN, Fast Generalized Fourier Transforms, Theor. Comp. Sci., in press.Google Scholar
  6. [6]
    M. CLAUSEN, Beiträge zum Entwurf schneller Spektraltransformationen, der Fakultät für Informatik der Universität Karlsruhe vorgelegte Habilitationsschrift, Nov. 1988.Google Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    M. CLAUSEN and A. SHOKROLLAHI, An Alternative Approach to Complex Arithmetic, Proceedings of AAECC-7, Toulouse, June 1989.Google Scholar
  9. [9]
    J.W. COOLEY and J.W. TUKEY, An Algorithm for the Machine Calculation of Complex Fourier Series, Math. Comp. 19 (1965), pp. 297–301.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    P. DIACONIS, Spectral Analysis for Ranked Data, Department of Statistics, Stanford University, preprint.Google Scholar
  13. [13]
    D. GOLLMANN and W.G. CHAMBERS, Cascading Clock Controlled Automata, submitted to Eurocrypt '89, 1989.Google Scholar
  14. [14]
    S.L. HURST, D.M. MILLER and J.C. MUZIO, Spectral Techniques in Digital Logic, Academic Press, 1985.Google Scholar
  15. [15]
    M.G. KARPOVSKY (ed.), Spectral Techniques and Fault Detection, Academic Press, 1985.Google Scholar
  16. [16]
    Z. KOHAVI, Switching and Finite Automata Theory, McGraw-Hill, New York, 1970.Google Scholar
  17. [17]
    A.G. KONHEIM, Cryptography, a Primer, John Wiley & Sons, New York, 1981.Google Scholar
  18. [18]
    F. PICHLER, Schnelle lineare Methoden zur Filterung von Bildern, presented at INFO II, Petras (Greece), July 1979.Google Scholar
  19. [19]
    F. PICHLER, Schnelle Faltung von Bildern, Berichte der ÖAGM-Tagung 1981, pp. 13–20.Google Scholar
  20. [20]
    F. PICHLER, Analog Scrambling by the General Fast Fourier Transform, Comp. Sci. Lect. Notes, 149 (1983), pp. 173–178.Google Scholar
  21. [21]
    F. PICHLER, Finite State Machine Modelling of Cryptographic Systems in LOOPS, Comp. Sci. Lect. Notes, 304 (1987), pp. 65–73.Google Scholar
  22. [22]
    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.Google Scholar
  23. [23]
    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.Google Scholar
  24. [24]
    R.A. RUEPPEL, Analysis and Design of Stream Ciphers, Springer, Berlin, 1986.Google Scholar
  25. [25]
    M. SCHÖNERT, GAP, Group and Programming, Announcement of a CA-system at the conference on “Computational Group Theory”, Oberwolfach, May 1988.Google Scholar
  26. [26]
    P. WICHMANN, Cryptanalysis of a Modified Rotor Machine, Proceedings of Eurocrypt '89, LNCS, Springer, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Thomas Beth
    • 1
  • Michael Clausen
    • 1
  • Dieter Gollmann
    • 1
  1. 1.Institut für Algorithmen und Kognitive Systeme, Fakultät für InformatikUniversität KarlsruheKarlsruheFRG

Personalised recommendations