Mathematics of Secrets | Agenda Bookshop Skip to content
A01=Joshua Holden
Affine cipher
Age Group_Uncategorized
Age Group_Uncategorized
Alice and Bob
Author_Joshua Holden
Autokey cipher
automatic-update
Block cipher
Block cipher mode of operation
Block size (cryptography)
Category1=Non-Fiction
Category=GPJ
Category=PBX
Category=URY
Chosen-ciphertext attack
Chosen-plaintext attack
Cipher
Ciphertext
Communication Theory of Secrecy Systems
Computational problem
Confusion and diffusion
COP=United States
Correlation attack
Craig Gentry (computer scientist)
Cryptanalysis
Cryptogram
Cryptographic engineering
Cryptographic hash function
Cryptography
Cryptography Research
Cryptosystem
Data Encryption Standard
Delivery_Delivery within 10-20 working days
Differential cryptanalysis
Diffie–Hellman key exchange
Disquisitiones Arithmeticae
ElGamal encryption
Elliptic curve cryptography
Encryption
Enigma machine
eq_computing
eq_isMigrated=2
eq_non-fiction
Fast Software Encryption
Feistel cipher
Fermat's little theorem
Hill cipher
Homomorphic encryption
Hyperelliptic curve cryptography
International Association for Cryptologic Research
Key (cryptography)
Key size
Keystream
Known-plaintext attack
Language_English
Linear cryptanalysis
Mathematical problem
Mathematician
Mathematics
Mental poker
Merkle's Puzzles
Monte Carlo algorithm
NSA Suite B Cryptography
PA=Available
Permutation
Plaintext
Polyalphabetic cipher
Post-quantum cryptography
Price_€10 to €20
Probabilistic encryption
PS=Active
Public-key cryptography
Quantum cryptography
Quantum key distribution
Related-key attack
RSA (cryptosystem)
RSA problem
S-box
Security level
Sign (mathematics)
softlaunch
Spyware
Stream cipher
Substitution cipher
Transposition cipher
Variable (computer science)
Vigenère cipher
Vulnerability (computing)

Mathematics of Secrets

English

By (author): Joshua Holden

Explaining the mathematics of cryptography

The Mathematics of Secrets takes readers on a fascinating tour of the mathematics behind cryptography—the science of sending secret messages. Using a wide range of historical anecdotes and real-world examples, Joshua Holden shows how mathematical principles underpin the ways that different codes and ciphers work. He focuses on both code making and code breaking and discusses most of the ancient and modern ciphers that are currently known. He begins by looking at substitution ciphers, and then discusses how to introduce flexibility and additional notation. Holden goes on to explore polyalphabetic substitution ciphers, transposition ciphers, connections between ciphers and computer encryption, stream ciphers, public-key ciphers, and ciphers involving exponentiation. He concludes by looking at the future of ciphers and where cryptography might be headed. The Mathematics of Secrets reveals the mathematics working stealthily in the science of coded messages.

A blog describing new developments and historical discoveries in cryptography related to the material in this book is accessible at http://press.princeton.edu/titles/10826.html.

See more
€19.99
A01=Joshua HoldenAffine cipherAge Group_UncategorizedAlice and BobAuthor_Joshua HoldenAutokey cipherautomatic-updateBlock cipherBlock cipher mode of operationBlock size (cryptography)Category1=Non-FictionCategory=GPJCategory=PBXCategory=URYChosen-ciphertext attackChosen-plaintext attackCipherCiphertextCommunication Theory of Secrecy SystemsComputational problemConfusion and diffusionCOP=United StatesCorrelation attackCraig Gentry (computer scientist)CryptanalysisCryptogramCryptographic engineeringCryptographic hash functionCryptographyCryptography ResearchCryptosystemData Encryption StandardDelivery_Delivery within 10-20 working daysDifferential cryptanalysisDiffie–Hellman key exchangeDisquisitiones ArithmeticaeElGamal encryptionElliptic curve cryptographyEncryptionEnigma machineeq_computingeq_isMigrated=2eq_non-fictionFast Software EncryptionFeistel cipherFermat's little theoremHill cipherHomomorphic encryptionHyperelliptic curve cryptographyInternational Association for Cryptologic ResearchKey (cryptography)Key sizeKeystreamKnown-plaintext attackLanguage_EnglishLinear cryptanalysisMathematical problemMathematicianMathematicsMental pokerMerkle's PuzzlesMonte Carlo algorithmNSA Suite B CryptographyPA=AvailablePermutationPlaintextPolyalphabetic cipherPost-quantum cryptographyPrice_€10 to €20Probabilistic encryptionPS=ActivePublic-key cryptographyQuantum cryptographyQuantum key distributionRelated-key attackRSA (cryptosystem)RSA problemS-boxSecurity levelSign (mathematics)softlaunchSpywareStream cipherSubstitution cipherTransposition cipherVariable (computer science)Vigenère cipherVulnerability (computing)
Delivery/Collection within 10-20 working days
Product Details
  • Dimensions: 155 x 235mm
  • Publication Date: 02 Oct 2018
  • Publisher: Princeton University Press
  • Publication City/Country: US
  • Language: English
  • ISBN13: 9780691183312

About Joshua Holden

Joshua Holden is professor of mathematics at the Rose-Hulman Institute of Technology.

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept