Professional Documents
Culture Documents
Sidra Malik
MS(Computer and Communication Security)
NUST School of Electrical Engineering and Computer Science
Outline
y Basic Idea y Characteristics of Proposed Idea y Description of a Single Round Cipher
y Encryption Example y Decryption Example
12/20/2011
Basic Idea
y What is a Transposition Cipher?
y a method of encryption by which the positions held by units of
plaintext (the text needed to be hidden) are shifted, so that the ciphertext constitutes a permutation of the plaintext. y In other words,
y Simply the order of text is changed.
y Contribution
y A new transposition/ordering scheme is proposed which is based on
12/20/2011
scheme
y Which is a process which consists of
substitution and transposition mainly. These methods can be applied in any order followed.
y one or more rounds of encryption (if the
12/20/2011
Characteristics of Crypt21
y substitution concept borrowed from
Select key
classical ciphers
y transposition based on key matrix and
Find permutations of key and generate a new key
New key
12/20/2011
Rotate previous shifted again, and store all the combinations of key. Calculate new extended key, Nk where
y Nk = Sum(Key) mod Keylength y Out of the previously stored combinations of key, select Nk
y Substitution
y In this step, ciphertext is computed by using new key and plaintext by
12/20/2011
intermediate ciphertext
y The last step is to read the same 1 positioned values row wise to
12/20/2011
permutations of key: XCESSE CESSEX ESSEXC SSEXCE SEXCES y Now consider rst three as 69 mod 6 equals 3 and concatenate them. y NEW KEY: XCESSECESSEXESSEXC
8 A Novel Key-based Transposition Scheme for Text Encryption 12/20/2011
12/20/2011
JQFDQWBQWPWSVMVCZXCSVRWQVEEAPIKKDLUPBO
10
12/20/2011
11
12/20/2011
y P= Maryhadalittlekeyitisallshecouldexport
Iterative Design
y Why iterative?
y General phenomenon that more the rounds of cipher, more
secure it is considered.
y The idea of increasing rounds was to add complexity into
the system so that the overall process is somewhat computationally expensive for brute force attacks.
13
12/20/2011
Iterative Design
y The cipher is extended up to N
14
12/20/2011
compared to previous methods y Frequency analysis is not easy after successive iterations of cipher. y It depends upon the length and value of key letters in original key which determine the extended key i.e. for every key, there is a variable length extended key.Which
15
12/20/2011
key schedule. y A good key schedule however should have the following properties:
y Given all but one of the sub-keys, it is impossible to determine the
remaining sub-key. y Given all of the sub-keys, it is impossible to determine the master key. y Each sub-key bit is a random function of all of the bits of the master key.
16
12/20/2011
derive original key length. y Once, the key length is found, the brute force attack complexity reduces by a large number. y Thus a stronger key schedule may be introduced rather than just a Rotation Function.
17
12/20/2011
classical substitution whereas proposed transposition scheme which is entirely dependent on key.
y Strengths include that it is safe from frequency analysis y and dependant on original key in many ways. y Weaknesses include weak key schedule. y Improvements that can be made in key schedule
y By generating the hash of extended key or using any one way function which
may not yield any related keys. y Future directions are extending this algorithm to bit level values y including ASCII characters in ciphertext as well.
18
12/20/2011