Chris Peikert - Concepedia

Author

Chris Peikert

Georgia Institute of Technology ORCID

Also Known As

Chris Peikert, Malkin, Tal, Malkin, Tal 1970-, Peikert, Chris

131

Publications

14.7K

Citations

H-Index

Concepts

All Affiliations

Georgia Institute of Technology New York University Massachusetts Institute of Technology SRI International University of Michigan

About

Chris Peikert is an author at Georgia Institute of Technology specializing in engineering, computer science, and data security.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	19	22	3.8K
2	Computer Science	17	20	3.2K
3	Computer Engineering	6	6	295
4	Business	1	1	91
5	Communication	1	1	91

Chris Peikert

Publications

4.5K

Citations

H-Index

Page 1

	Year	Citations
Public-key cryptosystems from the worst-case shortest vector problem Chris Peikert Cryptographic PrimitiveEngineeringQuantum ReductionInformation SecurityComputational Complexity	2009	800
On Ideal Lattices and Learning with Errors over Rings Vadim Lyubashevsky, Chris Peikert, Oded Regev Journal of the ACM Mathematical ProgrammingCryptographic PrimitiveRing-lwe DistributionEngineeringRandom Linear Equations	2013	799
Classical hardness of learning with errors Zvika Brakerski, Adeline Roux-Langlois, Chris Peikert, Mathematical ProgrammingQuantum ScienceEngineeringQuantum ComputingComputational Learning Theory	2013	584
Generating Shorter Bases for Hard Random Lattices Joël Alwen, Chris Peikert Theory of Computing Systems Mathematical ProgrammingEngineeringLattice (Order)Randomized AlgorithmComputational Complexity	2010	410
Bonsai Trees, or How to Delegate a Lattice Basis David M. Cash, Dennis Hofheinz, Eike Kiltz, Journal of Cryptology Lattice (Order)Tree AutomatonDiscrete MathematicsLattice TheoryBonsai Trees	2011	287
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem Chris Peikert IACR Cryptology ePrint Archive	2009	201
Pseudorandomness of ring-LWE for any ring and modulus Chris Peikert, Oded Regev, Noah Stephens-Davidowitz Lattice ProblemsEngineeringPolynomial-time Quantum ReductionQuantum ComputingQuantum Optimization Algorithm	2017	167
CraterLake Nikola Samardzic, Axel Feldmann, Aleksandar Krastev, Cryptographic PrimitiveEngineeringInformation SecurityComputer ArchitectureConfidential Computing	2022	155
Generating Shorter Bases for Hard Random Lattices Joël Alwen, Chris Peikert DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) Mathematical ProgrammingCryptographic PrimitiveEngineeringComputational ComplexityOutput Basis	2009	141
Robustness of the Learning with Errors Assumption Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, DSpace@MIT (Massachusetts Institute of Technology)	2010	139

Page 1