The following pages link to Phong Q. Nguyen (Q1015358):
Displaying 50 items.
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces (Q1412249) (← links)
- Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
- Lower bounds on lattice enumeration with extreme pruning (Q1784109) (← links)
- The insecurity of the digital signature algorithm with partially known nonces (Q1849602) (← links)
- Testing set proportionality and the Ádám isomorphism of circulant graphs (Q2458932) (← links)
- (Q2707398) (← links)
- (Q2707399) (← links)
- (Q2708631) (← links)
- (Q2708632) (← links)
- (Q2739436) (← links)
- (Q2762741) (← links)
- Lattice-Based Fault Attacks on Signatures (Q2838308) (← links)
- Approximating the densest sublattice from Rankin’s inequality (Q2878829) (← links)
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers (Q2894427) (← links)
- Breaking Fully-Homomorphic-Encryption Challenges (Q2901349) (← links)
- Low-dimensional lattice basis reduction revisited (Q2930273) (← links)
- Lattice Reduction Algorithms: Theory and Practice (Q3003370) (← links)
- BKZ 2.0: Better Lattice Security Estimates (Q3102173) (← links)
- How Risky Is the Random-Oracle Model? (Q3183579) (← links)
- (Q3374898) (← links)
- Sieve algorithms for the shortest vector problem are practical (Q3537523) (← links)
- (Q3549702) (← links)
- Lattice Enumeration Using Extreme Pruning (Q3563839) (← links)
- An LLL Algorithm with Quadratic Complexity (Q3575152) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 (Q3612542) (← links)
- (Q3614010) (← links)
- Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses (Q3650709) (← links)
- (Q4249280) (← links)
- (Q4249332) (← links)
- (Q4250818) (← links)
- (Q4263436) (← links)
- (Q4364552) (← links)
- (Q4409120) (← links)
- The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm (Q4412805) (← links)
- (Q4472073) (← links)
- (Q4474163) (← links)
- (Q4736443) (← links)
- (Q4787202) (← links)
- (Q4787205) (← links)
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation (Q4806399) (← links)
- Cryptanalysis vs. Provable Security (Q4899188) (← links)
- Solving BDD by Enumeration: An Update (Q4910246) (← links)
- Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic (Q4911599) (← links)
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures (Q4911600) (← links)
- (Q4941845) (← links)
- Computing a Lattice Basis Revisited (Q5121117) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
