Skip to main content
SpringerLink
Log in

A one-key cryptosystem based on a finite nonlinear automaton

  • Conference paper
  • First Online:
Cryptography: Policy and Algorithms (CPA 1995)

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

Included in the following conference series:

Abstract

A finite nonlinear automaton for a one-key blockcipher cryptosystem is presented. The key defines the automaton. The mapping from the “keyspace” to the “automaton-space” is one to one. Similar to other cryptosystems, encryption and decryption is done by repeating a number of simple steps called “rounds”. The number of rounds and the blocksize can be variable and does not depend on the key. The statistical properties measured on the ciphertext are satisfactory and in the same range as the properties of DES (Data Encryption Standard).

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. Solomon W. Golomb, Shift Register Sequences, Aegean Park Press, Laguna Hills, California, 1982.

    Google Scholar 

  2. Tao Renji, On finite automaton one-key cryptosystems, Fast Software Encryption, Springer Lectures Notes in Computer Science, 809, Berlin, 1993.

    Google Scholar 

  3. Tao Renji, Shihua Chen, Xuemei Chen, FAPKC3: a new finite automaton public key cryptosystem, to appear.

    Google Scholar 

  4. Harry R. Lewis, Christos H. Papadimitriou, Elements of the Theory of Computation, Prentice Hall, New Jersey, 1981.

    Google Scholar 

  5. W.M.L. Holcombe, Algebraic Automata Theory, Cambridge studies in advanced mathematics, Cambridge University Press, 1982.

    Google Scholar 

  6. P.Guam, Cellular automaton public key cryptosystem, Complex Systems, 1, 51–56, 1987.

    Google Scholar 

  7. Juhani Heino, Finite automata: a layman approach, text posted in sci.crypt news groups, October 1994, juhanihe@waltari.helsinki.fi, University of Helsinki, Finland, 1994.

    Google Scholar 

  8. David W. Deley, Computer Generated Random Numbers, paper posted in sci.crypt newsgroups, September 1994, deleyd@netcom.com, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Wollongong, 2522, Wollongong, NSW, Australia

    Marc Gysin

Authors
  1. Marc Gysin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ed Dawson Jovan Golić

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gysin, M. (1996). A one-key cryptosystem based on a finite nonlinear automaton. In: Dawson, E., Golić, J. (eds) Cryptography: Policy and Algorithms. CPA 1995. Lecture Notes in Computer Science, vol 1029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032356

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60759-5

  • Online ISBN: 978-3-540-49363-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation