User:Cmavr8/Books/Cryptography 1 Study Companion
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Cryptography 1 Study Companion
Notes to help with Crypto 1 homeworks and exams
- Class 1
- Symmetric-key algorithm
- Public-key cryptography
- Data Encryption Standard
- Triple DES
- Advanced Encryption Standard
- Caesar cipher
- Class 2
- Hash function
- Cryptographic hash function
- Collision resistance
- Birthday problem
- Preimage attack
- Collision attack
- Merkle–Damgård construction
- Message authentication code
- Digital signature forgery
- Chosen-plaintext attack
- Hash-based message authentication code
- MD5
- Class 3
- Stream cipher
- Block cipher
- Block cipher mode of operation
- Cryptanalysis
- Linear cryptanalysis
- Differential cryptanalysis
- Class 4
- Prime number
- Finite field
- Unit (ring theory)
- Ring (mathematics)
- Cyclic group
- Characteristic (algebra)
- Abelian group
- Greatest common divisor
- Euclidean algorithm
- Extended Euclidean algorithm
- Poly1305-AES
- Class 5
- Diffie–Hellman key exchange
- DLP
- Generating set of a group
- Class 6
- Irreducible polynomial
- Factorization of polynomials over finite fields
- Binomial theorem
- Class 7
- ElGamal encryption
- Monic polynomial
- Homomorphic encryption
- Baby-step giant-step
- Pohlig–Hellman algorithm
- Class 8
- Pollard's rho algorithm
- Pollard's rho algorithm for logarithms
- Index calculus algorithm
- Class 9
- L-notation
- General number field sieve
- Edwards curve
- Class 10
- Twisted Edwards curve
- Elliptic curve
- Homogeneous coordinates
- Montgomery curve
- Class 11
- Class 12
- Euler's theorem
- Euler's totient function
- RSA (cryptosystem)
- Optimal asymmetric encryption padding
- Class 13
- Primality test
- Sieve of Eratosthenes
- Fermat primality test
- Miller–Rabin primality test
- var
- Chinese remainder theorem