Phong Q. Nguyen

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 15

Top Topics

Pruning Methods

Lattice Structure

Top Venues

IACR Cryptol. ePrint Arch.

Public Key Cryptography

Publications

Henry Bambury, Phong Q. Nguyen
Improved Provable Reduction of NTRU and Hypercubic Lattices. IACR Cryptol. ePrint Arch. 2024 (2024)
Henry Bambury, Phong Q. Nguyen
Improved Provable Reduction of NTRU and Hypercubic Lattices. PQCrypto (1) (2024)
Raphael C.-W. Phan, Masayuki Abe, Lynn Batten, Jung Hee Cheon, Ed Dawson, Steven D. Galbraith, Jian Guo, Lucas C. K. Hui, Kwangjo Kim, Xuejia Lai, Dong Hoon Lee, Mitsuru Matsui, Tsutomu Matsumoto, Shiho Moriai, Phong Q. Nguyen, Dingyi Pei, Duong Hieu Phan, Josef Pieprzyk, Huaxiong Wang, Hank Wolfe, Duncan S. Wong, Tzong-Chen Wu, Bo-Yin Yang, Siu-Ming Yiu, Yu Yu, Jianying Zhou
Advances in security research in the Asiacrypt region. Commun. ACM 63 (4) (2020)
Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CRYPTO (2) (2020)
Jianwei Li, Phong Q. Nguyen
A Complete Analysis of the BKZ Lattice Reduction Algorithm. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CoRR (2019)
Jianwei Li, Phong Q. Nguyen
Computing a Lattice Basis Revisited. ISSAC (2019)
Yoshinori Aono, Phong Q. Nguyen, Yixin Shen
Quantum Lattice Enumeration and Tweaking Discrete Pruning. IACR Cryptol. ePrint Arch. 2018 (2018)
Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata
Lower Bounds on Lattice Enumeration with Extreme Pruning. CRYPTO (2) (2018)
Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata
Lower Bounds on Lattice Enumeration with Extreme Pruning. IACR Cryptol. ePrint Arch. 2018 (2018)
Yoshinori Aono, Phong Q. Nguyen, Yixin Shen
Quantum Lattice Enumeration and Tweaking Discrete Pruning. ASIACRYPT (1) (2018)
Yoshinori Aono, Phong Q. Nguyen
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning. IACR Cryptol. ePrint Arch. 2017 (2017)
Yoshinori Aono, Phong Q. Nguyen
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning. EUROCRYPT (2) (2017)
Phong Q. Nguyen, Igor E. Shparlinski
Counting Co-Cyclic Lattices. SIAM J. Discret. Math. 30 (3) (2016)
Nicolas Gama, Malika Izabachène, Phong Q. Nguyen, Xiang Xie
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems. EUROCRYPT (2) (2016)
Phong Q. Nguyen, Igor E. Shparlinski
Counting Co-Cyclic Lattices. CoRR (2015)
Phong Q. Nguyen, Jiang Zhang, Zhenfeng Zhang
Simpler Efficient Group Signatures from Lattices. Public Key Cryptography (2015)
Phong Q. Nguyen, Jiang Zhang, Zhenfeng Zhang
Simpler Efficient Group Signatures from Lattices. IACR Cryptol. ePrint Arch. 2015 (2015)
Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, Rina Zeitoun
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. IACR Cryptol. ePrint Arch. 2014 (2014)
Nicolas Gama, Malika Izabachène, Phong Q. Nguyen, Xiang Xie
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions. IACR Cryptol. ePrint Arch. 2014 (2014)
Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, Rina Zeitoun
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. Public Key Cryptography (2014)
Jianwei Li, Phong Q. Nguyen
Approximating the densest sublattice from Rankin's inequality. LMS J. Comput. Math. 17 (Theory) (2014)
Mingjie Liu, Phong Q. Nguyen
Solving BDD by Enumeration: An Update. CT-RSA (2013)
Jingguo Bi, Phong Q. Nguyen
Rounding LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. IACR Cryptol. ePrint Arch. 2013 (2013)
Léo Ducas, Phong Q. Nguyen
Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures. ASIACRYPT (2012)
Léo Ducas, Phong Q. Nguyen
Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic. ASIACRYPT (2012)
Yuanmi Chen, Phong Q. Nguyen
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. EUROCRYPT (2012)
Yuanmi Chen, Phong Q. Nguyen
BKZ 2.0: Better Lattice Security Estimates. ASIACRYPT (2011)
Phong Q. Nguyen
Breaking Fully-Homomorphic-Encryption Challenges. CANS (2011)
Phong Q. Nguyen
Lattice Reduction Algorithms: Theory and Practice. EUROCRYPT (2011)
Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi Tibouchi
Modulus Fault Attacks against RSA-CRT Signatures. CHES (2011)
Phong Q. Nguyen
Cryptanalysis vs. Provable Security. Inscrypt (2011)
Yuanmi Chen, Phong Q. Nguyen
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. IACR Cryptol. ePrint Arch. 2011 (2011)
Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi Tibouchi
Modulus Fault Attacks Against RSA-CRT Signatures. IACR Cryptol. ePrint Arch. 2011 (2011)
Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi Tibouchi
Modulus fault attacks against RSA-CRT signatures. J. Cryptogr. Eng. 1 (3) (2011)
Nicolas Gama, Phong Q. Nguyen, Oded Regev
Lattice Enumeration Using Extreme Pruning. EUROCRYPT (2010)
Phong Q. Nguyen, Damien Stehlé
Low-dimensional lattice basis reduction revisited. ACM Trans. Algorithms 5 (4) (2009)
Phong Q. Nguyen, Damien Stehlé
An LLL Algorithm with Quadratic Complexity. SIAM J. Comput. 39 (3) (2009)
Gaëtan Leurent, Phong Q. Nguyen
How Risky Is the Random-Oracle Model? CRYPTO (2009)
Phong Q. Nguyen, Oded Regev
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. J. Cryptol. 22 (2) (2009)
Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen
with Quadratic Forms: Nice Cryptanalyses. ASIACRYPT (2009)
Phong Q. Nguyen, Thomas Vidick
Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2 (2) (2008)
Nicolas Gama, Phong Q. Nguyen
Predicting Lattice Reduction. EUROCRYPT (2008)
Gaëtan Leurent, Phong Q. Nguyen
How Risky is the Random-Oracle Model? IACR Cryptol. ePrint Arch. 2008 (2008)
Nicolas Gama, Phong Q. Nguyen
Finding short lattice vectors within mordell's inequality. STOC (2008)
Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen
Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5. CRYPTO (2007)
Nicolas Gama, Phong Q. Nguyen
New Chosen-Ciphertext Attacks on NTRU. Public Key Cryptography (2007)
Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen
Automatic Search of Differential Path in MD4. IACR Cryptol. ePrint Arch. 2007 (2007)
Phong Q. Nguyen, Oded Regev
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. EUROCRYPT (2006)
Don Coppersmith, Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski
Testing set proportionality and the Ádám isomorphism of circulant graphs. J. Discrete Algorithms 4 (2) (2006)
Phong Q. Nguyen
A Note on the Security of NTRUSign. IACR Cryptol. ePrint Arch. 2006 (2006)
Phong Q. Nguyen, Damien Stehlé
LLL on the Average. ANTS (2006)
Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguyen
Symplectic Lattice Reduction and NTRU. EUROCRYPT (2006)
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Phong Q. Nguyen
Rankin's Constant and Blockwise Lattice Reduction. CRYPTO (2006)
Phong Q. Nguyen, Damien Stehlé
Floating-Point LLL Revisited. EUROCRYPT (2005)
David Naccache, Phong Q. Nguyen, Michael Tunstall, Claire Whelan
Experimenting with Faults, Lattices and the DSA. Public Key Cryptography (2005)
Eli Biham, Louis Granboulan, Phong Q. Nguyen
Impossible Fault Analysis of RC4 and Differential Fault Analysis of RC4. FSE (2005)
Phong Q. Nguyen, Jacques Stern
Adapting Density Attacks to Low-Weight Knapsacks. ASIACRYPT (2005)
David Naccache, Phong Q. Nguyen, Michael Tunstall, Claire Whelan
Experimenting with Faults, Lattices and the DSA. IACR Cryptol. ePrint Arch. 2004 (2004)
Phong Q. Nguyen, Damien Stehlé
Low-Dimensional Lattice Basis Reduction Revisited. ANTS (2004)
Phong Q. Nguyen
Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3. EUROCRYPT (2004)
Phong Q. Nguyen, Igor E. Shparlinski
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. Des. Codes Cryptogr. 30 (2) (2003)
Nick Howgrave-Graham, Phong Q. Nguyen, Igor E. Shparlinski
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation. Math. Comput. 72 (243) (2003)
Nick Howgrave-Graham, Phong Q. Nguyen, David Pointcheval, John Proos, Joseph H. Silverman, Ari Singer, William Whyte
The Impact of Decryption Failures on the Security of NTRU Encryption. CRYPTO (2003)
Dario Catalano, Phong Q. Nguyen, Jacques Stern
The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm. ASIACRYPT (2002)
Phong Q. Nguyen, Igor E. Shparlinski
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptol. 15 (3) (2002)
Markus Jakobsson, Ari Juels, Phong Q. Nguyen
Proprietary Certificates. CT-RSA (2002)
Phong Q. Nguyen, David Pointcheval
Analysis and Improvements of NTRU Encryption Paddings. CRYPTO (2002)
Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham, Phong Q. Nguyen
Paillier's cryptosystem revisited. CCS (2001)
Phong Q. Nguyen, Jacques Stern
The Two Faces of Lattices in Cryptology. CaLC (2001)
Edwin El Mahassni, Phong Q. Nguyen, Igor E. Shparlinski
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces. CaLC (2001)
Phong Q. Nguyen
The Two Faces of Lattices in Cryptology. Selected Areas in Cryptography (2001)
Phong Q. Nguyen, Igor E. Shparlinski
On the Insecurity of a Server-Aided RSA Protocol. ASIACRYPT (2001)
Phong Q. Nguyen, Jacques Stern
Lattice Reduction in Cryptology: An Update. ANTS (2000)
Louis Granboulan, Phong Q. Nguyen, Fabrice Noilhan, Serge Vaudenay
DFCv2. Selected Areas in Cryptography (2000)
Glenn Durfee, Phong Q. Nguyen
Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99. ASIACRYPT (2000)
Daniel Bleichenbacher, Phong Q. Nguyen
Noisy Polynomial Interpolation and Noisy Chinese Remaindering. EUROCRYPT (2000)
Dan Boneh, Antoine Joux, Phong Q. Nguyen
Why Textbook ElGamal and RSA Encryption Are Insecure. ASIACRYPT (2000)
Christophe Coupé, Phong Q. Nguyen, Jacques Stern
The Effectiveness of Lattice Attacks Against Low-Exponent RSA. Public Key Cryptography (1999)
Phong Q. Nguyen
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97. CRYPTO (1999)
Phong Q. Nguyen, Jacques Stern
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications. CRYPTO (1999)
Phong Q. Nguyen, Jacques Stern
A Converse to the Ajtai-Dwork Security Proof and its Cryptographic Implications Electron. Colloquium Comput. Complex. 5 (10) (1998)
Phong Q. Nguyen, Jacques Stern
Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97. Selected Areas in Cryptography (1998)
Phong Q. Nguyen, Jacques Stern
The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure. ASIACRYPT (1998)
Phong Q. Nguyen
A Montgomery-Like Square Root for the Number Field Sieve. ANTS (1998)
Phong Q. Nguyen, Jacques Stern
Cryptanalysis of the Ajtai-Dwork Cryptosystem. CRYPTO (1998)
Phong Q. Nguyen, Jacques Stern
Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations. CRYPTO (1997)