쿠뱃봉의 IT Textarea 쿠뱃봉의 IT Textarea

MajorClass/Cryptography

• [암호학] Modular arithmetic

  MajorClass/Cryptography 2022. 11. 15. 22:52

  https://www.youtube.com/watch?v=bg0P_3UiG5I&list=PLBlnK6fEyqRgJU3EsOYDTW7m6SUmW6kII&index=34 15 = 3 (mod 12) 15를 12로 나눈 나머지는 3 = 3을 12로 나눈 나머지는 3 연습문제 1. 11 ^23 mod 187 11^2 mod 187 = 121 or -66 11^4 mod 187 = (-66)*(-66) mod 187 =4356 mod 187 =55 11^8 mod 187 =55*55 mod 187 =3025 mod 187 =33 11^16 mod 187 =33*33 mod 187 =1089 mod 187 = 154 or -33 11^23 mod 187 = 11^16 * 11^4 * 11^2 * 11^1 mod 1..

  Read More
• 암호학 6주차 1차시

  MajorClass/Cryptography 2022. 10. 7. 19:29

  Not even in (class) NPDA L12= { x | x =yy ,y ∈ {0,1}*} This is why your compiler has seperate modules for syntax checking and name tables Turing Machine DTM : Deterministic Turing Machine

  Read More
• 암호학 - 5주차 2차시

  MajorClass/Cryptography 2022. 10. 3. 16:36

  DFA cannot solve L5 How do you know? Intuition First Proof using Pumping Lemma Assume a DFA M accepts L5 , M has n states for some n Important Note : One single "Finite" Machine should accept all string in L5 Think about \(0^{n}1^{n}\) Pumping Lemma in Regular Language Pumping Lemma란 Language가 DFA로 표현될 수 없음을 증명하기 위해 사용되는 것이다. https://www.youtube.com/watch?v=Ow-gfFkXPZw https://www.youtube.com/wa..

  Read More