Course Title-Computer Security COURSE CODE-cosc4171 Group Assignment
Course Title-Computer Security COURSE CODE-cosc4171 Group Assignment
COURSE CODE-cosc4171
GROUP ASSIGNMENT
Section C1
1
– C = E(KE, P)
– P = D(KD, E(KE, P))
• Keyless Cipher
– a cipher that does not require the use of a key
• Key cannot be changed
If the encryption algorithm should fall into the interceptor’s hands, future messages can still be kept secret
because the interceptor will not know the key value
Breakable encryption
An encryption algorithm may be breakable, meaning that given enough time and data, an analyst could
determine the algorithm
Practicality is an issue
For a given cipher scheme, there may be 1030 possible decipherments, so the task is to select the
right one out of the 1030
Cryptanalyst cannot be expected to try just the hard, long way
– Another efficient algorithm may exist
• Estimates of breakability are based on current technology
– Budget dependent
Representation of characters
Encoding
Modular arithmetic
• Y + 3 = B (24 + 3 = 27 º 1 mod 26)
• Two forms of encryption
– Substitution: one letter is exchanged for another
– Transposition: the order of the letters is rearranged
Simple substitution
– use a correspondence table
• substitute each character by another character or symbol
2
– Monoalphabetic cipher
• One-by-one