What is he best known for?
The fields of study he is best known for:
- Cryptography
- Public-key cryptography
- Algorithm
The scientist’s investigation covers issues in Algorithm, Lattice, Discrete mathematics, Lattice problem and Theoretical computer science.
The study incorporates disciplines such as Hidden number problem, Digital Signature Algorithm and Cryptographic nonce in addition to Algorithm.
His research investigates the link between Lattice and topics such as Cryptography that cross with problems in Public-key cryptography.
As a part of the same scientific family, Phong Q. Nguyen mostly works in the field of Discrete mathematics, focusing on Combinatorics and, on occasion, Hermite polynomials.
The Lattice problem study which covers Enumeration that intersects with Decoding methods, Speedup and Encryption.
His study on Theoretical computer science also encompasses disciplines like
- Cryptosystem that intertwine with fields like Commitment scheme and Modulo,
- Cryptanalysis which connect with Hash function.
His most cited work include:
- BKZ 2.0: better lattice security estimates (373 citations)
- Predicting lattice reduction (335 citations)
- The Two Faces of Lattices in Cryptology (227 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Algorithm, Discrete mathematics, Theoretical computer science, Cryptography and Public-key cryptography.
He has included themes like Lattice, Speedup, Cryptographic nonce and Enumeration in his Algorithm study.
His work on Lattice sieving as part of general Lattice study is frequently connected to Running time and Short vector, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
The Discrete mathematics study combines topics in areas such as Exponentiation, Reduction, Homomorphic encryption and Combinatorics.
His Theoretical computer science research integrates issues from Plaintext, Cryptanalysis, Subset sum problem, Hash function and Cryptosystem.
In Cryptography, Phong Q. Nguyen works on issues like Number theory, which are connected to Hermite normal form.
He most often published in these fields:
- Algorithm (32.54%)
- Discrete mathematics (29.37%)
- Theoretical computer science (24.60%)
What were the highlights of his more recent work (between 2014-2020)?
- Lattice (20.63%)
- Combinatorics (17.46%)
- Lattice problem (21.43%)
In recent papers he was focusing on the following fields of study:
Phong Q. Nguyen spends much of his time researching Lattice, Combinatorics, Lattice problem, Algorithm and Discrete mathematics.
His work on Integer lattice as part of general Lattice research is often related to Lattice-based cryptography, thus linking different fields of science.
His Combinatorics study combines topics from a wide range of disciplines, such as Range, Homomorphic encryption, Reduction and Public-key cryptography.
His biological study spans a wide range of topics, including Order, Group, Natural density, Asymptotic formula and Integer.
In his study, which falls under the umbrella issue of Algorithm, Enumeration and Statistical inference is strongly linked to Speedup.
Phong Q. Nguyen interconnects Cryptosystem, Upper and lower bounds, Bounded function and Exponential function in the investigation of issues within Discrete mathematics.
Between 2014 and 2020, his most popular works were:
- Simpler Efficient Group Signatures from Lattices (57 citations)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (30 citations)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (30 citations)
In his most recent research, the most cited papers focused on:
- Cryptography
- Public-key cryptography
- Algebra
His primary areas of investigation include Enumeration, Lattice, Speedup, Algorithm and Discrete mathematics.
His Lattice research includes elements of Cryptosystem, Upper and lower bounds, Bounded function and Exponential function.
He has included themes like Statistical inference, Algebraic enumeration and Lattice in his Speedup study.
His work in the fields of Algorithm, such as Tree traversal, intersects with other areas such as Sound analysis.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
