Start free trial
Trending New Genres Authors
EnglishEnglish
EspañolSpanish
简体中文Chinese
繁體中文Chinese (Traditional)
FrançaisFrench
DeutschGerman
日本語Japanese
PortuguêsPortuguese
ItalianoItalian
한국어Korean
РусскийRussian
NederlandsDutch
العربيةArabic
PolskiPolish
हिन्दीHindi
Tiếng ViệtVietnamese
SvenskaSwedish
ΕλληνικάGreek
TürkçeTurkish
ไทยThai
ČeštinaCzech
RomânăRomanian
MagyarHungarian
УкраїнськаUkrainian
IndonesiaIndonesian
DanskDanish
SuomiFinnish
БългарскиBulgarian
עבריתHebrew
NorskNorwegian
HrvatskiCroatian
CatalàCatalan
SlovenčinaSlovak
LietuviųLithuanian
SlovenščinaSlovenian
СрпскиSerbian
EestiEstonian
LatviešuLatvian
فارسیPersian
മലയാളംMalayalam
தமிழ்Tamil
اردوUrdu
Searching...
SoBrief
Cryptography

Cryptography

A Very Short Introduction
A cipher can be mathematically unbreakable and still fail. What does real security depend on?
by Fred C. Piper 2002 160 pages
3.56
500+ ratings
Listen
Immersive
V2.3
Amazon Kindle Audible
Try Full Access for 3 Days
Unlock listening & more!
Continue

Key Takeaways

Treat cryptography as trust engineering, not merely message hiding

Privacy is only the beginning. Encryption turns readable plaintext into ciphertext so an interceptor cannot understand a message without the right key. But digital life also needs ways to detect changes, verify who sent something, and prevent a sender from denying a transaction. The book traces this broader role to the shift from paper business, where people could recognize faces and inspect signatures, to remote communication, where those social assurances disappear.

Trust needs several mechanisms. In 1976, Diffie and Hellman proposed using cryptography to support electronic signatures, extending its role beyond secrecy. A confidential email and a signed financial instruction have different security needs. Cryptography can help with both, but no single operation automatically provides every kind of assurance.

Analysis

What's striking is the move from protecting a message to structuring a relationship between people who cannot see each other. That is a useful systems perspective: secrecy, integrity, and identity are separate properties, and a design can provide one while failing at another. The distinction also discourages a common category error, such as assuming that an encrypted message must be authentic. Cryptography cannot supply social trust by itself; it can only make specific claims verifiable under agreed rules.

Design as if attackers know every algorithmic detail

Keep the key secret. A sound design assumes an attacker knows the cipher algorithm, has collected substantial ciphertext, and may know some matching plaintext. These are the book's worst-case conditions. They reflect realistic possibilities: messages travel over channels that can be observed, and predictable phrases can sometimes reveal what a message says.

Security has a time limit. The desired cover time is how long information must remain protected. A tactical message needed for minutes does not demand the same protection as medical records or government secrets that may matter decades later. Designers should compare that lifetime with the time and resources an attacker might need. Security is not a permanent label attached to an algorithm; it is a judgment about a particular system and purpose.

Analysis

This is a practical version of adversarial thinking: assess a system from the perspective of someone who knows its design and has a reason to attack it. It also resembles safety engineering, where acceptable risk depends on the harm and exposure period, not on whether a component sounds advanced. The useful caution is that estimating attacker resources is uncertain. A prudent design therefore needs margin, especially when disclosure could remain damaging long after the system is retired.

A vast keyspace cannot conceal patterns the message itself reveals

Language leaves fingerprints. A simple substitution cipher replaces each letter with a different letter. There are 26! possible keys, an enormous number, yet long English messages still reveal their structure. In a sample of more than 300,000 characters, E made up about 12.7 percent of the text and T about 9 percent. A substitution preserves those frequency patterns, merely attaching them to different letters. Common sequences such as THE offer further clues.

Repeating keys leave rhythms. The Vigenère Cipher applies a rotating sequence of substitutions. It blurs letter frequencies, but a short repeated keyword creates recurring patterns. The Kasiski test looks for repeated ciphertext strings and uses the distances between them to infer the key's period. The lesson is that apparent complexity does not defeat statistical structure.

Analysis

The historical examples teach a durable principle from information theory: natural language is redundant, and redundancy helps readers understand messages but also helps attackers recover them. The same structural clue can be an aid to communication and a vulnerability in a cipher. This does not mean that patterns always yield an easy break; message length, content, and context matter. It does mean that security must be evaluated against the information the plaintext naturally exposes, not just the count of possible keys.

The one-time pad is unbreakable only when its key is truly one-use

Perfect secrecy is a precise guarantee. A system has perfect secrecy when seeing its ciphertext provides no information about which plaintext was sent. The one-time pad achieves this when it uses a genuinely random key at least as long as the message, keeps that key secret, and never reuses it. The receiver combines the same key with the ciphertext to recover the original message.

The key becomes the burden. A key as long as every message must reach the receiver securely. If the only channel is the one being protected, the key itself needs protection, creating a distribution problem. The book describes secure couriers and physical storage as possible solutions for special cases, but the amount of key material makes this impractical for most busy networks. The strongest theoretical guarantee can be a poor operational choice.

Analysis

The one-time pad is a clean example of a broader engineering tradeoff: a guarantee can be mathematically perfect while its supporting process is fragile or costly. It shifts the security problem from clever encryption to the production, transport, storage, and destruction of vast quantities of secret material. That distinction is valuable well beyond cryptography. A system's real security is bounded by its least manageable dependency, not by the elegance of its core theorem.

Never encrypt repeated blocks independently when patterns or tampering matter

Modern ciphers handle bits. Unlike pencil-and-paper substitutions, modern algorithms usually convert text into binary data and process it as a stream of bits or as fixed-size blocks. In Electronic Code Book mode, each block is encrypted separately. Equal plaintext blocks therefore produce equal ciphertext blocks, exposing repetition and potentially helping an attacker build a dictionary of known pairs.

Link blocks together. Cipher Block Chaining mode combines each plaintext block with the previous ciphertext block before encryption. An initialization value can be used for the first block. This makes each encrypted block depend on the message's earlier blocks, obscuring repeated patterns and making rearrangement less useful to an attacker. The choice of mode matters: a strong algorithm used in a revealing mode can still leak information.

Analysis

This example separates the strength of a primitive from the security of its use. It is a systems lesson: a component can work exactly as designed and still expose structure because the surrounding protocol handles data poorly. Chaining reduces particular risks, but it should not be mistaken for a universal guarantee against every form of tampering. Security depends on the complete construction, including how initialization values, keys, and message boundaries are handled.

Use encryption, hashes, MACs, and signatures for distinct security jobs

Different tools answer different questions. Encryption hides content, while a hash function compresses input of any length into a fixed-size fingerprint. Because many messages must share the limited set of possible fingerprints, collisions are inevitable; a secure design makes it impractical to find useful collisions. Hashes can help represent messages, but a plain hash does not prove who created one.

Keys add assurance. A Message Authentication Code, or MAC, combines a message with a shared secret key to help detect alteration and confirm that the message came from someone who knows that key. A digital signature uses a private key to sign and a corresponding public key to verify. Unlike a shared-key MAC, a signature can help resolve disputes between sender and receiver. Choosing the tool begins with naming the property the system needs.

Analysis

The distinctions resemble measurement in science: a test is only meaningful when it is designed to answer the right question. Confidentiality is not integrity, and integrity is not proof of authorship. The book's taxonomy helps prevent security theater, where encryption is added simply because it sounds protective. There is a limit, though: even a correctly selected mechanism depends on sound key handling and trustworthy implementation. A label such as signature or MAC does not certify the whole process.

Public keys remove shared-secret barriers, but not the need to verify identity

Send without a pre-shared secret. In public-key cryptography, a person publishes an encryption key while keeping its matching decryption key private. Others can use the public key without learning the secret needed to read the result. The book illustrates the idea with a locked briefcase: sender and recipient add and remove their own padlocks in sequence, so neither has to hand over a key.

A public key needs an owner. The briefcase analogy exposes a weakness: an impostor might substitute a different padlock. In digital systems, a Certification Authority issues a certificate that links a person's identity to a public key. The recipient must trust the authority's public key and its identity-checking process. Without that authentication, an attacker can pose as each side and establish separate keys with both.

Analysis

Public-key cryptography changes the logistics of trust rather than eliminating trust. It makes it possible to communicate without first arranging a shared secret, but it relocates the hard question to identity verification and institutional credibility. This is a powerful design pattern: infrastructure often solves one coordination problem by creating a new governance problem. Certificates are useful only to the extent that users can verify their chain and have reason to trust the institutions that issued it.

Treat key management as the infrastructure behind every strong cipher

Protect keys throughout their lives. Key management covers generation, distribution, storage, use, change, and destruction. A brilliant algorithm is useless if an attacker finds its key written on a laptop, intercepts it during delivery, or recovers it after deletion. Some systems divide a key into components so that one person or device cannot expose it alone. Others use a hierarchy, where a master key protects keys used for routine transactions.

Plan for change and loss. Keys need monitoring, replacement after suspected compromise, and secure destruction when no longer needed. Backups can prevent permanent loss of encrypted data, but they also create additional copies that must be protected. In a network, trusted centres may help users establish keys, reducing the number of manual exchanges. Each convenience creates responsibilities and a possible point of failure.

Analysis

Key management is the operational core of cryptography because it converts mathematical possibility into repeatable organizational practice. Its lifecycle view is especially valuable: security is not a one-time setup but a sequence of custody decisions. Secret sharing and key hierarchies distribute risk, although they also add procedural complexity and potential human error. The strongest design is not necessarily the most elaborate one; it is the one whose handling rules people can reliably follow.

Judge cipher strength by cover time and real attack costs

Technology changes the threshold. In 1998, the Electronic Frontier Foundation built a machine for about $250,000 that was expected to search the 56-bit DES key space in roughly five days. A combined hardware and internet effort found a DES key in less than a day in 1999. These events made concrete how quickly a once widely used algorithm could become vulnerable to exhaustive search.

Public-key systems face different attacks. RSA security depends on the difficulty of factoring a large number, so improvements in mathematics matter as well as faster computers. A 512-bit RSA challenge number was factored in 1999 using the General Number Field Sieve and distributed computing. At the time of the book, AES had a minimum key size of 128 bits. These examples show why security needs periodic reassessment.

Analysis

The history of DES demonstrates that security claims are time-indexed. A design that once seemed costly to attack can become routine as hardware and distributed computation improve. Public-key systems add another complication: mathematical advances can shift the practical boundary without any dramatic hardware breakthrough. The useful response is neither panic nor blind confidence, but planned review tied to the value and lifetime of protected data. A book published in 2002 offers enduring reasoning, not current algorithm-selection advice.

A four-digit PIN can lose to guessing before encryption is broken

Encryption does not prevent guesses. An ATM may encrypt a customer's PIN while sending it to a bank's computer, protecting it from people who intercept the communication. But a four-digit PIN has at most 10,000 possibilities. Someone holding a stolen card could simply try candidate numbers, without attacking the encryption algorithm.

Limit attempts as well as exposure. The book describes machines that retain a card after three incorrect entries. This does not make guessing impossible in every context, but it limits how much an attacker can gain from repeated trials. The example captures a central boundary of cryptography: it protects information in transit or storage, but cannot by itself control what a person can attempt at a physical device.

Analysis

The ATM example is a compact lesson in defense in depth. Encryption protects one path of attack, while attempt limits address another. Good security design asks what an adversary can do after bypassing or avoiding a particular safeguard, rather than treating a protected channel as the whole problem. The tradeoff is usability: strict limits can inconvenience legitimate customers who mistype a PIN. Security measures must therefore account for both attack cost and ordinary human error.

Analysis

This book's most useful contribution is not a catalog of ciphers, but a change in what readers think a cipher accomplishes. It begins with the familiar desire to seal a message, then widens the problem to identity, integrity, dispute resolution, and the custody of keys. That progression matters because many security failures are not failures of mathematics. They arise when a system encrypts the wrong data, authenticates only one participant, allows replay, or leaves keys exposed.

The historical examples make abstract design principles legible. Caesar shifts and substitution ciphers show that a huge set of possible keys can coexist with an easy attack when language leaks statistical structure. The one-time pad then supplies the opposite lesson: a rigorous guarantee may impose costs so severe that it is unsuitable for everyday use. Together, these cases resist the comforting idea that security is simply a matter of choosing a stronger cipher.

The book is strongest when it treats cryptography as a component of system design. Its discussion of certificates, trusted centres, key hierarchies, and the ATM PIN demonstrates that security depends on organizations, hardware, and human procedures as much as on algorithms. The user does not need to become a mathematician to understand why key distribution can be harder than encryption, or why identifying a public key's owner is a distinct problem from using that key.

Its technical examples are anchored in the early 2000s. DES, the state of factoring, and the then-new AES standard should be read as historical evidence about changing attack costs, not as present-day recommendations. That date-bound detail does not weaken the central framework. The enduring question is whether a particular mechanism protects the particular property required, against a plausible attacker, for the full period that protection matters. The book's lasting value is teaching readers to ask that question before trusting the word secure.

Summary in 30 Seconds
Cryptography protects more than privacy: encryption hides content, hashes detect changes, message authentication codes confirm shared-secret possession, and digital signatures link messages to private keys. Cipher strength depends on the attacker's resources and how long data needs protection. Patterns in messages can undermine enormous keyspaces, while one-time pads require random, secret keys used only once. Key custody, identity checks, and limits on guessing matter as much as the algorithm.
Contains spoilers

Last updated:

Report Issue

Review Summary

3.56 out of 5
Average of 500+ ratings from Goodreads and Amazon.

Cryptography receives mixed reviews, with an average rating of 3.57/5. Readers appreciate its historical overview and basic explanations but find later chapters challenging for beginners. The book is praised for its concise introduction to cryptography fundamentals, though some note it's outdated. Positive aspects include insights into practical applications and security concepts. Criticisms focus on the book's difficulty level, lack of updated content, and occasional editing issues. Overall, it's considered a good starting point for those with some technical background but may be too complex for complete novices.

Your rating:
4.21
117 ratings
Want to read the full book?

Glossary

Perfect secrecy

Ciphertext reveals no message information

A cipher has perfect secrecy when observing its ciphertext gives an attacker no information about which plaintext was sent. The one-time pad can achieve this if its key is truly random, at least as long as the message, kept secret, and used only once. The guarantee concerns the cipher's information leakage, not the practicality of managing its keys.

One-time pad

A single-use random key

An encryption method that combines each message symbol or bit with a corresponding random key symbol or bit. The key is at least as long as the message and must never be reused. Under those conditions it provides perfect secrecy, but its large key-distribution and storage demands make it impractical for most communication networks.

Vigenère Cipher

A repeating sequence of substitutions

A historical polyalphabetic cipher that uses a keyword to select a repeating sequence of Caesar-style letter shifts. The shifting disguises the simple letter frequencies that expose monoalphabetic substitution, but a short repeating key leaves patterns that can be used to infer its period and recover the message.

Kasiski test

Finds repeating-key periods

A method for attacking periodic polyalphabetic ciphers such as the Vigenère Cipher. It searches ciphertext for repeated strings and measures the distances between their occurrences. If the repeated strings came from identical plaintext encrypted at matching key positions, those distances are likely to be multiples of the key period.

Electronic Code Book mode

Encrypts blocks independently

A way to use a block cipher in which each plaintext block is encrypted independently with the same key. Identical plaintext blocks therefore produce identical ciphertext blocks, revealing repeated structure. The book contrasts this simplicity with modes that link each block to previous ciphertext.

Cipher Block Chaining mode

Links each block to its predecessor

A block-cipher mode in which each plaintext block is combined with the previous ciphertext block before encryption. An initialization value can be used for the first block. This dependence conceals repeated plaintext blocks more effectively than independent block encryption and makes message order matter.

Hash function

Produces a fixed-size message fingerprint

A function that accepts data of arbitrary length and produces a value of fixed length, often called a hash, digest, or digital fingerprint. Since the output space is limited, different inputs must sometimes produce the same result, a situation called a collision. Cryptographic hash functions are designed to make useful collisions difficult to find.

Message Authentication Code

Keyed message integrity check

A short value calculated from a message and a shared secret key. The receiver uses the same key and method to check whether the message was altered and whether it came from someone who knows the key. Because sender and receiver share the key, a MAC alone cannot settle a dispute between them about who created the message.

