RSA problem: Cryptograpy, RSA, Exponentiation, Modular Arithmetic, Composite Number, Prime Factor, Public-Key Cryptography, Digital Signature

RSA problem: Cryptograpy, RSA, Exponentiation, Modular Arithmetic, Composite Number, Prime Factor, Public-Key Cryptography, Digital Signature

Taschenbuch - 9786130352691
34,00 €
  • Versandkostenfrei
  • Hinweis: Print on Demand. Lieferbar innerhalb von 7 bis 10 Tagen
  • inkl. MwSt. & Versandkosten (innerhalb Deutschlands)
  • Hinweis: Print on Demand. Lieferbar innerhalb von 7 bis 10 Tagen
  • inkl. MwSt. & Versandkosten (innerhalb Deutschlands)

Autorenfreundlich Bücher kaufen?!

Beschreibung

High Quality Content by WIKIPEDIA articles! In cryptography, the RSA problem summarizes the task of performing an RSA private-key operation given only the public key. The RSA algorithm raises a message to an exponent, modulo a composite number N whose factors are not known. As such, the task can be neatly described as finding the eth roots of an arbitrary number, modulo N. For large RSA key sizes (in excess of 1024 bits), no efficient method for solving this problem is known; if an efficient method is ever developed, it would threaten the current or eventual security of RSA-based cryptosystems -- both for public-key encryption and digital signatures.

Details

Verlag Betascript Publishers
Ersterscheinung Februar 2010
Maße 220 mm x 150 mm x 5 mm
Gewicht 147 Gramm
Format Taschenbuch
ISBN-13 9786130352691
Auflage Nicht bekannt
Seiten 88

Schlagwörter