






Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Some concept of Cryptography are Block Ciphers, Classical Cryptography, Computational, Cryptanalysis, Digital Signatures, Knowledge Proofs, Number Theory, One Way Functions, Perfect Secrecy, Perfect Secrecy. Main points of this lecture are: Block Ciphers, Modern Ciphers, Successful, Cryptanalytic Techniques, Better Complexity, Encryption Standard, Data Encryption, Successful Relative, Resistant Relative, Advanced Encryption Standard
Typology: Slides
1 / 12
This page cannot be seen from the preview
Don't miss anything!
2
Modern ciphers considered successful if all (publicly) known cryptanalytic techniques cannot succeed with better complexity than a brute-force key search.
Data Encryption Standard (DES)
successful relative 56-bit key
CPA-resistant relative 55-bit key
key-size now too small - “retired”
Advanced Encryption Standard (AES)
key-sizes 128, 192, and 256 bits
4
INPUT: plaintext x , key K OUTPUT: ciphertext y = ASSUMED: round function g , last round h , key scheduling procedure giving for i = 1 to
i
0
i
i − 1
i
Nr − 1
Nr − 1
5
A substitution is a pre-defined random- looking function from length l bitstrings to length k bitstrings
Stinson defines l=k and insists that the function be bijective - I won’t
Defined using S-boxes on substrings of input - so very efficient in hardware
Notation
S-box:
Resulting substitution:
( 1 )
( 2 )
( m )
7
Define substitution from predefined S-box
Predefined permutation
Round function:
Final round - no permutation + whitening:
i
i
Nr − 1
Nr
8
Each round breaks intermediate ciphertext into left and right halves
Expansion applied near start of round
Contracting substitution applied mid-round
Permutation applied near end of round
Round function:
Beginning and end slightly different
Apply “initial permutation” IP at start
Apply swap and at end (no key):
i
i L
i R
i
i
− 1
− 1
10
ECB - Electronic Code Book
Name for doing nothing after encrypting
Fails message-indistinguishibility
Motivates need for randomization in other three modes
Technically, CBC, CFB, OFB are “stream” ciphers
11
First block = rand. initialization vector (IV)
Cipher block formula: