Phong Q. Nguyen

According to our database1, Phong Q. Nguyen authored at least 85 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Slide Reduction, Revisited - Filling the Gaps in SVP Approximation.
CoRR, 2019

Computing a Lattice Basis Revisited.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Lower Bounds on Lattice Enumeration with Extreme Pruning.
IACR Cryptology ePrint Archive, 2018

Quantum Lattice Enumeration and Tweaking Discrete Pruning.
IACR Cryptology ePrint Archive, 2018

Lower Bounds on Lattice Enumeration with Extreme Pruning.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Quantum Lattice Enumeration and Tweaking Discrete Pruning.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning.
IACR Cryptology ePrint Archive, 2017

Random Sampling Revisited: Lattice Enumeration with Discrete Pruning.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
Counting Co-Cyclic Lattices.
SIAM J. Discrete Math., 2016

Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015
Simpler Efficient Group Signatures from Lattices.
IACR Cryptology ePrint Archive, 2015

Counting Co-Cyclic Lattices.
CoRR, 2015

Simpler Efficient Group Signatures from Lattices.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

2014
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions.
IACR Cryptology ePrint Archive, 2014

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
IACR Cryptology ePrint Archive, 2014

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

2013
Rounding LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
IACR Cryptology ePrint Archive, 2013

Solving BDD by Enumeration: An Update.
Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

2012
Lattice-Based Fault Attacks on Signatures.
Proceedings of the Fault Analysis in Cryptography, 2012

Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Modulus fault attacks against RSA-CRT signatures.
J. Cryptographic Engineering, 2011

Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers.
IACR Cryptology ePrint Archive, 2011

Modulus Fault Attacks Against RSA-CRT Signatures.
IACR Cryptology ePrint Archive, 2011

Lattice Reduction Algorithms: Theory and Practice.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Cryptanalysis vs. Provable Security.
Proceedings of the Information Security and Cryptology - 7th International Conference, 2011

Modulus Fault Attacks against RSA-CRT Signatures.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2011 - 13th International Workshop, Nara, Japan, September 28, 2011

Breaking Fully-Homomorphic-Encryption Challenges.
Proceedings of the Cryptology and Network Security - 10th International Conference, 2011

BKZ 2.0: Better Lattice Security Estimates.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
Hermite's Constant and Lattice Algorithms.
Proceedings of the LLL Algorithm - Survey and Applications, 2010

Lattice Enumeration Using Extreme Pruning.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009
Low-dimensional lattice basis reduction revisited.
ACM Trans. Algorithms, 2009

An LLL Algorithm with Quadratic Complexity.
SIAM J. Comput., 2009

Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures.
J. Cryptology, 2009

How Risky Is the Random-Oracle Model?
Proceedings of the Advances in Cryptology, 2009

Factoring pq2 with Quadratic Forms: Nice Cryptanalyses.
Proceedings of the Advances in Cryptology, 2009

2008
Sieve algorithms for the shortest vector problem are practical.
J. Mathematical Cryptology, 2008

How Risky is the Random-Oracle Model?
IACR Cryptology ePrint Archive, 2008

Finding short lattice vectors within mordell's inequality.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Predicting Lattice Reduction.
Proceedings of the Advances in Cryptology, 2008

2007
Automatic Search of Differential Path in MD4.
IACR Cryptology ePrint Archive, 2007

New Chosen-Ciphertext Attacks on NTRU.
Proceedings of the Public Key Cryptography, 2007

Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5.
Proceedings of the Advances in Cryptology, 2007

2006
Testing set proportionality and the Ádám isomorphism of circulant graphs.
J. Discrete Algorithms, 2006

A Note on the Security of NTRUSign.
IACR Cryptology ePrint Archive, 2006

Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Symplectic Lattice Reduction and NTRU.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Rankin's Constant and Blockwise Lattice Reduction.
Proceedings of the Advances in Cryptology, 2006

LLL on the Average.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005
Lattice Reduction.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Lattice.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Experimenting with Faults, Lattices and the DSA.
Proceedings of the Public Key Cryptography, 2005

Impossible Fault Analysis of RC4 and Differential Fault Analysis of RC4.
Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

Floating-Point LLL Revisited.
Proceedings of the Advances in Cryptology, 2005

Adapting Density Attacks to Low-Weight Knapsacks.
Proceedings of the Advances in Cryptology, 2005

2004
Experimenting with Faults, Lattices and the DSA.
IACR Cryptology ePrint Archive, 2004

Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3.
Proceedings of the Advances in Cryptology, 2004

Low-Dimensional Lattice Basis Reduction Revisited.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation.
Math. Comput., 2003

The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces.
Des. Codes Cryptogr., 2003

The Impact of Decryption Failures on the Security of NTRU Encryption.
Proceedings of the Advances in Cryptology, 2003

2002
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.
J. Cryptology, 2002

Proprietary Certificates.
Proceedings of the Topics in Cryptology, 2002

Analysis and Improvements of NTRU Encryption Paddings.
Proceedings of the Advances in Cryptology, 2002

The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm.
Proceedings of the Advances in Cryptology, 2002

2001
The Two Faces of Lattices in Cryptology.
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

Paillier's cryptosystem revisited.
Proceedings of the CCS 2001, 2001

The Two Faces of Lattices in Cryptology.
Proceedings of the Cryptography and Lattices, International Conference, 2001

The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces.
Proceedings of the Cryptography and Lattices, International Conference, 2001

On the Insecurity of a Server-Aided RSA Protocol.
Proceedings of the Advances in Cryptology, 2001

2000
DFCv2.
Proceedings of the Selected Areas in Cryptography, 7th Annual International Workshop, 2000

Noisy Polynomial Interpolation and Noisy Chinese Remaindering.
Proceedings of the Advances in Cryptology, 2000

Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99.
Proceedings of the Advances in Cryptology, 2000

Why Textbook ElGamal and RSA Encryption Are Insecure.
Proceedings of the Advances in Cryptology, 2000

Lattice Reduction in Cryptology: An Update.
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1999
The Effectiveness of Lattice Attacks Against Low-Exponent RSA.
Proceedings of the Public Key Cryptography, 1999

The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications.
Proceedings of the Advances in Cryptology, 1999

Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97.
Proceedings of the Advances in Cryptology, 1999

1998
A Converse to the Ajtai-Dwork Security Proof and its Cryptographic Implications
Electronic Colloquium on Computational Complexity (ECCC), 1998

Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97.
Proceedings of the Selected Areas in Cryptography '98, 1998

Cryptanalysis of the Ajtai-Dwork Cryptosystem.
Proceedings of the Advances in Cryptology, 1998

The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure.
Proceedings of the Advances in Cryptology, 1998

A Montgomery-Like Square Root for the Number Field Sieve.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997
Merkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations.
Proceedings of the Advances in Cryptology, 1997


  Loading...