Skip to main content
SpringerLink
Log in

Das RSA-Kryptosystem

  • Chapter
  • First Online:
Kryptografie verständlich

Part of the book series: eXamen.press ((EXAMEN))

  • 23k Accesses

Zusammenfassung

In diesem Kapitel erlernen Sie

  • die Funktionsweise des RSA-Verfahrens,

  • praktische Aspekte von RSA wie z. B. die Berechnung der Parameter und schnelle Ver- und Entschlüsselung,

  • Sicherheitsabschätzung von RSA,

  • Implementierungsaspekte.

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 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Heutzutage werden Parameter von mindestens 2048 Bit empfohlen, vgl. Tab. Tab. 6.1 und die dazugehörige Diskussion.

  2. 2.

    Der Grund für die quadratische Komplexität ist anhand des folgenden Beispiels einfach ersichtlich: Wenn wir eine vierstellige Zahl abcd mit einer anderen Zahl wxyz multiplizieren, multiplizieren wir jede Ziffer des ersten Operanden mit jeder Ziffer des zweiten Operanden, d. h. insgesamt werden \(4^{2}=16\) Multiplikationen von Ziffern durchgeführt. Wenn wir andererseits zwei Zahlen mit jeweils zwei Ziffern, d. h. ab mal wx, berechnen, sind nur \(2^{2}=4\) elementare Multiplikationen notwendig.

Literatur

  1. Daniel J. Bernstein, Multidigit multiplication for mathematicians, http://cr.yp.to/papers.html. Zugegriffen am 1. April 2016

  2. L. Blum, M. Blum, M. Shub, A simple unpredictable pseudorandom number generator. SIAM J. Comput. 15(2), 364–383 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. Manuel Blum, Shafi Goldwasser, An efficient probabilistic public-key encryption scheme which hides all partial information, in CRYPTO ’84: Proceedings of the 4th Annual International Cryptology Conference, Advances in Cryptology (1984), S. 289–302

    Google Scholar 

  4. Dan Boneh, Ron Rivest, Adi Shamir, Len Adleman, Twenty Years of Attacks on the RSA Cryptosystem. Notices of the AMS 46, 203–213 (1999)

    MathSciNet  Google Scholar 

  5. Çetin Kaya Koç, Tolga Acar, Burton S. Kaliski, Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26–33 (1996)

    Article  Google Scholar 

  6. T. Collins, D. Hopkins, S. Langford, M. Sabin, Public key cryptographic apparatus and method. United States Patent US 5,848,159 (1997)

    Google Scholar 

  7. The Side Channel Cryptanalysis Lounge (2007), http://www.crypto.ruhr-uni-bochum.de/en_sclounge.html. Zugegriffen am 1. April 2016

  8. S. E. Eldridge, C. D. Walter, Hardware implementation of Montgomery’s modular multiplication algorithm. IEEE Transactions on Computers 42(6), 693–699 (1993)

    Article  Google Scholar 

  9. J. Franke, T. Kleinjung, C. Paar, J. Pelzl, C. Priplata, C. Stahlke, SHARK – A realizable special hardware sieving device for factoring 1024-bit integers, in CHES ’05: Proceedings of the 7th International Workshop on Cryptographic Hardware and Embedded Systems, hrsg. von Josyula R. Rao, Berk Sunar. LNCS, Bd. 3659 (Springer, 2005), S. 119–130

    Chapter  Google Scholar 

  10. A. Karatsuba, Y. Ofman, Multiplication of multidigit numbers on automata. Soviet Physics Doklady (English translation) 7(7), 595–596 (1963)

    Google Scholar 

  11. Stefan Mangard, Elisabeth Oswald, Thomas Popp, Power Analysis Attacks: Revealing the Secrets of Smart Cards (Advances in Information Security) (Springer, 2007)

    MATH  Google Scholar 

  12. A. J. Menezes, P. C. van Oorschot, S. A. Vanstone, Handbook of Applied Cryptography (CRC Press, Boca Raton, FL, USA, 1997)

    MATH  Google Scholar 

  13. Amir Moradi, Advances in Side-Channel Security. Habilitation, Ruhr-Universität Bochum, 2015

    Google Scholar 

  14. David Naccache, David M’Raihi, Cryptographic smart cards. IEEE Micro 16(3):14–24 (1996)

    Article  Google Scholar 

  15. Christof Paar, Implementation of Cryptographic Schemes 1, https://www.emsec.rub.de/media/attachments/files/2015/09/IKV-1_2015-04-28.pdf. Zugegriffen am 1. April 2016

  16. M. O. Rabin, Digitalized Signatures and Public-Key Functions as Intractable as Factorization. Technical report (Massachusetts Institute of Technology, 1979)

    Google Scholar 

  17. Public Key Cryptography Standard (PKCS) (1991), http://www.rsasecurity.com/rsalabs/node.asp?id=2124. Zugegriffen am 1. April 2016

  18. A. Shamir, Factoring large numbers with the TWINKLE device, in CHES ’99: Proceedings of the 1st International Workshop on Cryptographic Hardware and Embedded Systems. LNCS, Bd. 1717. (Springer, 1999), S. 2–12

    Chapter  Google Scholar 

  19. A. Shamir, E. Tromer, Factoring Large Numbers with the TWIRL Device, in CRYPTO ’03: Proceedings of the 23rd Annual International Cryptology Conference, Advances in Cryptology. LNCS, Bd. 2729 (Springer, 2003), S. 1–26

    Google Scholar 

  20. Tsuyoshi Takagi, Fast RSA-type cryptosystem modulo \(p^{k}q\), in CRYPTO ’98: Proceedings of the 18th Annual International Cryptology Conference, Advances in Cryptology (Springer, 1998), S. 318–326

    Google Scholar 

  21. Andre Weimerskirch, Christof Paar, Generalizations of the Karatsuba algorithm for efficient implementations. Cryptology ePrint Archive, Report 2006/224, http://eprint.iacr.org/2006/224. Zugegriffen am 1. April 2016

Download references

Author information

Authors and Affiliations

  1. Computer Security, Hochschule Hamm-Lippstadt, Hamm, Nordrhein-Westfalen, Deutschland

    Jan Pelzl

  2. Horst Görtz Institut für IT-Sicherheit, Ruhr-Universität Bochum, Bochum, Deutschland

    Christof Paar

Authors
  1. Jan Pelzl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christof Paar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jan Pelzl .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pelzl, J., Paar, C. (2016). Das RSA-Kryptosystem. In: Kryptografie verständlich. eXamen.press. Springer Vieweg, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49297-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49297-0_7

  • Published:

  • Publisher Name: Springer Vieweg, Berlin, Heidelberg

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

  • Online ISBN: 978-3-662-49297-0

  • eBook Packages: Computer Science and Engineering (German Language)

Publish with us

Policies and ethics

Search

Navigation