CSCL Unit 1
CSCL Unit 1
Code: 8FC08
Course Objectives:
• To learn fundamentals of cryptography and its application to network security.
• To understand network security threats, security services, and countermeasures.
• To learn computer security, Internet, E-commerce and E-governance with reference to Free
• Market Economy
• To learn International Efforts relating to Cyberspace laws and Cyber crimes
• To learn Law relating to electronic records and intellectual property rights in India
• To understand ethical laws of computer for different countries.
• To learn Penalties, Compensation and Offences under the Cyberspace and Internet in India
• To learn Miscellaneous provisions of IT Act and Conclusions
•
Course Outcomes:
• At the end of this course the student will be able to
• Familiarize the cryptographic procedures and Understand its primitives
• Outline Security policy in Legislation and Comprehend E-Commerce frame work, modelsand its
associated threats
• Justify the role of electronic signatures in E-Commerce and summarize the various laws relating to
it.
• Categorize international cyber laws and cybercrimes.
• Explore Penalties, Compensation and Adjunction of violations of provisions of IT Act 2000
• Classify and Outline theoffences under the Cyberspace law and the Internet in India
UNIT-I
Introduction to cyber Security, cryptography, Types of Attacks, Secrete Key Cryptography
Introduction: Cyber-attacks, Defense Strategies and Techniques ,Mathematical background for
Cryptography: Modulo arithmetic, The greatest common divisor, Useful Algebraic Structures, Chinese
Remainder Theorem. Basics of Cryptography: Secret versus Public key Cryptography, Types of attacks,
Elementary substitution Ciphers, Elementary Transposition Ciphers, Other Cipher Properties Secrete Key
Cryptography: Product Ciphers, DES Construction, Modes of Operation, MAC and other Applications,
Attacks, Linear Crypt analysis.
UNIT-II
Introduction to Computer Security, Internet, E-commerce and E-governance with reference to Free
Market Economy
Definition, Threats to security, Government requirements, Information Protection and Access Controls,
Computer security efforts, Standards, Computer Security mandates and legislation, Privacy considerations,
International security activity, Conceptual Framework of E-commerce: governance, the role of Electronic
Signatures in E-commerce with Reference to Free Market Economy in India.
UNIT-III
Law relating to electronic records and intellectual property rights in India
Legal aspects of Electronic records / Digital signatures, Cyber laws, the roles and regulations of Certifying
Authorities in India, Protection of Intellectual Property Rights in Cyberspace in India.
UNIT-IV
International Efforts relating to Cyberspace laws and Cyber crimes
International efforts related to Cyber laws, Council of Europe (COE) convention on Cyber Crimes.
UNIT-V
Penalties, Compensation
Penalties, Compensation and Adjunction of violations of provisions of IT Act 2000 and judicial
review.
UNIT-VI
Offences under the Cyberspace, Internet in India and Miscellaneous provisions of IT Act and
Conclusions
Some important offences under the Cyberspace law and the Internet in India, Other offences under
the Information Technology Act in India, The role of Electronic Evidence and miscellaneous
provisions of the IT Act.
TEXT BOOK:
1. Network security and Cryptography by Bernard Menezes CENGAGE Learning Publications,
2010.
2. Cyber Laws and IT Protection, Harish Chander, PHI, 2012
Introduction to cyber Security, cryptography, Types of Attacks, Secrete Key Cryptography
d = n*q + r
d integer
n +ve integer
q quotient
r remainder
1.3.2 The greatest common divisor
The greatest common divisor (GCD) of two or more integers, which are not all zero,
Is the largest positive integer that divides each of the integers.
For two integers x, y, the greatest common divisor of x and y is denoted gcd(x,y).
For example, the GCD of 8 and 12 is 4, that is, gcd(8,12)=4.
Euclids Algorithm: Used to find gcd of 2 integers
Step 1. Divide the larger number by the smaller one:
161 = 112 * 1 + 49
Step 2. Divide the smaller number by the above operation's remainder:
112 =49 * 2 + 14
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
49 =14 * 3 + 7
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
14 = 7* 2 + 0
At this step, the remainder is zero, so we stop
7 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
1.3.3 Useful Algebraic Structures
• Algebraic structure consists of a set together with one or more binary operations,
which are required to satisfy certain axioms.
Groups
A group is an algebraic structure with a single operation, as defined above.
Groups are closely associated with the idea of symmetry, and most
Groups that arise in mathematics are groups of symmetry transformations,
with the operation being composition of functions
Rings
A ring is a more general algebraic structure with addition and multiplication.
Unlike a field, a ring is not required to have multiplicative inverses, and the
multiplication is not required to be commutative.
Fields
A field is an algebraic structure with addition and multiplication, which obey all of the
usual rules of elementary algebra. Examples of fields include the rational numbers Q,
the real numbers R, and the complex numbers C.
1.3.4 Chinese Remainder Theorem
• The Chinese remainder theorem is a theorem of number theory, which states that, if
one knows the remainders of the division of an integer n by several integers, then
one can determine uniquely the remainder of the division of n by the product of
these integers, under the condition that the divisors are pair wise co prime.
1.4 Basics of Cryptography
messages .
1.4.6 Secret Key Cryptography
1.4.6.1 Product Ciphers
Product cipher, data encryption scheme in which the cipher text produced by
encrypting a plaintext document is subjected to further encryption.
Since DES is based on the Feistel Cipher, all that is required to specify DES is −
• Round function
• Key schedule
• Any additional processing − Initial and final permutation
1.4.6.3 Modes of Operation
Modes of operation of a block cipher are procedural rules for a generic block
cipher. The different modes of operation result in different properties being
achieved which add to the security of the underlying block cipher in the
cryptography.
Types of mode of operations
• There are 5 types of mode of operation,
• Electronic Codebook (ECB).
• Cipher Block Chaining (CBC).
• Cipher feedback (CFB).
• Output Feedback (OFB).
• Counter Mode (CTR).
ECB CBC
• CFB CTR
1.4.6.4 MAC and other Applications
MAC algorithm is a symmetric key cryptographic technique to provide
message authentication. For establishing MAC process, the sender and
receiver share a symmetric key K.
Entity authentication
Message authentication
1.4.6.5 Attacks
One attack on DES is known as plaintext attack.
Plain text-----------Cipher text(use of same key)
e.g.,56 bit DES-2^56 possible keys are applied.
Differential cryptanalysis
Linear cryptanalysis.
1.4.6.6 Differential cryptanalysis
• Differential cryptanalysis is a type of attack that targets the weaknesses in certain types of
cryptographic algorithms. It is considered to be a powerful and effective method of
cryptanalysis, particularly against symmetric block ciphers.
• In differential cryptanalysis, the attacker compares the differences between pairs of plaintexts
and the corresponding ciphertexts. By analyzing these differences, patterns and relationships
can be identified, which can then be used to deduce information about the secret key used in
the encryption.