Skip to main content
SpringerLink
Log in

Algebraic and symbolic computation in digital signal processing, coding and cryptography

  • Conference paper
  • First Online:
EUROCAL '85 (EUROCAL 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 203))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beth: Verfahren der Schnellen Fourier Transformation, Teubner 1984

    Google Scholar 

  2. Lüneburg: Galoisfelder. Kreisteilungskorper und Schieberegisterfolgen B.I. 1979

    Google Scholar 

  3. Golomb: Shift Register Sequences, Holden-Day 1976.

    Google Scholar 

  4. Beth/Hess/Wirl: Kryptographie, Teubner 1983.

    Google Scholar 

  5. Beker/Piper: Cipher Systems, Northwood 1982.

    Google Scholar 

  6. Nussbaumer: The Fast Fourier Transform and Convolution Algorithms. Springer 1981.

    Google Scholar 

  7. Blahut: Theory and Practice of Error-Control Codes, Addison-Wesley 1983.

    Google Scholar 

  8. Serre: Linear Representatives of Finite Groups. Springer 1977.

    Google Scholar 

  9. Schonhage/Strassen: Schnelle Multiplikation grosser Zahlen, Computing 7, 281–292, 1971.

    Google Scholar 

  10. Aho/Hopcroft/Ullman: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  11. Winograd: Arithmetic Complexity of Computations, SIAM 1982.

    Google Scholar 

  12. Plesken: Private communication with the author, 1984.

    Google Scholar 

  13. Berlekamp: Algebraic Coding Theory, McGraw-Hill 1968.

    Google Scholar 

  14. Lipson: Elements of Algebra and Algebraic Computing, Addison-Wesley 1981.

    Google Scholar 

  15. Rader: Discrete Fourier Transform when the number of data points is prime, Proc. IEEE 56, 1107–1108, 1968.

    Google Scholar 

  16. Rivest/Shamir/Adleman: A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM 21, 120–126 (1978).

    Article  Google Scholar 

  17. Diffie/Hellman: New Directions in Cryptography, IEEE Transactions Information Theory II-22, 644–654 1976.

    Article  Google Scholar 

  18. Knuth: Seminumerical Algorithms, Addison-Wesley 1969.

    Google Scholar 

  19. Beth/Fumy/Mühlfeld: Zur algebraischen diskreten Fourier-Transformation, Arch. Math. 40, 238–244; 1983.

    Article  Google Scholar 

  20. Berlekamp: Bit — Serial Reed-Solomon Encoders, preprint, Cyclotomics Inc. 1983

    Google Scholar 

  21. Massey: A New Multiplication Method for GF(2m) and Its Applications in Public Key Cryptography, EUROCRYPT '83, Udine, 1983.

    Google Scholar 

  22. Fumy: Manuscript, Erlangen, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics and Computer Science Royal Holloway College, University of London, England

    Thomas Beth

Authors
  1. Thomas Beth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bruno Buchberger

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beth, T. (1985). Algebraic and symbolic computation in digital signal processing, coding and cryptography. In: Buchberger, B. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15983-5_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-15983-5_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15983-4

  • Online ISBN: 978-3-540-39684-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation