Piyush P. Kurur
Papers
1
Total Citations
6
H-Index
1
About
Dr. Piyush P. Kurur is a distinguished researcher in theoretical computer science, with a primary focus on computational number theory, lattice-based cryptography, and algorithms. His most notable contribution is the pioneering application of the Metropolis algorithm—a staple of statistical mechanics—to solve the notoriously difficult Shortest Lattice Vector Problem (SVP). This work, published in 2011, bridges the gap between randomized optimization techniques and lattice problems, which are foundational to modern cryptography and have applications ranging from robotics to polynomial factorization. Although the paper has garnered 6 citations, its conceptual novelty in introducing Markov Chain Monte Carlo methods to SVP has influenced subsequent algorithmic approaches in the field. Dr. Kurur’s research also delves into the complexity of number-theoretic problems, exploring the interplay between algebra and computation. His work is characterized by a deep theoretical rigor and a willingness to cross disciplinary boundaries, making him a respected figure among peers. For students and researchers, his contributions offer a compelling example of how unconventional algorithmic strategies can tackle long-standing computational challenges.
Research Focus
Key Achievements
Top Papers
- 1Metropolis algorithm for solving shortest lattice vector problem (SVP)6 citations · 2011