Skip to main content
SpringerLink
Log in

VLSI design for exponentiation in GF(2n)

  • Section 10 Implementations
  • Conference paper
  • First Online:
Advances in Cryptology — AUSCRYPT '90 (AUSCRYPT 1990)

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

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. G.B.Agnew, R.C.Mullin, S.A.Vanstone; Fast Exponentiation in GF(2n); in Proc. Eurocrypt 88, ed. C.G.Günther, Springer LNCS 330, pp.251–255, 1988.

    Google Scholar 

  2. D.W. Ash, I.F. Blake, S.A. Vanstone; Low Complexity Normal Bases; Discrete applied Math. 25, 1989, pp.191–210.

    Google Scholar 

  3. T.Beth; Efficient Zero-Knowledge Identification Scheme for Smart Cards; in Proc. Eurocrypt 88, ed. C.G.Günther, Springer LNCS 330, pp.77–84, 1988.

    Google Scholar 

  4. I.F.Blake, P.C. van Oorschot, S.A.Vanstone; Complexity Issues in Public Key Cryptography; University of Waterloo, preprint.

    Google Scholar 

  5. Calmos Semiconductor Inc., CA34C168 DEP Datasheet, Document #02-34168-001-8808, Kanata, Ontario, 1988.

    Google Scholar 

  6. D.Chaum, J.-H.Evertse, J.van de Graaf, R.Peralta; Demonstrating Possession of a Discrete Logarithm Without Revealing It; Proc. Crypto 86, ed. A.M.Odlyzko, Springer LNCS 263, pp.200–212, 1987.

    Google Scholar 

  7. W.Geiselmann, D.Gollmann; Symmetry and Duality in Normal Basis Multiplication; in Proceedings of AAECC-6 (Rome), ed. T.Mora, Springer LNCS 357, pp.230–238, 1989.

    Google Scholar 

  8. R.Lidl, H.Niederreiter; Finite Fields; Cambridge University Press, 1984.

    Google Scholar 

  9. J.L.Massey, J.K.Omura; Computational method and apparatus for finite field arithmetic; U.S.Patent application, submitted 1981.

    Google Scholar 

  10. R.C. Mullin, I.M. Onyszchuk, S.A. Vanstone, R.M. Wilson; Optimal Normal Bases in GF(p n); Discrete applied Math. 22, 1988/89, pp.149–161.

    Google Scholar 

  11. N. Zierler, J. Brillhart; On primitive trinomials (mod 2); Inform.Control, vol.13, pp.541–554, 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Karlsruhe, Germany

    W. Geiselmann & D. Gollmann

Authors
  1. W. Geiselmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Gollmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jennifer Seberry Josef Pieprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Geiselmann, W., Gollmann, D. (1990). VLSI design for exponentiation in GF(2n). In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030378

Download citation

  • DOI: https://doi.org/10.1007/BFb0030378

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53000-8

  • Online ISBN: 978-3-540-46297-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation