Duration of the online course: 14 hours and 43 minutes
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.
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 courseOver 5,000 free courses
Programming, English, Digital Marketing and much more! Learn whatever you want, for free.
Study plan with AI
Our app's Artificial Intelligence can create a study schedule for the course you choose.
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.

Free CourseCompTIA Security course
26h11m
41 exercises

Free CourseInformation Security Management Fundamentals
2h55m
15 exercises

Free CourseAdvanced Topics in Cryptography
22h34m
9 exercises

Free CourseComputer systems security
29h44m
20 exercises

Free CourseIT Security
15h04m
18 exercises

Free CourseCyber security
2h07m
24 exercises

Free CourseInformation security lessons
7h15m
11 exercises

Free CourseIntroduction to Cybersecurity
7h43m
6 exercises

Free CourseCyber Security Masterclass
1h36m
6 exercises

Free CourseCyber security full course
11h06m
Thousands of online courses in video, ebooks and audiobooks.
To test your knowledge during online courses
Generated directly from your cell phone's photo gallery and sent to your email
Download our app via QR Code or the links below::.
+ 10 million
students
Free and Valid
Certificate
60 thousand free
exercises
4.8/5 rating in
app stores
Free courses in
video and ebooks
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.
Masooma Batool
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.
Masooma Batool
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.
Masooma Batool
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
Masooma Batool
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
Masooma Batool
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.
Masooma Batool
GCD(529,123): 529 mod 123 = 37 123 mod 37 = 12 37 mod 12 = 1 12 mod 1 = 0 → GCD = 1 (co-prime)
Masooma Batool
53 is prime. Miller-Rabin: a=2, 2^13 mod53=30, 2^26 mod53=52≡-1. Pass.
Masooma Batool
Test if 11 is prime using Fermat's test: 11 is prime. Fermat test: a=2, 2^10 mod11=1024 mod11=1. Pass.
Masooma Batool
n=3009. √3009≈55. 55²=3025, 3025-3009=16=4². So factors: (55-4)(55 4)=51×59.
Masooma Batool
No. Z' (integers without 0) under fails: no identity (0 missing), no inverses (e.g., no -a). Not a group.