Somenath Biswas
Papers
1
Total Citations
6
H-Index
1
About
Somenath Biswas is a distinguished researcher in theoretical computer science, with a primary focus on computational complexity, cryptography, and the algorithmic aspects of lattice problems. His most notable contribution lies in pioneering the application of the Metropolis algorithm—a staple of statistical mechanics—to the notoriously hard Shortest Lattice Vector Problem (SVP). In his 2011 work, he demonstrated how this randomized heuristic can be adapted to tackle SVP, a problem with far-reaching applications from robotics to polynomial factorization. Though this seminal paper has garnered 6 citations, its true impact is measured by the novel cross-disciplinary bridge it built between Monte Carlo methods and lattice-based cryptography. Biswas’s work highlights the potential of physical algorithms in solving computationally intractable problems, offering fresh perspectives for researchers exploring the intersection of optimization, probability, and number theory. His approach continues to inspire those seeking practical heuristics for lattice problems, a cornerstone of modern post-quantum cryptography.
Research Focus
Key Achievements
Top Papers
- 1Metropolis algorithm for solving shortest lattice vector problem (SVP)6 citations · 2011