itechnica - VideoAndMovie

Making Technical Learning EASY & FUN...

55. Concept of Minterm & Maxterm

15:19

55. Concept of Minterm & Maxterm

54.Standard POS Expression for given Truth Table

6:05

54.Standard POS Expression for given Truth Table

53. Standard SOP Expression for given Truth Table

7:01

53. Standard SOP Expression for given Truth Table

52. Conversion POS to Standard POS

4:12

52. Conversion POS to Standard POS

51. Conversion SOP to Standard SOP

8:03

51. Conversion SOP to Standard SOP

50. Simplification of Boolean Function

9:15

50. Simplification of Boolean Function

24. Pseudo Random Number Generator| BBS | Blum Blum Shub

8:24

24. Pseudo Random Number Generator| BBS | Blum Blum Shub

23. Pseudo Random Number Generator| LCG |Linear Congruential Generator

11:54

23. Pseudo Random Number Generator| LCG |Linear Congruential Generator

22. Finite Field | GF(p) form | Example

10:46

22. Finite Field | GF(p) form | Example

21. RSA Algorithm with example

14:39

21. RSA Algorithm with example

20.Primitive Roots | Balyan's Method| Example-2

10:36

20.Primitive Roots | Balyan's Method| Example-2

19. Primitive Roots | Balyan's Method | Example- 1

9:56

19. Primitive Roots | Balyan's Method | Example- 1

18. Extended Euclidean Algorithm | Example-2

6:07

18. Extended Euclidean Algorithm | Example-2

17. Extended Euclidean Algorithm | Example-1

14:54

17. Extended Euclidean Algorithm | Example-1

16. Chinese Remainder Theorem (CRT)

14:25

16. Chinese Remainder Theorem (CRT)

15. Testing for Primality Miller Rabin Algorithm

10:40

15. Testing for Primality Miller Rabin Algorithm

14. Euler Theorem

7:49

14. Euler Theorem

13. Euler Totient Function (short trick)

4:32

13. Euler Totient Function (short trick)

12. Euler Totient Function

8:52

12. Euler Totient Function

11. Fermat Theorem

7:27

11. Fermat Theorem

10. Prime Numbers: Introduction

4:16

10. Prime Numbers: Introduction

9. Euclid's Algorithm: Greatest Common Divisor | gcd(a,b) |Example-2

4:01

9. Euclid's Algorithm: Greatest Common Divisor | gcd(a,b) |Example-2

8. Euclid's Algorithm: Greatest Common Divisor| gcd(a,b)|Example-1

15:40

8. Euclid's Algorithm: Greatest Common Divisor| gcd(a,b)|Example-1

7. Transposition Cipher: Rail Fence Method

6:26

7. Transposition Cipher: Rail Fence Method

6. Substitution Cipher: One Time Pad (OTP)

4:02

6. Substitution Cipher: One Time Pad (OTP)

5. Substitution Cipher: Polyalphabetic cipher

6:38

5. Substitution Cipher: Polyalphabetic cipher

4. Substitution Cipher: Hill cipher

6:49

4. Substitution Cipher: Hill cipher

3. Substitution Cipher: Playfair cipher

18:00

3. Substitution Cipher: Playfair cipher

2. Substitution Cipher: Caesar Cipher

12:14

2. Substitution Cipher: Caesar Cipher

1. Introduction to Syllabus

10:37

1. Introduction to Syllabus