62 citations · 134 across the 12 of their papers we have counts for
15 papers
Stochastic global optimization of continuous functions via random walks on Grassmannians
Kartik Gupta, Stephen D. Miller, Pradeep Ravikumar +1
We introduce a stochastic global optimization method based on random walks on Grassmannian manifolds. To minimize a continuous objective , t…
Rigorous Analysis of a Randomised Number Field Sieve
Jonathan Lee, Ramarathnam Venkatesan
Factorisation of integers is of number theoretic and cryptographic significance. The Number Field Sieve (NFS) introduced circa 1990, is still the state of the art algorithm, bu…
Coppersmith's lattices and "focus groups": an attack on small-exponent RSA
Stephen D. Miller, Bhargav Narayanan, Ramarathnam Venkatesan
We present a principled technique for reducing the lattice and matrix size in some applications of Coppersmith's lattice method for finding roots of modular polynomial equations. M…
Balancing sums of random vectors
Juhan Aru, Bhargav Narayanan, Alex Scott +1
We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition thes…
Information Flows in Encrypted Databases
Kapil Vaswani, Ravi Ramamurthy, Ramarathnam Venkatesan
In encrypted databases, sensitive data is protected from an untrusted server by encrypting columns using partially homomorphic encryption schemes, and storing encryption keys in a…
Non-Abelian Analogs of Lattice Rounding
Evgeni Begelfor, Stephen D. Miller, Ramarathnam Venkatesan
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space.…