Skip to main content
SpringerLink
Log in

Open Encryption Key Systems

  • Chapter
Decrypted Secrets

  • 129 Accesses

Abstract

The polyalphabetic encryption methods discussed so far use a key for encryption and a key for decryption. Crypto systems with self-reciprocal encryption steps use the same key for both, of course. In general, there are two possibilities:

  1. (1)

    There is only one key. The same key character has its particular meaning for encryption and for decryption. This is the case for DES (Sect. 9.6.1).

  2. (2)

    There are two keys, the encryption key and the decryption key.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. New Directions in Cryptography, IEEE Transactions on Information Theory, IT-22, Vol. 6, pp. 644–654 (1976).

    Google Scholar 

  2. Efficient: With a computational effort which is polynomial in log |X| . If P = NP would hold, no strict one-way function could exist at all.

    Google Scholar 

  3. UNIX is a registered trade mark.

    Google Scholar 

  4. For a running program, see Otto Forster, Algorithmische Zahlentheorie, Vieweg, Braunschweig 1996.

    MATH  Google Scholar 

  5. U.S.Patent No. 4 405 829, September 20, 1983.

    Google Scholar 

  6. Contrary to classical custom, Rivest, Shamir and Adleman did not suppress the word spacing. The literature on the RSA method follows them on this.

    Google Scholar 

  7. More cannot be expected, since there are always even fixpoints of the iteration; in fact Salomaa has shown that there always exist nine of them.

    Google Scholar 

  8. M.J. Wiener, Cryptanalysis of short RSA secret exponents. EUROCRYPT ’89 Proceedings. Lecture Notes in Computer Science 434, Springer 1990. Also: IEEE Transactions on Information Theory, Vol. 36 No. 3, May 1990, pp. 553–558 .

    Google Scholar 

  9. Anton Gerold has shown that conclusions can be drawn from the module on the structure of the doubly safe prime factors.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Munich Institute of Technology, Arcisstrasse 21, 80333, Munich, Germany

    Dr. rer. nat. Dr. ès sc. h.c. Dr. rer. nat. h.c. mult. Friedrich L. Bauer (Professor Emeritus of Mathematics and Computer Science)

Authors
  1. Dr. rer. nat. Dr. ès sc. h.c. Dr. rer. nat. h.c. mult. Friedrich L. Bauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bauer, F.L. (2000). Open Encryption Key Systems. In: Decrypted Secrets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04024-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-04024-9_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-04026-3

  • Online ISBN: 978-3-662-04024-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation