The mathematics of secrets : cryptography from Caesar ciphers to digital encryption, Joshua Holden

Resource Information

The instance The mathematics of secrets : cryptography from Caesar ciphers to digital encryption, Joshua Holden represents a material embodiment of a distinct intellectual or artistic creation found in University of San Diego Libraries. This resource is a combination of several types including: Instance, Electronic.

Image

http://images.btol.com/ContentCafe/Jacket.aspx?UserID=USD89598&Password=CC19241&Return=T&Value=9781400885626&Type=L

Label

The mathematics of secrets : cryptography from Caesar ciphers to digital encryption, Joshua Holden

Title remainder

cryptography from Caesar ciphers to digital encryption

Statement of responsibility

Joshua Holden

Instantiates

• The mathematics of secrets : cryptography from Caesar ciphers to digital encryption

Publication

• Princeton, Princeton University Press, 2017

Bibliography note

Includes bibliographical references and index

Carrier category

online resource

Carrier category code

• cr

Carrier MARC source

rdacarrier

Content category

text

Content type code

• txt

Content type MARC source

rdacontent

Contents

• Looking forward
• Polyalphabetic substitution ciphers.
• Homophonic ciphers
• Coincidence or conspiracy?
• Alberti ciphers
• It's hip to be square: Tabula Recta or Vigenère Square ciphers
• How many is many?
• Determining the number of alphabets
• Superman is staying for dinner: superimposition and reduction
• Products of polyalphabetic ciphers
• Introduction to ciphers and substitution.
• Pinwheel machines and rotor machines
• Looking forward
• Transposition ciphers.
• This is Sparta! The Scytale
• Rails and routes: geometric transposition ciphers
• Permutations and permutation ciphers
• Permutation products
• Keyed columnar transposition ciphers
• Determining the width of the rectangle
• Anagramming
• Alice and Bob and Carl and Julius: terminology and Caesar Cipher
• Looking forward
• Ciphers and computers.
• Bringing home the bacon: polyliteral ciphers and binary numerals
• Fractionating ciphers
• How to design a digital cipher: SP-networks and feistel networks
• The data encryption standard
• The advanced encryption standard
• Looking forward
• Stream ciphers.
• Running-key ciphers
• The key to the matter: generalizing the Caesar Cipher
• One-time pads
• Baby you can drive my car: autokey ciphers
• Linear feedback shift registers
• Adding nonlinearity to LFSRs
• Looking forward
• Ciphers involving exponentiation.
• Encrypting using exponentiation
• Fermat's little theorem
• Decrypting using exponentiation
• The discrete logarithm problem
• Multiplicative ciphers
• Composite moduli
• The Euler Phi function
• Decryption with composite moduli
• Looking forward
• Public-key ciphers.
• Right out in public: the idea of public-key ciphers
• Diffie-Hellman key agreement
• Asymmetric-key cryptography
• RSA
• Priming the pump: primality testing
• Affine ciphers
• Why is RSA a (Good) public-key system?
• Cryptanalysis of RSA
• Looking forward
• Other public-key systems.
• The three-pass protocol
• ElGamal
• Elliptic curve cryptography
• Digital signatures
• Looking forward
• The future of cryptography.
• Attack at dawn: cryptanalysis of sample substitution ciphers
• Quantum computing
• Postquantum cryptogaphy
• Quantum cryptography
• Looking forward
• Just to get up that hill: polygraphic substitution ciphers
• Known-plaintext attacks

Control code

ocn972159290

Dimensions

unknown

Extent

1 online resource (xiv, 373 pages)

Form of item

online

Isbn

9781400885626

Media category

computer

Media MARC source

rdamedia

Media type code

• c

Note

JSTOR

Other control number

• 10.1515/9781400885626
• 99974545040

Other physical details

illustrations

http://library.link/vocab/ext/overdrive/overdriveId

984633

Record ID

.b51340410

Specific material designation

remote

System control number

(OCoLC)972159290