-
cryptanalysis (ניתוח הצפנה)
- brute-force attack (or exhaustive key search)
-
cipher (or cypher) (צופן)
-
key (מפתח הצפנה)
-
encryption (הצפנה)
-
decryption (פענוח)
-
plaintext (טקסט גלוי)
-
ciphertext (טקסט מוצפן)
-
cryptographic primitives
-
Kerckhoffs’s principle
- Shannon’s maxim: The enemy knows the system
-
known-plaintext attack (KPA) (התקפת גלוי-ידוע)
-
ciphertext-only attack (COA) (or known ciphertext attack)
-
chosen-plaintext attack (CPA) (התקפת גלוי-נבחר)
-
side-channel attack
Key exchange
- Diffie–Hellman (DH) key exchange
- Alice and Bob publicly agree on a prime and a base (which is a primitive root modulo )
- Alice’s private key:
- Bob’s private key:
- Alice’s public key:
- Bob’s public key:
- Secret shared key:
Symmetric cryptography
- symmetric-key (or symmetric) cryptography
- shared key (or secret key)
Block ciphers
- block cipher
- plaintext of size bits (block size)
- key of size (key size)
- key space:
- ciphertext of size bits
- encryption function:
- decryption function:
-
- block cipher mode of operation
- electronic codebook (ECB)
- cipher block chaining (CBC)
- initialization vector (IV)
- counter mode (CTR)
Stream cipher
- stream cipher
examples
- Data Encryption Standard (DES)
- Advanced Encryption Standard (AES)
- ChaCha20
- authenticated encryption (AE)
- authenticated encryption with associated data (AEAD)
Asymmetric cryptography
-
public-key (or asymmetric) cryptography
- public key
- private key
-
RSA (Rivest–Shamir–Adleman) cryptosystem
-
privacy-enhanced mail (PEM)
-
Edwards-curve Digital Signature Algorithm (EdDSA)
- Ed25519
-
Elliptic Curve Digital Signature Algorithm (ECDSA)
-
Digital Signature Algorithm (DSA)
-
Elliptic-curve cryptography (ECC)
-
Elliptic-curve Diffie–Hellman (ECDH)
-
Public Key Cryptography Standards (PKCS)
- PKCS #1
- PKCS #8
-
SHA-2 (Secure Hash Algorithm 2)
- SHA-256
CHF
- A cryptographic hash function (CHF) is a hash function that satisfies the following properties:
- (pre-image resistance) for a given hash value , it is computationally infeasible to find any input such that
- (second pre-image resistance) for a given input , it is computationally infeasible to find another input such that and
- (collision resistance) it is computationally infeasible to find any two distinct inputs and such that
- The output of a CHF is called the message digest (or hash value) of the input message.
Digital signature
- digital signature
- using message digest (MD)
- given:
- both sender and receiver know the CHF
- the sender has a public-private key pair: for encryption/decryption functions and (such that for any message )
- sender:
- (plaintext)
- (message digest)
- (signature)
- (sends to receiver)
- receiver:
- computes
- computes
- verifies that
- given:
- using message digest (MD)
Public key infrastructure
-
public key infrastructure (PKI)
-
registration authority (RA)
-
validation authority (VA)
-
certificate authority (or certification authority) (CA) (רשות אישורים, רשות אישור)
-
public-key certificate (or digital certificate or identity certificate) – binds a public key to an identity
- X.509
- domain validated certificate (DV)
-
certificate signing request (CSR or certification request) – “a message sent from an applicant to a CA of the PKI in order to apply for a digital certificate”
-
cryptographic protocol
- Transport Layer Security (TLS)
-
see also:
- Certificate Authority Authorization (CAA)
Classical ciphers
- substitution cipher
- Caesar cipher (or shift cipher)
- one-time pad (OTP)