Articles
總共有 97 篇 articles
- My First Article
- Find the Flag in a PDF
- Wiener's Attack on RSA
- Basic Encoding (Python)
- LLL reduction
- Lattice
- Web Cache Deception Payload Cheatsheet
- Web Cache Deception
- Lattice Reduction and Continued Fractions
- Lattice Based Attacks on RSA
- Lab: Exploiting an API endpoint using documentation
- Lab: Finding and exploiting an unused API endpoint
- Lab: Exploiting path delimiters for web cache deception
- Lab: Exploiting path mapping for web cache deception
- Partial Exposure of the LSBs of the RSA Decryption Exponent
- Partial Exposure of the MSBs of the RSA Decryption Exponent
- Partial Key Exposure Attacks
- Partial Exposure of some bits of the RSA Prime Factors
- Security of ElGamal
- Security of RSA
- Security of Encryption
- Modular Binomials
- GCD
- Freshman's Dream
- PRIMES is in P
- Sophomore’s Dream
- Safe and Sophie Germain Primes
- The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-Rewinding Proofs for Schnorr Identification and Signatures
- Tighter Security for Schnorr Identification and Signature: A High-Moment Forking Lemma for Sigma-Protocols
- Forking Lemma
- The One-More Discrete Logarithm Assumption in the Generic Group Model
- GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
- Lower Bounds for Discrete Logarithms and Related Problems
- Random Oracle Model
- AES
- Biclique Attack
- The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
- Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols via Hitting Games
- Block Cipher
- Håstad’s Attack
- Boneh–DeMillo–Lipton Fault Attack
- Boneh-Durfee Attack
- Franklin–Reiter Attack
- Discrete Logarithm, RSA, and the Structure of $\mathbb{Z}_p^{\ast}$
- Security of Signatures
- Semantically Secure System
- Decision Problems
- List of NPC Problems
- Polynomial Complexity Classes
- P = NP?
- Bit Security
- Knapsack-Based Cryptosystems
- Prime Number Theorem
- Atlantic City Algorithm
- Las Vegas Algorithm
- Monte Carlo Algorithm
- Provable Security
- Random Self-Reduction
- Randomized Complexity Classes
- Snoop Dogg
- Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols via Hitting Games - Introduction
- Security of DL-based Signature
- Security of RSA Signature
- 好きだから。
- Fermat Primality Test
- Miller-Rabin Primality Test
- Primality Proving Algorithms
- Prime Numbers and Primality Testing
- Trial Division
- Difference of Two Squares and Relations
- Factoring Algorithms
- Number Field Sieve
- Pollard's p-1 Method
- Smooth Numbers and Factoring Complexity
- Adleman–Huang Algorithm
- Elliptic Curve Primality Proving (ECPP)
- DES
- Feistel Cipher
- Modes of Operation
- Rijndael
- Sophie-Germain Prime Density Conjecture
- Sophie-Germain Prime Conjecture
- Fiat–Shamir Transformation
- Sigma Protocol
- [BD20] 1 Introduction
- [BD20] 2 Preliminaries
- [BD20] 3 The Multi-Base Discrete Logarithm Problem
- [BD20] 4 Schnorr Identification and Signatures from MBDL
- [BD20] 5 MBDL hardness in the Generic Group Model
- [BD20] A Okamoto Identification and Signature from MBDL
- [BD20] B Ratio-based tightness
- Shor's Algorithm and Grover's Algorithm
- [BD20] 4.1 Schnorr Identification from MBDL
- [BD20] 4.2 Schnorr Signature from MBDL
- [BD20] Proof of Theorem 4.1
- [BD20] Quantitative Comparison for 4.1
- [BD20] Quantitative Comparison for 4.3