Free Course Image Cryptography and Network Security

Free online courseCryptography and Network Security

Duration of the online course: 14 hours and 43 minutes

5.25

StarStarStarStarStar

(-4)

Build real-world cybersecurity skills with a free course on cryptography and network security—learn encryption, attacks, and defenses, plus a certificate option.

In this free course, learn about

  • Cryptography & network security fundamentals; goals and scope
  • CIA triad: confidentiality, integrity, availability and how they guide security
  • OSI Security Architecture: attacks, services, mechanisms, and network security model
  • Attack types incl. traffic analysis; basics of cryptanalysis & brute force
  • Classical ciphers: Caesar, monoalphabetic, Playfair, Hill, Vigenere, Vernam, OTP
  • Transposition ciphers: rail fence and row-column techniques
  • Steganography concepts; LSB steganography embedding and detection basics
  • Number theory for crypto: primes, modular arithmetic/exponentiation, inverses, GCD/EEA
  • Key theorems/tools: Euler phi, Fermat/Euler theorems, primitive roots, CRT
  • Discrete log problem, factoring (Fermat method), and primality tests (Fermat, Miller-Rabin)
  • Algebraic structures: groups, cyclic/abelian groups, rings, fields, finite fields
  • Symmetric crypto: stream vs block ciphers; Feistel structure; DES and AES internals
  • Block cipher modes: ECB, CBC, CFB, OFB, CTR; why modes are needed and tradeoffs
  • PRNG basics and Golomb randomness postulates; public-key cryptography overview

Course Description

Modern cybersecurity depends on one foundational skill: understanding how information is protected, transmitted, and attacked across networks. This free online course in Cryptography and Network Security is designed to help you build that foundation from the ground up, connecting core security principles with the mathematics and mechanisms that make secure communication possible.

You will start by clarifying what security actually means in practice through the CIA triad, common threat types, and the OSI security architecture. From there, you will develop a structured view of how security services and mechanisms fit into a network security model, so you can reason about confidentiality, integrity, authentication, and availability in real systems instead of treating them as abstract buzzwords.

A major strength of the course is how it bridges conceptual understanding and hands-on reasoning. You will explore cryptography essentials, key terms, and the mindset behind cryptanalysis, including brute-force approaches and traffic analysis. By working through classical techniques such as substitution, transposition, and polyalphabetic methods, you will see how encryption evolved, why early ciphers fail against modern analysis, and what design goals later algorithms needed to satisfy.

To move from intuition to competence, the course reinforces the math that underpins secure protocols. You will practice modular arithmetic, modular exponentiation, the Euclidean and extended Euclidean algorithms, multiplicative inverses, and important results such as Fermat’s little theorem and Euler’s theorem. Topics like primitive roots, the discrete logarithm problem, primality testing, and the Chinese remainder theorem help explain why certain cryptographic schemes are feasible while others are hard to break.

With these tools in place, you will understand how modern symmetric cryptography works through the structure and security properties of block ciphers and stream ciphers, including key design ideas such as the Feistel structure and the avalanche effect. You will also examine DES and AES at a practical level, learning how their rounds, transformations, and key expansion contribute to security. Finally, you will connect encryption to real deployments by studying modes of operation (ECB, CBC, CFB, OFB, CTR) and why choosing the right mode matters for both confidentiality and reliability.

By the end, you will be able to interpret how cryptographic components fit into broader network defense practices, evaluate common misconceptions, and make better security decisions in study projects, IT environments, and cybersecurity career pathways.