Digital signature

Publicly verifiable message attestation

A cryptographic value created using a sender's private key and checked with the corresponding public key. A signature can help establish message integrity and origin without requiring sender and receiver to share a secret. It is commonly calculated from a hash of the message, which makes signing large messages more efficient.

Public Key Infrastructure

System for trusted public keys

An organizational and technical system for creating, issuing, checking, and revoking certificates that connect identities to public keys. It can involve Certification Authorities, registration processes, certificate status services, and chains of trust. A PKI helps users authenticate public keys, but relies on confidence in the authorities and their procedures.

Cover time

Required protection period

The length of time information must remain protected from an attacker. The appropriate security level depends partly on this duration: a message useful for only minutes may need less protection than medical, financial, or government information that could remain sensitive for decades.

Key-encrypting key

Protects other cryptographic keys

A key used to encrypt or otherwise protect other keys, rather than directly protecting ordinary data. Key-encrypting keys form levels in a key hierarchy, allowing working or session keys to be distributed electronically while the higher-level key remains more carefully protected.

About the Author

Fred Piper is an expert in cryptography and information security. He has authored several books on the subject, including the "Very Short Introduction" series title on cryptography. Piper's work focuses on making complex cryptographic concepts accessible to a wider audience. He has a background in mathematics and has contributed significantly to the field of cryptography education. Piper's approach combines historical context with modern applications, helping readers understand the evolution and importance of cryptographic systems. His expertise is evident in his ability to explain technical concepts in a relatively clear manner, though some readers find his explanations challenging at times.

Download PDF

To save this Cryptography summary for later, download the free PDF. You can print it out, or read offline at your convenience.
Download PDF
File size: 0.36 MB     Pages: 17

Download EPUB

To read this Cryptography summary on your e-reader device or app, download the free EPUB. The .epub digital book format is ideal for reading ebooks on phones, tablets, and e-readers.
Download EPUB
File size: 1.45 MB     Pages: 20
Want to read the full book?
Follow
Listen
Home
Swipe
Library
Get App
Try Full Access for 3 Days
Listen, bookmark, and more
Compare Features Free Pro
📖 Read Summaries
Read unlimited summaries. Free users get 3 per month
🎧 Listen to Summaries
Listen to unlimited summaries in 40 languages
—
❤️ Unlimited Bookmarks
Free users are limited to 4
—
📜 Unlimited History
Free users are limited to 4
—
📥 Unlimited Downloads
Free users are limited to 1
—
Risk-Free Timeline
Today: Get Instant Access
Listen to full summaries of 26,000+ books. That's 12,000+ hours of audio!
Day 2: Trial Reminder
We'll send you a notification that your trial is ending soon.
Day 3: Your subscription begins
You'll be charged on Nov 24,
cancel anytime before.
Consume 2.8× More Books
2.8× more books Listening Reading
Our users love us
1M+ readers
Trustpilot Rating
TrustPilot
4.6 Excellent
This site is a total game-changer. I've been flying through book summaries like never before. Highly, highly recommend.
— Dave G
Worth my money and time, and really well made. I've never seen this quality of summaries on other websites. Very helpful!
— Em
Highly recommended!! Fantastic service. Perfect for those that want a little more than a teaser but not all the intricate details of a full audio book.
— Greg M
Save 62%
Yearly
$119.88 $44.99/year/yr
$3.75/mo
Monthly
$9.99/mo
Start a 3-Day Free Trial
3 days free, then $44.99/year. Cancel anytime.
Unlock a world of fiction & nonfiction books
26,000+ books for the price of 2 books
Read any book in 10 minutes
Discover new books like Tinder
Request any book if it's not summarized
Read more books than anyone you know
#1 app for book lovers
Lifelike & immersive summaries
30-day money-back guarantee
Download summaries in EPUBs or PDFs
Cancel anytime in a few clicks

Why one summary?

Scanner
Find a barcode to scan

⭐
⭐
⭐
We have a special gift for you
Open
38% off
DISCOUNT FOR YOU
⭐
⭐
⭐
$79.99
$49.99/year
Only $4.16 per month
Continue
2 taps to start, super easy to cancel
Settings
General
Widget
Loading...