Secret Key Cryptography - Rubin, Frank
51,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
payback
26 °P sammeln
  • Broschiertes Buch

Explore the fascinating and rich world of Secret Key cryptography! This book provides practical methods for encrypting messages, an interesting and entertaining historical perspective, and an incredible collection of ciphers and codesincluding 30 unbreakable methods. In Secret Key Cryptography: Ciphers, from simple to unbreakable you will: * Measure the strength of your ciphers and learn how to guarantee their security * Construct and incorporate data-compression codes * Generate true random numbers in bulk * Construct huge primes and safe primes * Add an undetectable backdoor to a cipher *…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
Explore the fascinating and rich world of Secret Key cryptography! This book provides practical methods for encrypting messages, an interesting and entertaining historical perspective, and an incredible collection of ciphers and codesincluding 30 unbreakable methods. In Secret Key Cryptography: Ciphers, from simple to unbreakable you will: * Measure the strength of your ciphers and learn how to guarantee their security * Construct and incorporate data-compression codes * Generate true random numbers in bulk * Construct huge primes and safe primes * Add an undetectable backdoor to a cipher * Defeat hypothetical ultracomputers that could be developed decades from now * Construct 30 unbreakable ciphers Secret Key Cryptography gives you a toolbox of cryptographic techniques and Secret Key methods. The book's simple, non-technical language is easy to understand and accessible for any reader, even without the advanced mathematics normally required for cryptography. You'll learn how to create and solve ciphers, as well as how to measure their strength. As you go, you'll explore both historic ciphers and groundbreaking new approachesincluding a never-before-seen way to implement the uncrackable One-Time Pad algorithm.