Skip to main content
SpringerLink
Log in

Cryptography based on transcendental numbers

  • Session 3: Encryption and Cryptographic Functions
  • Conference paper
  • First Online:
Book cover Information Security and Privacy (ACISP 1996)

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

Included in the following conference series:

Abstract

We investigate irrational numbers as a source of pseudorandom bits. We suggest two secure pseudorandom bit generators based on transcendental numbers. These two classes of transcendentals are applied to construct novel encryption algorithms. Properties of the encryption algorithms are studied and preliminary cryptanalysis is given.

Support for this project was provided in part by the Australian Research Council under the reference number A49530480 and the ATERB grant

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. A. Baker. Transcendental Number Theory. Cambridge University Press, 1975.

    Google Scholar 

  2. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850–864, November 1984.

    Google Scholar 

  3. E. Borel. Lecons sur la Theorie des Fonctions. 2nd Ed, 1914,pp.182–216.

    Google Scholar 

  4. R.L. Burden and J.D. Faires. Numerical Analysis. PWS Publishing Company, Boston, 1993.

    Google Scholar 

  5. H. Feistel. Cryptography and computer privacy. Scientific American, 228(5):15–23, 1973.

    Google Scholar 

  6. M. R. Garey and D. S. Johnson. Computers and Intractability A Guide to the Theory of NP-completeness. W.H. Freeman and Company, 1979.

    Google Scholar 

  7. R. Kannan, A.K. Lenstra, and L. Lovász. Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. Mathematics of Computation, 50:235–250, 1988.

    Google Scholar 

  8. D.E. Knuth. The Art of Computer Programming, Volume 2. Addison-Wesley, 1981.

    Google Scholar 

  9. H.W. Lenstra, A.K. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261:513–534, 1982.

    Google Scholar 

  10. R.L. Rivest Cryptography Handbook of Theoretical Computer Science, Chap. 13 Edited by J. van Leeuwen Elsevier Science Publishers, 1990.

    Google Scholar 

  11. A. Schönhage. The fundamental theorem of algebra in terms of computational complexity. Preliminary report, Mathematisches Institut der UniversitÄt Tübigen, August 1982.

    Google Scholar 

  12. A. Shamir. On the generation of cryptographically strong pseudo-random sequences. ACM Transactions on Computer Systems, 1(1):38–44, 1983.

    Google Scholar 

  13. J.S. Vandergraft. Introduction to Numerical Computations. Academic Press, New York, 1983.

    Google Scholar 

  14. Andrew C. Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundation of Computer Science, pages 80–91, New York, 1982. IEEE.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Wollongong, PO Box 1144, 2500, Wollongong, NSW, Australia

    Josef Pieprzyk, Hossein Ghodosi, Chris Charnes & Rei Safavi-Naini

Authors
  1. Josef Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hossein Ghodosi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chris Charnes
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rei Safavi-Naini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josef Pieprzyk Jennifer Seberry

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pieprzyk, J., Ghodosi, H., Charnes, C., Safavi-Naini, R. (1996). Cryptography based on transcendental numbers. In: Pieprzyk, J., Seberry, J. (eds) Information Security and Privacy. ACISP 1996. Lecture Notes in Computer Science, vol 1172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023291

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49583-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation