This Web

All Webs

brayden.org

Books RSS

Random RSS

Software RSS

Other

Cryptography

I'm reading an excellent book by Steven Levy entitled Crypto, covering the concept of public-key asymmetric cryptography (Diffie-Hellman ca. 1977) and the RSA (Rivest, Shamir, Adleman) algorithm, and PGP (Phil Zimmerman). ISBN 0140244328

• Cryptography
  • Links
  • Implementations
  • Books
  • Basics
  • RSA
  • Diffie-Hellman Key Exchange
  • Finite-Field Arithmetic
  • Prime Numbers
  • Random Numbers

Links

• A taste of computer security - a very large taste, at kernelthread.com
• Overview of cryptanalysis
• Good crypto links site
• Chaum on untraceable email
• Extensive crypto information
• Ron Rivest
• Simon Singh's home page
• How to Share a Secret - Adi Shamir
• Nick Szabo - lots of articles on distributed secrets and cryptography
• CryptoImplementationNotes
• INTERNATIONAL CRYPTOGRAPHY FREEDOM

Implementations

• Open source AES implementation for Windows

Books

• Google Directory of cryptography books
• Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition, Bruce Schneier
• Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography, Simon Singh
• Cryptography: Theory and Practice, Douglas Stinson

Basics

• Suppose a, b and m are any integers with m not zero, then we say a is congruent to b modulo m if m divides a-b. We write this as a=b (mod m).
• (a1 op a2) mod n = [(a1 mod n) op (a2 mod n)] mod n
• the square of any odd number is 1 modulo 8.
• a = b (mod m) if and only if there is an integer q such that a = b + qm

RSA

Diffie-Hellman Key Exchange

Finite-Field Arithmetic

See: FiniteFieldArithmetic, and http://www.anujseth.com/crypto/ffield.html

Prime Numbers

Random Numbers