NOTES · ANALYSIS · RESEARCH

Writing

개인정보보호, 선형대수학, 확률 이론, 이산수학, 정수론, 디지털포렌식, 계산이론, 운영체제와 인공지능을 공부하며 새롭게 작성한 글을 모을 공간입니다. 주제와 글 형식으로 분류하거나 제목, 설명, 태그를 검색할 수 있습니다.

99개의 글

개인정보보호학습 노트2026-08-08

1. k-익명성, l-다양성, t-근접성

재식별 위험을 줄이기 위한 k-익명성, l-다양성, t-근접성의 개념과 차이, 한계와 적용 방법을 예제로 정리한다.

#data-privacy#de-identification#k-anonymity#l-diversity#t-closeness

Writing

1. k-익명성, l-다양성, t-근접성

11. Web Browser Forensics

10. Deleted Data, Volume Shadow Copy, and System Logs

9. Windows Registry Forensics

8. Windows Usage Artifacts: LNK, Jump Lists, and Caches

7. Windows Execution Artifacts: Event Logs and Prefetch

6. File System Forensics와 Hidden Data

5. FAT, NTFS, and Deleted File Recovery

4. Partitions, Volumes, and File Systems

3. Digital Evidence Acquisition과 Live Forensics

2. Data Representation, Encoding, and File Formats

1. Digital Forensics와 Digital Evidence

18. Elliptic Curves and Elliptic Curve Cryptography

17. Digital Signatures: RSA, ElGamal, and DSA

16. Public-Key Encryption: RSA, ElGamal, and Goldwasser–Micali

15. Discrete Logarithms and Key Exchange

14. Rings, Polynomial Rings, and Finite Fields

13. Quadratic Congruences modulo Prime Powers

12. Gauss’s Lemma, Quadratic Reciprocity, and the Jacobi Symbol

11. Quadratic Residues and the Legendre Symbol

10. Indices and Power Congruences

9. Orders, Cyclic Groups, and Primitive Roots

8. Euler’s Phi Function and Euler’s Theorem

7. Arithmetic Functions and Möbius Inversion

6. Factorization Methods and Arithmetic Functions

6. Integer Factorization Methods

5. Fermat, Wilson, and Primality Tests

5. Fermat, Wilson, and Probabilistic Primality Tests

4. Linear Congruences and the Chinese Remainder Theorem

3. Congruences and Modular Arithmetic

2. Prime Numbers and Unique Factorization

1. Divisibility, GCD, and Diophantine Equations

12. P, NP, and Polynomial-Time Reduction

11. GCD와 Euclidean Algorithm

10. Graph Theory

9. Pigeonhole Principle과 Ramsey Theory

8. Recurrence Relations와 Catalan Numbers

7. Binomial Theorem과 Inclusion–Exclusion

6. Counting, Permutations, and Combinations

5. Cardinality, Countability, and Diagonal Arguments

4. Sets와 Functions

3. Induction, Well-Ordering, and Invariants

2. Argument와 Basic Methods of Proof

1. Propositional Logic과 Predicate Logic

25. Chomsky Hierarchy와 Language Class 관계

24. Halting Problem과 비결정성 증명

23. Decidable Language와 Turing-Recognizable Language

22. Multi-tape 등 Turing Machine 모델의 동등성

21. Turing Machine Transducer와 함수 계산

20. Turing Machine의 Configuration과 Computation

19. Turing Machine의 구조와 동작

18. CFL의 Closure Property와 Pumping Lemma

17. CFG와 PDA의 동등성

16. Pushdown Automata와 Instantaneous Description

15. CYK Algorithm과 CFG Membership

14. Chomsky Normal Form과 Greibach Normal Form

13. CFG Simplification

12. Context-Free Grammar와 Parse Tree

11. Pumping Lemma와 Non-Regular Language 증명

10. Regular Language의 Closure Property

11. Multivariate Transformation과 Jacobian

9. Regular Grammar와 Regular Language

8. Arden’s Theorem과 Automata 변환

10. Multivariate Random Variable과 Joint Distribution

7. Regular Expression의 정의와 연산

6. DFA와 NFA의 동등성

5. NFA와 ε-transition

4. DFA의 정의와 문자열 인식

3. Grammar, Production Rule과 Derivation

2. Formal Language와 Language Operation

1. Alphabet, String과 Empty String

19. Least Squares Solution과 데이터 근사

18. Singular Value Decomposition과 Pseudoinverse

17. Spectral Decomposition과 행렬의 구조

16. Complex Conjugate, Hermitian Matrix와 Unitary Matrix

15. QR Factorization과 Orthonormal Basis

14. Gram-Schmidt Process와 Orthogonal Diagonalization

13. Orthogonal Complement와 Projection

12. Orthogonal Set, Orthonormal Basis와 Orthogonal Matrix