{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:50Z","timestamp":1725663590111},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540522157"},{"type":"electronic","value":"9783540469322"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52215-8_14","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:25:23Z","timestamp":1330187123000},"page":"161-169","source":"Crossref","is-referenced-by-count":1,"title":["Computer algebra and Computer Aided Systems Theory"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Beth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Clausen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Gollmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"14_CR1","volume-title":"Verfahren der schnellen Fourier-Transformation","author":"T. Beth","year":"1984","unstructured":"T. BETH, Verfahren der schnellen Fourier-Transformation, Teubner, Stuttgart, 1984."},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(87)90041-7","volume":"51","author":"T. Beth","year":"1987","unstructured":"T. BETH, On the Computational Complexity of the General Discrete Fourier Transform, Theor. Comp. Sci., 51 (1987), pp.331\u2013339.","journal-title":"Theor. Comp. Sci."},{"key":"14_CR3","unstructured":"J. CANNON, CAYLEY \u2014 A Language for Group Theory, University of Sydney, 1982."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"M. CLAUSEN, Fast Fourier Transforms for Metabelian Groups, SIAM J. Comput., June 1989.","DOI":"10.1137\/0218040"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"M. CLAUSEN, Fast Generalized Fourier Transforms, Theor. Comp. Sci., in press.","DOI":"10.1016\/0304-3975(89)90021-2"},{"key":"14_CR6","unstructured":"M. CLAUSEN, Beitr\u00e4ge zum Entwurf schneller Spektraltransformationen, der Fakult\u00e4t f\u00fcr Informatik der Universit\u00e4t Karlsruhe vorgelegte Habilitationsschrift, Nov. 1988."},{"key":"14_CR7","unstructured":"M. CLAUSEN and D. GOLLMANN, Spectral Transforms for Symmetric Groups \u2014 Fast Algorithms and VLSI Architectures, Proceedings of 3rd. International Workshop on Spectral Techniques, Dortmund 1988,to appear."},{"key":"14_CR8","unstructured":"M. CLAUSEN and A. SHOKROLLAHI, An Alternative Approach to Complex Arithmetic, Proceedings of AAECC-7, Toulouse, June 1989."},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J. W. Cooley","year":"1965","unstructured":"J.W. COOLEY and J.W. TUKEY, An Algorithm for the Machine Calculation of Complex Fourier Series, Math. Comp. 19 (1965), pp. 297\u2013301.","journal-title":"Math. Comp."},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TIT.1985.1057081","volume":"IT-31","author":"J. H. Cozzens","year":"1985","unstructured":"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\u2013588.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/TIT.1987.1057322","volume":"IT-33","author":"J. H. Cozzens","year":"1987","unstructured":"J.H. COZZENS and L.A. FINKELSTEIN, Range and Error Analysis for a Fast Fourier Transform Computed over Z[\u03c9], IEEE Trans. Inform. Theory, IT-33 (1987), pp. 582\u2013590.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"14_CR12","unstructured":"P. DIACONIS, Spectral Analysis for Ranked Data, Department of Statistics, Stanford University, preprint."},{"key":"14_CR13","unstructured":"D. GOLLMANN and W.G. CHAMBERS, Cascading Clock Controlled Automata, submitted to Eurocrypt '89, 1989."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"S.L. HURST, D.M. MILLER and J.C. MUZIO, Spectral Techniques in Digital Logic, Academic Press, 1985.","DOI":"10.1016\/0165-1684(85)90052-0"},{"key":"14_CR15","unstructured":"M.G. KARPOVSKY (ed.), Spectral Techniques and Fault Detection, Academic Press, 1985."},{"key":"14_CR16","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1970","unstructured":"Z. KOHAVI, Switching and Finite Automata Theory, McGraw-Hill, New York, 1970."},{"key":"14_CR17","volume-title":"Cryptography, a Primer","author":"A. G. Konheim","year":"1981","unstructured":"A.G. KONHEIM, Cryptography, a Primer, John Wiley & Sons, New York, 1981."},{"key":"14_CR18","unstructured":"F. PICHLER, Schnelle lineare Methoden zur Filterung von Bildern, presented at INFO II, Petras (Greece), July 1979."},{"key":"14_CR19","unstructured":"F. PICHLER, Schnelle Faltung von Bildern, Berichte der \u00d6AGM-Tagung 1981, pp. 13\u201320."},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/3-540-39466-4_11","volume":"149","author":"F. Pichler","year":"1983","unstructured":"F. PICHLER, Analog Scrambling by the General Fast Fourier Transform, Comp. Sci. Lect. Notes, 149 (1983), pp. 173\u2013178.","journal-title":"Comp. Sci. Lect. Notes"},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/3-540-39118-5_7","volume":"304","author":"F. Pichler","year":"1987","unstructured":"F. PICHLER, Finite State Machine Modelling of Cryptographic Systems in LOOPS, Comp. Sci. Lect. Notes, 304 (1987), pp. 65\u201373.","journal-title":"Comp. Sci. Lect. Notes"},{"key":"14_CR22","unstructured":"F. PICHLER, CAST \u2014 Computer Aided Systems Theory: A framework for interactive method banks, in: R. Trappl (ed.), Cybernetics and Systems '88, Kluwer Academic Publishers (1988), pp. 731\u2013736."},{"key":"14_CR23","unstructured":"F. PICHLER and H. PR\u00c4HOFER, CAST:FSM \u2014 Computer Aided Systems Theory: Finite State Machines, in: R. Trappl (ed.), Cybernetics and Systems '88, Kluwer Academic Publishers (1988), pp. 737\u2013742."},{"key":"14_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Ciphers","author":"R. A. Rueppel","year":"1986","unstructured":"R.A. RUEPPEL, Analysis and Design of Stream Ciphers, Springer, Berlin, 1986."},{"key":"14_CR25","unstructured":"M. SCH\u00d6NERT, GAP, Group and Programming, Announcement of a CA-system at the conference on \u201cComputational Group Theory\u201d, Oberwolfach, May 1988."},{"key":"14_CR26","unstructured":"P. WICHMANN, Cryptanalysis of a Modified Rotor Machine, Proceedings of Eurocrypt '89, LNCS, Springer, to appear."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2014 EUROCAST '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52215-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:23:34Z","timestamp":1605630214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52215-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540522157","9783540469322"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-52215-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}