default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhong Q. Nguyen
阮風光
Person information
- unicode name: 阮風光
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c57]Henry Bambury, Phong Q. Nguyen:
Improved Provable Reduction of NTRU and Hypercubic Lattices. PQCrypto (1) 2024: 343-370- [i18]Henry Bambury, Phong Q. Nguyen:
Improved Provable Reduction of NTRU and Hypercubic Lattices. IACR Cryptol. ePrint Arch. 2024: 601 (2024) - 2020
- [j12]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): 76-81 (2020) - [c56]Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz:
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CRYPTO (2) 2020: 274-295 - [i17]Jianwei Li, Phong Q. Nguyen:
A Complete Analysis of the BKZ Lattice Reduction Algorithm. IACR Cryptol. ePrint Arch. 2020: 1237 (2020)
2010 – 2019
- 2019
- [c55]Jianwei Li, Phong Q. Nguyen:
Computing a Lattice Basis Revisited. ISSAC 2019: 275-282 - [i16]Divesh Aggarwal, Jianwei Li, Phong Q. Nguyen, Noah Stephens-Davidowitz:
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation. CoRR abs/1908.03724 (2019) - 2018
- [c54]Yoshinori Aono, Phong Q. Nguyen, Yixin Shen:
Quantum Lattice Enumeration and Tweaking Discrete Pruning. ASIACRYPT (1) 2018: 405-434 - [c53]Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata:
Lower Bounds on Lattice Enumeration with Extreme Pruning. CRYPTO (2) 2018: 608-637 - [i15]Yoshinori Aono, Phong Q. Nguyen, Yixin Shen:
Quantum Lattice Enumeration and Tweaking Discrete Pruning. IACR Cryptol. ePrint Arch. 2018: 546 (2018) - [i14]Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata:
Lower Bounds on Lattice Enumeration with Extreme Pruning. IACR Cryptol. ePrint Arch. 2018: 586 (2018) - 2017
- [c52]Yoshinori Aono, Phong Q. Nguyen:
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning. EUROCRYPT (2) 2017: 65-102 - [e6]Phong Q. Nguyen, Jianying Zhou:
Information Security - 20th International Conference, ISC 2017, Ho Chi Minh City, Vietnam, November 22-24, 2017, Proceedings. Lecture Notes in Computer Science 10599, Springer 2017, ISBN 978-3-319-69658-4 [contents] - [i13]Yoshinori Aono, Phong Q. Nguyen:
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning. IACR Cryptol. ePrint Arch. 2017: 155 (2017) - 2016
- [j11]Phong Q. Nguyen, Igor E. Shparlinski:
Counting Co-Cyclic Lattices. SIAM J. Discret. Math. 30(3): 1358-1370 (2016) - [c51]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: 528-558 - 2015
- [c50]Phong Q. Nguyen, Jiang Zhang, Zhenfeng Zhang:
Simpler Efficient Group Signatures from Lattices. Public Key Cryptography 2015: 401-426 - [i12]Phong Q. Nguyen, Igor E. Shparlinski:
Counting Co-Cyclic Lattices. CoRR abs/1505.06429 (2015) - [i11]Phong Q. Nguyen, Jiang Zhang, Zhenfeng Zhang:
Simpler Efficient Group Signatures from Lattices. IACR Cryptol. ePrint Arch. 2015: 20 (2015) - 2014
- [j10]Jianwei Li, Phong Q. Nguyen:
Approximating the densest sublattice from Rankin's inequality. LMS J. Comput. Math. 17(Theory): 92-111 (2014) - [c49]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: 185-202 - [e5]Phong Q. Nguyen, Elisabeth Oswald:
Advances in Cryptology - EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings. Lecture Notes in Computer Science 8441, Springer 2014, ISBN 978-3-642-55219-9 [contents] - [i10]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: 283 (2014) - [i9]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: 437 (2014) - 2013
- [c48]Mingjie Liu, Phong Q. Nguyen:
Solving BDD by Enumeration: An Update. CT-RSA 2013: 293-309 - [e4]Thomas Johansson, Phong Q. Nguyen:
Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings. Lecture Notes in Computer Science 7881, Springer 2013, ISBN 978-3-642-38347-2 [contents] - [i8]Jingguo Bi, Phong Q. Nguyen:
Rounding LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. IACR Cryptol. ePrint Arch. 2013: 512 (2013) - 2012
- [c47]Léo Ducas, Phong Q. Nguyen:
Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic. ASIACRYPT 2012: 415-432 - [c46]Léo Ducas, Phong Q. Nguyen:
Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures. ASIACRYPT 2012: 433-450 - [c45]Yuanmi Chen, Phong Q. Nguyen:
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. EUROCRYPT 2012: 502-519 - [p2]Phong Q. Nguyen, Mehdi Tibouchi:
Lattice-Based Fault Attacks on Signatures. Fault Analysis in Cryptography 2012: 201-220 - 2011
- [j9]Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi Tibouchi:
Modulus fault attacks against RSA-CRT signatures. J. Cryptogr. Eng. 1(3): 243-253 (2011) - [c44]Yuanmi Chen, Phong Q. Nguyen:
BKZ 2.0: Better Lattice Security Estimates. ASIACRYPT 2011: 1-20 - [c43]Phong Q. Nguyen:
Breaking Fully-Homomorphic-Encryption Challenges. CANS 2011: 13-14 - [c42]Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi Tibouchi:
Modulus Fault Attacks against RSA-CRT Signatures. CHES 2011: 192-206 - [c41]Phong Q. Nguyen:
Cryptanalysis vs. Provable Security. Inscrypt 2011: 22-23 - [c40]Phong Q. Nguyen:
Lattice Reduction Algorithms: Theory and Practice. EUROCRYPT 2011: 2-6 - [r4]Phong Q. Nguyen:
Lattice. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 710-711 - [r3]Phong Q. Nguyen:
Lattice Reduction. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 711-713 - [i7]Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi Tibouchi:
Modulus Fault Attacks Against RSA-CRT Signatures. IACR Cryptol. ePrint Arch. 2011: 388 (2011) - [i6]Yuanmi Chen, Phong Q. Nguyen:
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. IACR Cryptol. ePrint Arch. 2011: 436 (2011) - 2010
- [c39]Nicolas Gama, Phong Q. Nguyen, Oded Regev:
Lattice Enumeration Using Extreme Pruning. EUROCRYPT 2010: 257-278 - [p1]Phong Q. Nguyen:
Hermite's Constant and Lattice Algorithms. The LLL Algorithm 2010: 19-69 - [e3]Phong Q. Nguyen, David Pointcheval:
Public Key Cryptography - PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings. Lecture Notes in Computer Science 6056, Springer 2010, ISBN 978-3-642-13012-0 [contents] - [e2]Phong Q. Nguyen, Brigitte Vallée:
The LLL Algorithm - Survey and Applications. Information Security and Cryptography, Springer 2010, ISBN 978-3-642-02294-4 [contents]
2000 – 2009
- 2009
- [j8]Phong Q. Nguyen, Oded Regev:
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. J. Cryptol. 22(2): 139-160 (2009) - [j7]Phong Q. Nguyen, Damien Stehlé:
An LLL Algorithm with Quadratic Complexity. SIAM J. Comput. 39(3): 874-903 (2009) - [j6]Phong Q. Nguyen, Damien Stehlé:
Low-dimensional lattice basis reduction revisited. ACM Trans. Algorithms 5(4): 46:1-46:48 (2009) - [c38]Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen:
Factoring pq2 with Quadratic Forms: Nice Cryptanalyses. ASIACRYPT 2009: 469-486 - [c37]Gaëtan Leurent, Phong Q. Nguyen:
How Risky Is the Random-Oracle Model? CRYPTO 2009: 445-464 - 2008
- [j5]Phong Q. Nguyen, Thomas Vidick:
Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2(2): 181-207 (2008) - [c36]Nicolas Gama, Phong Q. Nguyen:
Predicting Lattice Reduction. EUROCRYPT 2008: 31-51 - [c35]Nicolas Gama, Phong Q. Nguyen:
Finding short lattice vectors within mordell's inequality. STOC 2008: 207-216 - [i5]Gaëtan Leurent, Phong Q. Nguyen:
How Risky is the Random-Oracle Model? IACR Cryptol. ePrint Arch. 2008: 441 (2008) - 2007
- [c34]Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen:
Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5. CRYPTO 2007: 13-30 - [c33]Nicolas Gama, Phong Q. Nguyen:
New Chosen-Ciphertext Attacks on NTRU. Public Key Cryptography 2007: 89-106 - [i4]Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen:
Automatic Search of Differential Path in MD4. IACR Cryptol. ePrint Arch. 2007: 206 (2007) - 2006
- [j4]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): 324-335 (2006) - [c32]Phong Q. Nguyen, Damien Stehlé:
LLL on the Average. ANTS 2006: 238-256 - [c31]Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Phong Q. Nguyen:
Rankin's Constant and Blockwise Lattice Reduction. CRYPTO 2006: 112-130 - [c30]Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguyen:
Symplectic Lattice Reduction and NTRU. EUROCRYPT 2006: 233-253 - [c29]Phong Q. Nguyen, Oded Regev:
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. EUROCRYPT 2006: 271-288 - [e1]Phong Q. Nguyen:
Progressin Cryptology - VIETCRYPT 2006, First International Conference on Cryptology in Vietnam, Hanoi, Vietnam, September 25-28, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4341, Springer 2006, ISBN 3-540-68799-8 [contents] - [i3]Phong Q. Nguyen:
A Note on the Security of NTRUSign. IACR Cryptol. ePrint Arch. 2006: 387 (2006) - 2005
- [c28]Phong Q. Nguyen, Jacques Stern:
Adapting Density Attacks to Low-Weight Knapsacks. ASIACRYPT 2005: 41-58 - [c27]Phong Q. Nguyen, Damien Stehlé:
Floating-Point LLL Revisited. EUROCRYPT 2005: 215-233 - [c26]Eli Biham, Louis Granboulan, Phong Q. Nguyen:
Impossible Fault Analysis of RC4 and Differential Fault Analysis of RC4. FSE 2005: 359-367 - [c25]David Naccache, Phong Q. Nguyen, Michael Tunstall, Claire Whelan:
Experimenting with Faults, Lattices and the DSA. Public Key Cryptography 2005: 16-28 - [r2]Phong Q. Nguyen:
Lattice. Encyclopedia of Cryptography and Security 2005 - [r1]Phong Q. Nguyen:
Lattice Reduction. Encyclopedia of Cryptography and Security 2005 - 2004
- [c24]Phong Q. Nguyen, Damien Stehlé:
Low-Dimensional Lattice Basis Reduction Revisited. ANTS 2004: 338-357 - [c23]Phong Q. Nguyen:
Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3. EUROCRYPT 2004: 555-570 - [i2]David Naccache, Phong Q. Nguyen, Michael Tunstall, Claire Whelan:
Experimenting with Faults, Lattices and the DSA. IACR Cryptol. ePrint Arch. 2004: 277 (2004) - 2003
- [j3]Phong Q. Nguyen, Igor E. Shparlinski:
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces. Des. Codes Cryptogr. 30(2): 201-217 (2003) - [j2]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): 1473-1485 (2003) - [c22]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: 226-246 - 2002
- [j1]Phong Q. Nguyen, Igor E. Shparlinski:
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptol. 15(3): 151-176 (2002) - [c21]Dario Catalano, Phong Q. Nguyen, Jacques Stern:
The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm. ASIACRYPT 2002: 299-310 - [c20]Phong Q. Nguyen, David Pointcheval:
Analysis and Improvements of NTRU Encryption Paddings. CRYPTO 2002: 210-225 - [c19]Markus Jakobsson, Ari Juels, Phong Q. Nguyen:
Proprietary Certificates. CT-RSA 2002: 164-181 - 2001
- [c18]Phong Q. Nguyen, Igor E. Shparlinski:
On the Insecurity of a Server-Aided RSA Protocol. ASIACRYPT 2001: 21-35 - [c17]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: 97-109 - [c16]Phong Q. Nguyen, Jacques Stern:
The Two Faces of Lattices in Cryptology. CaLC 2001: 146-180 - [c15]Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham, Phong Q. Nguyen:
Paillier's cryptosystem revisited. CCS 2001: 206-214 - [c14]Phong Q. Nguyen:
The Two Faces of Lattices in Cryptology. Selected Areas in Cryptography 2001: 313 - 2000
- [c13]Phong Q. Nguyen, Jacques Stern:
Lattice Reduction in Cryptology: An Update. ANTS 2000: 85-112 - [c12]Glenn Durfee, Phong Q. Nguyen:
Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99. ASIACRYPT 2000: 14-29 - [c11]Dan Boneh, Antoine Joux, Phong Q. Nguyen:
Why Textbook ElGamal and RSA Encryption Are Insecure. ASIACRYPT 2000: 30-43 - [c10]Daniel Bleichenbacher, Phong Q. Nguyen:
Noisy Polynomial Interpolation and Noisy Chinese Remaindering. EUROCRYPT 2000: 53-69 - [c9]Louis Granboulan, Phong Q. Nguyen, Fabrice Noilhan, Serge Vaudenay:
DFCv2. Selected Areas in Cryptography 2000: 57-71
1990 – 1999
- 1999
- [c8]Phong Q. Nguyen, Jacques Stern:
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications. CRYPTO 1999: 31-46 - [c7]Phong Q. Nguyen:
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97. CRYPTO 1999: 288-304 - [c6]Christophe Coupé, Phong Q. Nguyen, Jacques Stern:
The Effectiveness of Lattice Attacks Against Low-Exponent RSA. Public Key Cryptography 1999: 204-218 - 1998
- [c5]Phong Q. Nguyen:
A Montgomery-Like Square Root for the Number Field Sieve. ANTS 1998: 151-168 - [c4]Phong Q. Nguyen, Jacques Stern:
The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure. ASIACRYPT 1998: 372-379 - [c3]Phong Q. Nguyen, Jacques Stern:
Cryptanalysis of the Ajtai-Dwork Cryptosystem. CRYPTO 1998: 223-242 - [c2]Phong Q. Nguyen, Jacques Stern:
Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97. Selected Areas in Cryptography 1998: 213-218 - [i1]Phong Q. Nguyen, Jacques Stern:
A Converse to the Ajtai-Dwork Security Proof and its Cryptographic Implications. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c1]Phong Q. Nguyen, Jacques Stern:
Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations. CRYPTO 1997: 198-212
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-20 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