Course content

  • Video class: Introduction to Cryptography and Network Security 10m
  • Video class: CIA Triad 16m
  • Exercise: What are the key elements of the CIA triad in computer security?
  • Video class: The OSI Security Architecture 08m
  • Exercise: In the context of the OSI Security Architecture, which of the following best describes a security mechanism?
  • Video class: Security Attacks 15m
  • Exercise: What is traffic analysis in the context of security attacks?
  • Video class: Security Services 08m
  • Video class: Security Mechanisms 11m
  • Video class: Network Security Model 11m
  • Video class: Cryptography 13m
  • Video class: Cryptography – Key Terms 09m
  • Exercise: Which of the following best describes asymmetric cryptography?
  • Video class: Cryptanalysis 11m
  • Video class: Brute Force Attack 08m
  • Video class: Classical Encryption Techniques 08m
  • Video class: Caesar Cipher (Part 1) 13m
  • Exercise: Which of the following describes a key characteristic of the Caesar Cipher?
  • Video class: Caesar Cipher (Part 2) 09m
  • Video class: Monoalphabetic Cipher 15m
  • Video class: Playfair Cipher (Part 1) 12m
  • Exercise: What type of encryption technique is the Playfair Cipher?
  • Video class: Playfair Cipher (Part 2) 11m
  • Exercise: In the Playfair cipher, how is the ciphertext generated when the two letters in the digram are in the same row?
  • Video class: Playfair Cipher (Solved Question) 12m
  • Video class: Hill Cipher (Encryption) 17m
  • Video class: Hill Cipher (Decryption) 30m
  • Exercise: What is essential for decryption in Hill Cipher?
  • Video class: Polyalphabetic Cipher (Vigenère Cipher) 13m
  • Video class: Polyalphabetic Cipher (Vernam Cipher) 07m
  • Video class: One Time Pad 07m
  • Exercise: What is one of the primary challenges associated with the one-time pad encryption technique?
  • Video class: Rail Fence Technique 06m
  • Video class: Row Column Transposition Ciphering Technique 08m
  • Video class: Steganography 06m
  • Video class: LSB Steganography - Demo 12m
  • Video class: Cryptography (Solved Questions) 10m
  • Video class: Abstract Algebra and Number Theory 08m
  • Video class: Prime Numbers in Cryptography 10m
  • Video class: Modular Arithmetic (Part 1) 10m
  • Exercise: In modular arithmetic, if 29 is congruent to a number under mod 7, what is that number?
  • Video class: Modular Arithmetic (Part 2) 11m
  • Video class: Modular Exponentiation (Part 1) 10m
  • Exercise: What is the result of the operation 5^4 mod 7?
  • Video class: Modular Exponentiation (Part 2) 19m
  • Video class: GCD - Euclidean Algorithm (Method 1) 14m
  • Exercise: What is the greatest common divisor (GCD) of the numbers 18 and 24 using the Euclidean algorithm?
  • Video class: GCD - Euclidean Algorithm (Method 2) 10m
  • Video class: Relatively Prime (Co-Prime) Numbers 09m
  • Video class: Euler’s Totient Function (Phi Function) 08m
  • Video class: Euler’s Totient Function (Solved Examples) 12m
  • Video class: Fermat's Little Theorem 07m
  • Video class: Euler's Theorem 08m
  • Video class: Primitive Roots 09m
  • Video class: Multiplicative Inverse 10m
  • Exercise: Which statement about multiplicative inverses under modular arithmetic is true?
  • Video class: Extended Euclidean Algorithm (Solved Example 1) 10m
  • Video class: Extended Euclidean Algorithm (Solved Example 2) 05m
  • Video class: Extended Euclidean Algorithm (Solved Example 3) 06m
  • Video class: The Chinese Remainder Theorem (Solved Example 1) 14m
  • Exercise: What is the primary use of the Chinese Remainder Theorem in mathematics?
  • Video class: The Chinese Remainder Theorem (Solved Example 2) 12m
  • Video class: The Discrete Logarithm Problem 08m
  • Video class: The Discrete Logarithm Problem (Solved Example) 04m
  • Video class: Prime Factorization (Fermat's Factoring Method) 08m
  • Exercise: Which of the following describes the primary step in Fermat's factoring method for finding the two prime factors of a given number n?
  • Video class: Testing for Primality (Fermat's Test) 08m
  • Video class: Testing for Primality (Miller-Rabin Test) 10m
  • Video class: Group and Abelian Group 10m
  • Video class: Cyclic Group 12m
  • Video class: Rings, Fields and Finite Fields 13m
  • Video class: Stream Cipher vs. Block Cipher 09m
  • Exercise: What is the primary design principle that differentiates stream ciphers from block ciphers?
  • Video class: Feistel Cipher Structure 14m
  • Video class: Introduction to Data Encryption Standard (DES) 08m
  • Exercise: Which of the following statements about the Data Encryption Standard (DES) is true?
  • Video class: Single Round of DES Algorithm 13m
  • Video class: The F Function of DES (Mangler Function) 10m
  • Exercise: What is the process called that converts 32 bits into 48 bits by repeating certain bits in the DES F function?
  • Video class: Key Scheduling and Decryption in DES 09m
  • Video class: Avalanche Effect and the Strength of DES 10m
  • Exercise: What is the Avalanche effect in cryptography?
  • Video class: Data Encryption Standard (DES) - Solved Questions 07m
  • Video class: Introduction to Advanced Encryption Standard (AES) 11m
  • Exercise: Which of the following statements about AES (Advanced Encryption Standard) is true?
  • Video class: AES Encryption and Decryption 13m
  • Video class: AES Round Transformation 11m
  • Exercise: In the AES encryption algorithm, which transformation involves changing the positions of bytes without altering their values?
  • Video class: AES Key Expansion 14m
  • Video class: AES Security and Implementation Aspects 08m
  • Exercise: Why is AES considered more secure than its predecessor, DES?
  • Video class: Multiple Encryption and Triple DES 20m
  • Video class: Block Cipher Modes of Operation 06m
  • Exercise: What is the primary reason for using block cipher modes of operation?
  • Video class: Electronic Codebook (ECB) 11m
  • Video class: Cipher Block Chaining (CBC) 08m
  • Exercise: What is a significant advantage of the Cipher Block Chaining (CBC) mode compared to the Electronic Code Book (ECB) mode?
  • Video class: Cipher Feedback (CFB) 13m
  • Video class: Output Feedback (OFB) 10m
  • Exercise: Which statement accurately describes a characteristic of the Output Feedback (OFB) mode in block cipher operations?
  • Video class: Counter Mode (CTR) 09m
  • Video class: Block Cipher Modes of Operation (Solved Question) 06m
  • Exercise: In the Cipher Feedback (CFB) mode of operation, which component is used to generate the keystream that encrypts the plaintext?
  • Video class: Pseudorandom Number Generator (PRNG) 11m
  • Video class: Golomb’s Randomness Postulates 14m
  • Exercise: What is true regarding the Gol's Randomness Postulates for a binary sequence?
  • Video class: Public Key Cryptography | Chapter-4 | Cryptography 01m
  • Video class: Hash Functions 01m
  • Exercise: What is the primary goal of cryptography in network security?
  • Video class: System Practices 01m

This free course includes:

14 hours and 43 minutes of online video course

Digital certificate of course completion (Free)

Exercises to train your knowledge

100% free, from content to certificate

Ready to get started?Download the app and get started today.

Install the app now

to access the course
Icon representing technology and business courses

Over 5,000 free courses

Programming, English, Digital Marketing and much more! Learn whatever you want, for free.

Calendar icon with target representing study planning

Study plan with AI

Our app's Artificial Intelligence can create a study schedule for the course you choose.

Professional icon representing career and business

From zero to professional success

Improve your resume with our free Certificate and then use our Artificial Intelligence to find your dream job.

You can also use the QR Code or the links below.

QR Code - Download Cursa - Online Courses

Course comments: Cryptography and Network Security

Students gave 5-star feedback, highlighting clear, step-by-step explanations and practical problem-solving in number theory/modular arithmetic (primes, GCD, CRT, inverses, primitive roots), helping them verify results and understand concepts.

MB

Masooma Batool

StarStarStarStarStar

Solve 2^X \equiv 4 \pmod{7}. Powers of 2 mod7: 2^1=2, 2^2=4, 2^3=1, 2^4=2, ... So 2^2 \equiv 4 \pmod{7}. Thus X=2.

MB

Masooma Batool

StarStarStarStarStar

X ≡ 2 mod3, 2 mod5, 1 mod11. CRT: moduli 3,5,11 coprime. M=165. Compute: (2×55×1 2×33×2 1×15×3) mod165 = (110 132 45)=287 mod165 = 122. So X=122.

MB

Masooma Batool

StarStarStarStarStar

Multiplicative inverse of 10 mod 11? Since 10 and 11 are coprime, inverse exists.10 × x ≡ 1 mod 11 → x = 10 (becz 10×10=100 ≡ 1 mod 11) So invrs is 10

MB

Masooma Batool

StarStarStarStarStar

Q1: 2 is primitive root of 11? Powers of 2 mod 11: 2,4,8,5,10,9,7,3,6,1 → all residues, so yes. Q2: Primitive roots of 5: Test 1-4: 2: 2,4,3,1 → yes

MB

Masooma Batool

StarStarStarStarStar

GCD(790,121): 790 mod 121 = 64 121 mod 64 = 57 64 mod 57 = 7 57 mod 7 = 1 7 mod 1 = 0 → GCD=1, so relatively prime.

MB

Masooma Batool

StarStarStarStarStar

GCD(529,123): 529 mod 123 = 37 123 mod 37 = 12 37 mod 12 = 1 12 mod 1 = 0 → GCD = 1 (co-prime)

MB

Masooma Batool

StarStarStarStarStar

53 is prime. Miller-Rabin: a=2, 2^13 mod53=30, 2^26 mod53=52≡-1. Pass.

MB

Masooma Batool

StarStarStarStarStar

Test if 11 is prime using Fermat's test: 11 is prime. Fermat test: a=2, 2^10 mod11=1024 mod11=1. Pass.

MB

Masooma Batool

StarStarStarStarStar

n=3009. √3009≈55. 55²=3025, 3025-3009=16=4². So factors: (55-4)(55 4)=51×59.

MB

Masooma Batool

StarStarStarStarStar

No. Z' (integers without 0) under fails: no identity (0 missing), no inverses (e.g., no -a). Not a group.

More free courses at Cyber Security

Free Ebook + Audiobooks! Learn by listening or reading!

Download the App now to have access to + 5000 free courses, exercises, certificates and lots of content without paying anything!

  • 100% free online courses from start to finish

    Thousands of online courses in video, ebooks and audiobooks.

  • More than 60 thousand free exercises

    To test your knowledge during online courses

  • Valid free Digital Certificate with QR Code

    Generated directly from your cell phone's photo gallery and sent to your email

Cursa app on the ebook screen, the video course screen and the course exercises screen, plus the course completion certificate